Abstract
Recognition-based segmentation strategies have greatly improved the performance of optical character recognition systems. The key issue of these strategies is to design a classifier that can provide accurate rejection information. Many learning algorithms, such as GLVQ and H2M-LVQ, are not suitable for large category sets and multiple prototypes. More seriously, they often suffer from local minimum state and overtraining. In this paper, we propose an extended learning vector quantization algorithm which can efficiently train the nearest prototype classifier with negative samples. The cost function is based on multiple confusable prototype-pairs so that our algorithm is insensitive to initialization. We also introduce the criterion of safe zone to avoid overtraining. Experimental results show that the classifier trained by our proposed method can achieve good recognition performance and can provide accurate rejection information for segmentation.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Huo, Q., Feng, Z.D.: Improving Chinese/English OCR Performance by Using MCE-based Character-pairModeling and Negative Training. In: Proceedings of the Seventh International Conference on Document Analysis and Recognition, Vol. 1. IEEE (2003)
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 (1998) 160–164
Veenman, C.J., Reinders, M.J.: The Nearest Subclass Classifier: A Compromise between the Nearest Mean and Nearest Neighbor Classifier. IEEE Transaction on Pattern Analysis and Machine Intelligence. 27 (2005) 1417–1429
Liu, C.L., Nakagawa, M.: Evaluation of Prototype Learning Algorithms for Nearest-neighbor Classifier in Application to Handwritten Character Recognition. Pattern Recognition. 34 (2001) 601–615
Pedreira, C.E.: Learning Vector Quantization with Training Data Selection. IEEE Transaction on Pattern Analysis and Machine Intelligence. 28 (2006) 157–162
Qin, A.K., Suganthan, P.N.: Initialization Insensitive LVQ Algorithm Based on Cost-function Adaptation. Pattern Recognition. 38 (2005) 773–776
Seo, S., Bode, M., Obermayer, K.: Soft Nearest Prototype Classification. IEEE Transaction on Neural Networks. 14 (2003) 390–398
Sato, A.S., Yamada, K.: Generalized Learning Vector Quantization. In: Advances in Neural Information Processing Systems, Vol. 7. MIT Press (1995)
Palmes, P.P., Hayasaka, T., Usui, S., Obermayer, K.: Mutation-Based Genetic Neural Network. IEEE Transaction on Neural Networks. 16 (2005) 587–600
Kato, N., Suzuki, M., Omachi, S., Aso, H., Nemoto, Y: A Handwritten Character Recognition System Using Directional Element Feature and Asymmetric Mahalanobis Distance. IEEE Transaction on Pattern Analysis and Machine Intelligence. 21 (1999) 258–262
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Xu, L., Xiao, BH., Wang, CH., Dai, RW. (2006). An Extended Learning Vector Quantization Algorithm Aiming at Recognition-Based Character Segmentation. In: Huang, DS., Li, K., Irwin, G.W. (eds) Intelligent Computing in Signal Processing and Pattern Recognition. Lecture Notes in Control and Information Sciences, vol 345. Springer, Berlin, Heidelberg . https://doi.org/10.1007/978-3-540-37258-5_14
Download citation
DOI: https://doi.org/10.1007/978-3-540-37258-5_14
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-37257-8
Online ISBN: 978-3-540-37258-5
eBook Packages: EngineeringEngineering (R0)