TY - JOUR
T1 - An approximate string matching algorithm for on-line Chinese character recognition
AU - Pao, Derek C.W.
AU - Sun, M. C.
AU - Lam, Murphy C.H.
PY - 1997/9
Y1 - 1997/9
N2 - We model a Chinese character by a linear sequence of straight line segments. The 2-dimensional structure of the character is captured by the use of pseudo strokes and stroke length attributes. An effective string match algorithm has been developed which can tolerate common types of distortions, e.g. connected strokes, missing/extra strokes, and variations in writing sequence. A prototype system with 5401 commonly used Chinese characters has been built, and good recognition performance has been achieved. © 1997 Elsevier Science B.V.
AB - We model a Chinese character by a linear sequence of straight line segments. The 2-dimensional structure of the character is captured by the use of pseudo strokes and stroke length attributes. An effective string match algorithm has been developed which can tolerate common types of distortions, e.g. connected strokes, missing/extra strokes, and variations in writing sequence. A prototype system with 5401 commonly used Chinese characters has been built, and good recognition performance has been achieved. © 1997 Elsevier Science B.V.
KW - Approximate string matching
KW - Chinese character recognition
KW - Straight-segments based model
UR - http://www.scopus.com/inward/record.url?scp=0039506519&partnerID=8YFLogxK
UR - https://www.scopus.com/record/pubmetrics.uri?eid=2-s2.0-0039506519&origin=recordpage
U2 - 10.1016/s0262-8856(96)01145-6
DO - 10.1016/s0262-8856(96)01145-6
M3 - RGC 21 - Publication in refereed journal
SN - 0262-8856
VL - 15
SP - 695
EP - 703
JO - Image and Vision Computing
JF - Image and Vision Computing
IS - 9
ER -
