An approximate string matching algorithm for on-line Chinese character recognition
Research output: Journal Publications and Reviews (RGC: 21, 22, 62) › 21_Publication in refereed journal › peer-review
Author(s)
Related Research Unit(s)
Detail(s)
| Original language | English |
|---|---|
| Pages (from-to) | 695-703 |
| Journal / Publication | Image and Vision Computing |
| Volume | 15 |
| Issue number | 9 |
| Publication status | Published - Sep 1997 |
Link(s)
Abstract
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.
Research Area(s)
- Approximate string matching, Chinese character recognition, Straight-segments based model
Citation Format(s)
An approximate string matching algorithm for on-line Chinese character recognition. / Pao, Derek C.W.; Sun, M. C.; Lam, Murphy C.H.
In: Image and Vision Computing, Vol. 15, No. 9, 09.1997, p. 695-703.Research output: Journal Publications and Reviews (RGC: 21, 22, 62) › 21_Publication in refereed journal › peer-review
