By Topic

Handwritten word recognition using lexicon free and lexicon directed word recognition algorithms

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
$31 $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)
Shridhar, M. ; Michigan Univ., Dearborn, MI, USA ; Houle, G. ; Kimura, F.

The paper discusses the relative merits and complexities of two word recognition algorithms: lexicon directed and lexicon free techniques. This algorithm operates on a pre-segmented word image and yields the optimum concatenation of the image segments for each word in the lexicon. However, the computational complexity of this algorithm is quite high, as the optimum concatenation is required for every word in the lexicon. In the lexicon free word matching process, the character likelihood for all the letters are calculated and the maximum likelihood value and the associated letter are determined. In this approach an optimum string results from the concatenation process. The word matching process is applied only once for an input word image. Comparative results with regard to accuracy, speed and size of lexicon are presented

Published in:

Document Analysis and Recognition, 1997., Proceedings of the Fourth International Conference on  (Volume:2 )

Date of Conference:

18-20 Aug 1997