By Topic

Handwritten word recognition using dynamic matching with variable duration

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

3 Author(s)
G. Kim ; Center of Excellence for Document Anal. & Recognition, State Univ. of New York, Buffalo, NY, USA ; V. Govindaraju ; S. N. Srihari

A fast matching algorithm using dynamic programming for handwritten word recognition is presented. The variable duration for each character is defined based on the character segmentation statistics obtained during the training phase. The variable duration represents the possible ways in which a character image can be split into segments. Experimental results prove that our approach using the variable duration outperforms the method using fixed duration in terms of both accuracy and speed. The processing time for the matching process increases at the rate of log(N) as the lexicon size N increases. A speed of 200 msec, including image handling procedures, on a single Sparc 10 platform and a recognition accuracy of 96.7% are achieved for a lexicon size of 10

Published in:

Acoustics, Speech, and Signal Processing, 1996. ICASSP-96. Conference Proceedings., 1996 IEEE International Conference on  (Volume:6 )

Date of Conference:

7-10 May 1996