Abstract
In this paper we present a novel multistage classification strategy for handwriting Chinese character recognition. In training phase, we search for the most representative prototypes and divide the whole class set into several groups using prototype-based clustering. These groups are extended by nearest-neighbor rule and their centroids are used for coarse classification. In each group, we extract the most discriminative feature by local linear discriminant analysis and design the local classifier. The above-mentioned prototypes and centroids are optimized by a hierarchical learning vector quantization. In recognition phase, we first find the nearest group of the unknown sample, and then get the desired class label through the local classifier. Experiments have been implemented on CASIA database and the results show that the proposed method reaches a reasonable tradeoff between efficiency and accuracy.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Liu, C.L., Mine, R., Koga, M.: Building Compact Classifier for Large Character Set Recognition Using Discriminative Feature Extraction. In: Proceedings of the Eighth International Conference on Document Analysis and Recognition, vol. 2, pp. 846–850. IEEE, Los Alamitos (2005)
Rodrguez, C., Soraluze, I., Muguerza, J.: Hierarchical Classifiers Based on Neighbourhood Criteria with Adaptive Computational Cost. Pattern Recognition 35(12), 2761–2769 (2002)
Liu, C.L., Nakagawa, M.: Precise Candidate Selection for Large Character Set Recognition by Confidence Evaluation. IEEE Transaction on Pattern Analysis and Machine Intelligence 22(6), 636–642 (2000)
Tseng, Y.H., Kuo, C.C., Lee, H.J.: Speeding up Chinese Character Recognition in an Automatic Document Reading System. Pattern Recognition 31(11), 1601–1612 (1998)
Horiuchi, T.: Class-selective Rejection Rule to Minimize the Maximum Distance between Selected Classes. Pattern Recognition 31(10), 1579–1588 (1998)
Ha, T.M.: The Optimum Class-selective Rejection Rule. IEEE Transaction on Pattern Analysis and Machine Intelligence 19(6), 608–615 (1997)
Liu, C.L., Nakagawa, M.: Evaluation of Prototype Learning Algorithms for Nearest-neighbor Classifier in Application to Handwritten Character Recognition. Pattern Recognition 34(3), 601–615 (2001)
Kuncheva, L.I., Bezdek, J.C.: Nearest Prototype Classification: Clustering, Genetic Algorithms, or Random Search? IEEE Transaction on Systems, Man and Cybernetics-Part C 28(1), 160–164 (1998)
Veenman, C.J., Reinders, M.J.T.: The Nearest Subclass Classifier: A Compromise between the Nearest Mean and Nearest Neighbor Classifier. IEEE Transaction on Pattern Analysis and Machine Intelligence 27(9), 1417–1429 (2005)
Sato, A., Yamada, K.: Generalized Learning Vector Quantization. In: Advances in Neural Information Processing Systems, vol. 7, pp. 423–429. MIT Press, Cambridge (1995)
Duda, R.O., Hart, P.E., Stork, D.G.: Pattern Classification. Wiley, Chichester (2000)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Xu, L., Xiao, B., Wang, C., Dai, R. (2006). A Novel Multistage Classification Strategy for Handwriting Chinese Character Recognition Using Local Linear Discriminant Analysis. In: King, I., Wang, J., Chan, LW., Wang, D. (eds) Neural Information Processing. ICONIP 2006. Lecture Notes in Computer Science, vol 4233. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11893257_4
Download citation
DOI: https://doi.org/10.1007/11893257_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-46481-5
Online ISBN: 978-3-540-46482-2
eBook Packages: Computer ScienceComputer Science (R0)