This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Ninth International Workshop on Frontiers in Handwriting Recognition (IWFHR'04)
Fast Two-Level HMM Decoding Algorithm for Large Vocabulary Handwriting Recognition
Kokubunji, Tokyo, Japan
October 26-October 29
ISBN: 0-7695-2187-8
Alessandro L. Koerich, Pontifical Catholic University of Paraná
Robert Sabourin, École de Technologie Supérieure
Ching Y. Suen, Concordia University
To support large vocabulary handwriting recognition in standard computer platforms, a fast algorithm for hidden Markov model alignment is necessary. To address this problem, we propose a non-heuristic fast decoding algorithm which is based on hidden Markov model representation of characters. The decoding algorithm breaks up the computation of word likelihoods into two levels: state level and character level. Given an observation sequence, the two level decoding enables the reuse of character likelihoods to decode all words in the lexicon, avoiding repeated computation of state sequences. In an 80,000-word recognition task, the proposed decoding algorithm is about 15 times faster than a conventional Viterbi algorithm, while maintaining the same recognition accuracy.
Citation:
Alessandro L. Koerich, Robert Sabourin, Ching Y. Suen, "Fast Two-Level HMM Decoding Algorithm for Large Vocabulary Handwriting Recognition," iwfhr, pp.232-237, Ninth International Workshop on Frontiers in Handwriting Recognition (IWFHR'04), 2004
Usage of this product signifies your acceptance of the Terms of Use.