19 January 2009 Online computation of similarity between handwritten characters
Author Affiliations +
Abstract
We are interested in the problem of curve identification, motivated by problems in handwriting recognition. Various geometric approaches have been proposed, with one of the most popular being "elastic matching." We examine the problem using distances defined by inner products on functional spaces. In particular we examine the Legendre and Legendre-Sobolev inner products. We show that both of these can be computed in online constant time. We compare both with elastic matching and conclude that the Legendre-Sobolev distance measure provides a competitive alternative to elastic matching, being almost as accurate and much faster.
© (2009) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Oleg Golubitsky, Oleg Golubitsky, Stephen M. Watt, Stephen M. Watt, } "Online computation of similarity between handwritten characters", Proc. SPIE 7247, Document Recognition and Retrieval XVI, 72470C (19 January 2009); doi: 10.1117/12.806163; https://doi.org/10.1117/12.806163
PROCEEDINGS
10 PAGES


SHARE
RELATED CONTENT

A topological-based spatial data clustering
Proceedings of SPIE (April 19 2016)
G-Space: a linear time graph layout
Proceedings of SPIE (January 27 2008)
Similarity retrieval of motion capture data as time-series
Proceedings of SPIE (December 02 2005)
Efficient topological descriptor for shape representation
Proceedings of SPIE (February 28 2005)

Back to Top