The Community for Technology Leaders
Eighth International Conference on Document Analysis and Recognition (ICDAR'05) (2005)
Seoul, Korea
Aug. 31, 2005 to Sept. 1, 2005
ISSN: 1520-5263
ISBN: 0-7695-2420-6
pp: 839-845
Jonathan Alon , Boston University, MA
Vassilis Athitsos , Boston University, MA
Stan Sclaroff , Boston University, MA
Nearest neighbor classifiers are simple to implement, yet they can model complex non-parametric distributions, and provide state-of-the-art recognition accuracy in OCR databases. At the same time, they may be too slow for practical character recognition, especially when they rely on similarity measures that require computationally expensive pairwise alignments between characters. This paper proposes an efficient method for computing an approximate similarity score between two characters based on their exact alignment to a small number of prototypes. The proposed method is applied to both online and offline character recognition, where similarity is based on widely used and computationally expensive alignment methods, i.e., Dynamic Time Warping and the Hungarian method respectively. In both cases significant recognition speedup is obtained at the expense of only a minor increase in recognition error.

S. Sclaroff, V. Athitsos and J. Alon, "Online and Offline Character Recognition Using Alignment to Prototypes," Eighth International Conference on Document Analysis and Recognition (ICDAR'05)(ICDAR), Seoul, Korea, 2005, pp. 839-845.
83 ms
(Ver 3.3 (11022016))