Character recognition by adaptive statistical similarity

Handwriting recognition and OCR systems need to cope with a wide variety of writing styles and fonts, many of them possibly not previously encountered during training. This paper describes a notion of Bayesian statistical similarity and demonstrates how it can be applied to rapid adaptation to new styles. The ability to generalize across different problem instances is illustrated in the Gaussian case, and the use of statistical similarity Gaussian case is shown to be related to adaptive metric classification methods. The relationship to prior approaches to multitask learning, as well as variable or adaptive metric classification, and hierarchical Bayesian methods, are discussed. Experimental results on character recognition from the NIST3 database are presented.

[1]  David G. Lowe,et al.  Similarity Metric Learning for a Variable-Kernel Classifier , 1995, Neural Computation.

[2]  Shigeo Abe DrEng Pattern Classification , 2001, Springer London.

[3]  Dimitrios Gunopulos,et al.  An Adaptive Metric Machine for Pattern Classification , 2000, NIPS.

[4]  Thomas M. Breuel,et al.  Classification using a hierarchical Bayesian approach , 2002, Object recognition supported by user interaction for service robots.

[5]  David G. Stork,et al.  Pattern Classification (2nd ed.) , 1999 .

[6]  Thomas M. Breuel,et al.  Classification by probabilistic clustering , 2001, 2001 IEEE International Conference on Acoustics, Speech, and Signal Processing. Proceedings (Cat. No.01CH37221).

[7]  Yoshua Bengio,et al.  Gradient-based learning applied to document recognition , 1998, Proc. IEEE.

[8]  David G. Stork,et al.  Pattern Classification , 1973 .

[9]  Rich Caruana,et al.  Algorithms and Applications for Multitask Learning , 1996, ICML.