Offline handwritten Chinese character recognition by radical decomposition
Authors:
Open Access
- 1 March 2003
- journal article
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Asian Language Information Processing
- Vol. 2 (1) , 27-48
Abstract
Offline handwritten Chinese character recognition is a very hard pattern-recognition problem of considerable practical importance. Two popular approaches are to extract features holistically from the character image or to decompose characters structurally into component parts---usually strokes. Here we take a novel approach, that of decomposing into radicals on the basis of image information (i.e., without first decomposing into strokes). During training, 60 examples of each radical were represented by "landmark" points, labeled semiautomatically, with radicals in different characteristic positions treated as distinctly different radicals. Kernel principal-component analysis then captured the main (nonlinear) variations around the mean radical. During the recognition, the dynamic tunneling algorithm was used to search for optimal shape parameters in terms of chamfer distance minimization. Considering character composition as a Markov process in which up to four radicals are combined in some assumed sequential order, we can recognize complete, hierarchically-composed characters by using the Viterbi algorithm. This gave a character recognition rate of 93.5% characters correct (writer-independent) on a test set of 430,800 characters from 2,154 character classes composed of 200 radical categories, which is comparable to the best reported results in the literature. Although the initial semiautomatic landmark labeling is time consuming, the decomposition approach is theoretically well-motivated and allows the different sources of variability in Chinese handwriting to be handled separately and by the most appropriate means--either learned from example data or incorporated as prior knowledge. Hence, high generalizability is obtained from small amounts of training data, and only simple prior knowledge needs to be incorporated, thus promising robust recognition performance. As such, there is very considerable potential for further development and improvement in the direction of larger character sets and less constrained writing conditions.Keywords
This publication has 22 references indexed in Scilit:
- Complex character decomposition using deformable modelIEEE Transactions on Systems, Man and Cybernetics, Part C (Applications and Reviews), 2001
- On-Line Chinese Character Recognition Via a Representation of Spatial Relationships Between StrokesInternational Journal of Pattern Recognition and Artificial Intelligence, 1997
- Active Shape Models-Their Training and ApplicationComputer Vision and Image Understanding, 1995
- Optical recognition of handwritten Chinese characters: Advances since 1980Pattern Recognition, 1993
- Comparing images using the Hausdorff distanceIEEE Transactions on Pattern Analysis and Machine Intelligence, 1993
- One-pass parallel thinning: analysis, properties, and quantitative evaluationIEEE Transactions on Pattern Analysis and Machine Intelligence, 1992
- Hierarchical chamfer matching: a parametric edge matching algorithmIEEE Transactions on Pattern Analysis and Machine Intelligence, 1988
- Principal Component Analysis1986
- An Interactive System for Chinese Character Generation and RetrievalIEEE Transactions on Systems, Man, and Cybernetics, 1973
- The viterbi algorithmProceedings of the IEEE, 1973