By Topic

An on-line handwriting recognition system using Fisher segmental matching and Hypotheses Propagation Network

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Jong Oh ; New York Univ., NY, USA ; D. Geiger

We propose an on-line handwriting recognition approach that integrates local bottom-up constructs with a global top-down measure into a modular recognition engine. The bottom-up process uses local point features for hypothesizing character segmentations and the top-down part performs shape matching for evaluating the segmentations. The shape comparison, called Fisher segmental matching, is based on Fisher's linear discriminant analysis. Along with an efficient ligature modeling, the segmentations and their matching scores are integrated into a recognition engine termed Hypotheses Propagation Network, which runs a variant of the topological sort algorithm of graph search. The result is a system that is more shape-oriented less dependent on local and temporal features, modular in construction and has a rich range of opportunities for further extensions. Our system currently performs at 95% of recognition rate on cursive scripts with a 460 word dictionary

Published in:

Computer Vision and Pattern Recognition, 2000. Proceedings. IEEE Conference on  (Volume:2 )

Date of Conference:

2000