Title
A complexity measure based algorithm for multifont Chinese character recognition
Abstract
A novel method for recognizing multifont Chinese characters is presented. After character skeleton extraction, a classification is first made according to a new complexity measure: a weighted sum of endpoints and nodes. Unlabeled feature point matching between an input character and model characters is realized by minimizing an approximate Euclidean distance. The final recognition decision is based on calculating a flexible similarity function which depends on the feature point dispersion of the considered fonts. Experiments on a database of 1000 Chinese characters have been conducted. The recognition rate exceeds 96%
Year
DOI
Venue
1990
10.1109/ICPR.1990.118167
Pattern Recognition, 1990. Proceedings., 10th International Conference  
Keywords
DocType
Volume
character recognition,chinese character recognition,euclidean distance,feature point dispersion,feature point matching,skeleton extraction,pattern recognition,stability,skeleton,impedance matching,statistical analysis
Conference
i
Citations 
PageRank 
References 
2
0.50
2
Authors
3
Name
Order
Citations
PageRank
Zhang, S.120.50
Taconet, B.270.99
Faure, A.330.86