By Topic

Online handwritten English word recognition based on cascade connection of character HMMs

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)
Wei Zhao ; Sch. of Comput. Sci. & Technol., Harbin Inst. of Technol., China ; Jia-Feng Liu ; Xiang-Long Tang

In this paper, a cascade connection hidden Markov model (CCHMM) method for online English word recognition is proposed. This model, which allows state transition, skip and duration, extends the way of HMM pattern description of handwriting English words. According to the statistic probabilities, the behavior of handwriting curve may be depicted more precisely. The Viterbi algorithm for the cascade connection model may be applied after the whole sample series of a word is input. Compared with the method of creating models for each word in lexicon, this method gives a faster recognition speed. Experiments show that CCHMM approach could obtain 89.26% recognition rate for the first candidate, while the combination of character and ligature HMM method's first candidate is 82.34%.

Published in:

Machine Learning and Cybernetics, 2002. Proceedings. 2002 International Conference on  (Volume:4 )

Date of Conference:

4-5 Nov. 2002