Modified Quadratic Discriminant Functions and the Application to Chinese Character Recognition
IEEE Transactions on Pattern Analysis and Machine Intelligence
Line search algorithms with guaranteed sufficient decrease
ACM Transactions on Mathematical Software (TOMS)
ICPR '02 Proceedings of the 16 th International Conference on Pattern Recognition (ICPR'02) Volume 3 - Volume 3
IWFHR '02 Proceedings of the Eighth International Workshop on Frontiers in Handwriting Recognition (IWFHR'02)
Convex Optimization
Collection of on-line handwritten Japanese character pattern databases and their analyses
International Journal on Document Analysis and Recognition
A Study On the Use of 8-Directional Features For Online Handwritten Chinese Character Recognition
ICDAR '05 Proceedings of the Eighth International Conference on Document Analysis and Recognition
Online Chinese Character Recognition System with Handwritten Pinyin Input
ICDAR '05 Proceedings of the Eighth International Conference on Document Analysis and Recognition
ICPR '06 Proceedings of the 18th International Conference on Pattern Recognition - Volume 02
ICASSP '01 Proceedings of the Acoustics, Speech, and Signal Processing, 2001. on IEEE International Conference - Volume 03
ICDAR '07 Proceedings of the Ninth International Conference on Document Analysis and Recognition - Volume 02
Discriminative learning quadratic discriminant function for handwriting recognition
IEEE Transactions on Neural Networks
Handwriting Recognition Algorithm in Different Languages: Survey
IVIC '09 Proceedings of the 1st International Visual Informatics Conference on Visual Informatics: Bridging Research and Practice
Hi-index | 0.01 |
The state-of-the-art modified quadratic discriminant function (MQDF) based approach for online handwritten Chinese character recognition (HCCR) assumes that the feature vectors of each character class can be modeled by a Gaussian distribution with a mean vector and a full covariance matrix. In order to achieve a high recognition accuracy, enough number of leading eigenvectors of the covariance matrix have to be retained in MQDF. This paper presents a new approach to modeling each inverse covariance matrix by basis expansion, where expansion coefficients are character-dependent while a common set of basis matrices are shared by all the character classes. Consequently, our approach can achieve a much better accuracy-memory tradeoff. The usefulness of the proposed approach to designing compact HCCR systems has been confirmed and demonstrated by comparative experiments on popular Nakayosi and Kuchibue Japanese character databases.