Experiments with Adaptation Methods in On-line Recognition of Isolated Latin Characters

AbstractThe purpose of this paper is to summarize our work on adaptive on-line recog-nition methods for handwritten characters. Reports on the work have been pub-lished in various conference proceedings and book chapters. As each publicationcovers only some specific part of our work, it is hard to see the whole picture andget a good overview of the whole work. Instead of trying to explain in detail allthe techniques and experiments, we compare them with each other and give moregeneral results.By adaptation we mean that the system is able to learn new writing styles andthus improve its performance. We have had two different approaches to the adapta-tion: experiments have been carried out with both individually adaptive classifiersand adaptive committees of static classifiers.The main techniques applied in our work include the k -Nearest Neighbor andthe Local Subspace Classification rules, Dynamic Time Warpi ng and Levenshteindistances, Learning Vector Quantization, and Dynamically Expanding Context.

[1]  Jorma Laaksonen Local Subspace Classifier , 1997, ICANN.

[2]  J. MacQueen Some methods for classification and analysis of multivariate observations , 1967 .

[3]  Jorma Laaksonen,et al.  Experiments With A Self-Supervised Adaptive Classification Strategy In On-Line Recognition Of Isolat , 1998 .

[4]  Erkki Oja,et al.  Adaptation of Prototype Sets in On-line Recognition of Isolated Handwritten Latin Characters , 1999 .

[5]  Isabelle Guyon,et al.  UNIPEN project of on-line data exchange and recognizer benchmarks , 1994, Proceedings of the 12th IAPR International Conference on Pattern Recognition, Vol. 3 - Conference C: Signal Processing (Cat. No.94CH3440-5).

[6]  P. Gács,et al.  Algorithms , 1992 .

[7]  Peter E. Hart,et al.  Nearest neighbor pattern classification , 1967, IEEE Trans. Inf. Theory.

[8]  Erkki Oja,et al.  Dynamically expanding context as committee adaptation method in on-line recognition of handwritten Latin characters , 1999, Proceedings of the Fifth International Conference on Document Analysis and Recognition. ICDAR '99 (Cat. No.PR00318).

[9]  Erkki Oja,et al.  Comparison of Adaptive Strategies for On-Line Character Recognition , 1998 .

[10]  Erkki Oja,et al.  Adaptive local subspace classifier in on-line recognition of handwritten characters , 1999, IJCNN'99. International Joint Conference on Neural Networks. Proceedings (Cat. No.99CH36339).

[11]  Erkki Oja,et al.  On-line adaptation in recognition of handwritten alphanumeric characters , 1999, Proceedings of the Fifth International Conference on Document Analysis and Recognition. ICDAR '99 (Cat. No.PR00318).

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

[13]  Shane S. Sturrock,et al.  Time Warps, String Edits, and Macromolecules – The Theory and Practice of Sequence Comparison . David Sankoff and Joseph Kruskal. ISBN 1-57586-217-4. Price £13.95 (US$22·95). , 2000 .

[14]  Vincent Kanade,et al.  Clustering Algorithms , 2021, Wireless RF Energy Transfer in the Massive IoT Era.

[15]  Teuvo Kohonen,et al.  Self-Organizing Maps , 2010 .

[16]  Vladimir I. Levenshtein,et al.  Binary codes capable of correcting deletions, insertions, and reversals , 1965 .