Abstract
In this paper we introduce a constrained Level Building Algorithm (LBA) in order to reduce the search space of a Large Vocabulary Handwritten Word Recognition (LVHWR) system. A time and a length constraint are introduced to limit the number of frames and the number of levels of the LBA respectively. A regression model that fits the response variables, namely, accuracy and speed, to a non-linear function of the constraints is proposed and a statistical experimental design technique is employed to analyse the effects of the two constraints on the responses. Experimental results prove that the inclusion of these constraints improve the recognition speed of the LVHWR system without changing the recognition rate significantly.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Kaltenmeier A, Caesar T, Gloger J M, Mandler E. Sophisticated topology of hidden Markov models for cursive script recognition. 2nd ICDAR, Tsukuba Science City, Japan, 1993, pp 139–142.
Koga M, Mine R, Sako H., Fujisawa H. Lexical search approach for character-string recognition. 3rd IWDAS, Nagano, Japan, 1998, pp 237–251.
Koerich A L, Sabourin R, Suen C Y, El-Yacoubi A. A syntax-directed level building algorithm for large vocabulary handwritten word recognition. 4th IWDAS, 2000, Rio de Janeiro, Brazil.
El-Yacoubi A, Gilloux M, Sabourin R, Suen C Y. An HMM based approach for off-line unconstrained handwritten word modelling and recognition. IEEE Trans on PAMI 1999; 21: 752–760.
Umbach R H, Ney H. Improvements in beam search for 10,000-word continuous-speech recognition. IEEE Trans on SAP 1984; 2: 353–356.
Ney H. The use of a one-stage dynamic programming algorithm for connected word recognition. IEEE Trans on ASSP 1984; 32: 263–271.
Rabiner L R, Levinson S E. A speaker-independent, syntax-directed, connected word recognition system based on hidden Markov models and level building. IEEE Trans on ASSP 1985; 33: 561–573.
Barker T B. Quality by experimental design. Marcel Dekker, NY, 1994.
Grandidier F, Sabourin R, El-Yacoubi A, Gilloux M, Suen C Y. Influence of word length on handwriting recognition. 5th ICDAR, 1999, Bangalore, India, pp 777–780.
Manke S, Finke M, Waibel A. A fast search technique for large vocabulary on-line handwriting recognition. In: Progress in handwriting recognition. World Scientific, Singapore, 1996, pp 437–444.
Dowdy S, Wearden S. Statistics for research. John Wiley & Sons, NY, 1991.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Koerich, A.L., Sabourin, R., Suen, C.Y. (2001). A Time—Length Constrained Level Building Algorithm for Large Vocabulary Handwritten Word Recognition. In: Singh, S., Murshed, N., Kropatsch, W. (eds) Advances in Pattern Recognition — ICAPR 2001. ICAPR 2001. Lecture Notes in Computer Science, vol 2013. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44732-6_13
Download citation
DOI: https://doi.org/10.1007/3-540-44732-6_13
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-41767-5
Online ISBN: 978-3-540-44732-0
eBook Packages: Springer Book Archive