Accelerating large character set recognition using pivots

This paper proposes a method to accelerate character recognition of a large character set by employing pivots into the search space. We divide the feature space of character categories into smaller clusters and derive the centroid of each cluster as a pivot. Given an input pattern, it is compared with all the pivots and only a limited number of clusters whose pivots have higher similarities (or smaller distances) to the input pattern are searched for with the result that we can accelerate the recognition speed. This is based on the assumption that the search space is a distance space. The method has been applied to pre-classification of a practical off-line Japanese character recognizer with the result that the pre-classification time is reduced to 61 % while keeping its pre-classification recognition rate up to 40 candidates as the same as the original 99.6% and the total recognition time is reduced to 70% of the original time without sacrificing the recognition rate at all. If we sacrifice the pre-classification rate from 99.6% to 97.7%, then its time is reduced to 35% and the total recognition time is reduced to 51.5% with recognition rate as 96.3% from 98.3%.

[1]  Kazuhiko Yamamoto,et al.  Research on Machine Recognition of Handprinted Characters , 1984, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[2]  Wentai Liu,et al.  Optical recognition of handwritten Chinese characters: Advances since 1980 , 1993, Pattern Recognit..

[3]  Takahiko Horiuchi,et al.  On speeding candidate selection in handprinted chinese character recognition , 1991, Pattern Recognit..

[4]  F. Kimura,et al.  Modified quadratic discriminant function and the application to Chinese characters , 1987 .

[5]  Masaki Nakagawa,et al.  Vector-to-Image Transformation of Character Patterns for On-line and Off-line Recognition , 2002, Int. J. Comput. Process. Orient. Lang..

[6]  Proceedings Seventh International Conference on Document Analysis and Recognition , 2003, Seventh International Conference on Document Analysis and Recognition, 2003. Proceedings..

[7]  Masaki Nakagawa,et al.  Collection and analysis of on-line handwritten Japanese character patterns , 2001, Proceedings of Sixth International Conference on Document Analysis and Recognition.

[8]  Fumitaka Kimura,et al.  Modified Quadratic Discriminant Functions and the Application to Chinese Character Recognition , 1987, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[9]  Masaki Nakagawa,et al.  Precise Candidate Selection for Large Character Set Recognition by Confidence Evaluation , 2000, IEEE Trans. Pattern Anal. Mach. Intell..

[10]  Hsi-Jian Lee,et al.  Multi-stage pre-candidate selection in handwritten chinese character recognition systems , 1994, Pattern Recognit..

[11]  J. Tsukumo,et al.  Classification of handprinted Chinese characters using nonlinear normalization and correlation methods , 1988, [1988 Proceedings] 9th International Conference on Pattern Recognition.

[12]  Robert M. Gray,et al.  An Algorithm for Vector Quantizer Design , 1980, IEEE Trans. Commun..

[13]  Hsi-Jian Lee,et al.  PII: S0031-3203(98)00043-0 , 1998 .

[14]  Masaki Nakagawa,et al.  On-line handwritten character pattern database sampled in a sequence of sentences without any writing instructions , 1997, Proceedings of the Fourth International Conference on Document Analysis and Recognition.