Context dependent search in interconnected hidden Markov model for unconstrained handwriting recognition

Viewing a handwritten word as an alternating sequence of characters and ligatures, we proposed a circularly interconnected network of hidden Markov models to model handwritten English words of indefinite length. The recognition problem is then regarded as finding the most probable path in the network for a given input. For the search, Viterbi algorithm is applied with lexicon lookup. To overcome directional sensitivity of the path search, a back-tracking technique is employed that keeps plausible path candidates dynamically within limited storage space.

[1]  W. A. Woods,et al.  Language processing for speech understanding , 1986 .

[2]  Jr. G. Forney,et al.  The viterbi algorithm , 1973 .

[3]  Charles C. Tappert,et al.  Cursive Script Recognition by Elastic Matching , 1982, IBM J. Res. Dev..

[4]  Lambertus Schomaker,et al.  Stroke- versus Character-based Recognition of On-line, Connected Cursive Script , 1991 .

[5]  A. Kundu,et al.  Recognition of handwritten script: a hidden Markov model based approach , 1988, ICASSP-88., International Conference on Acoustics, Speech, and Signal Processing.

[6]  Lawrence R. Rabiner,et al.  A tutorial on hidden Markov models and selected applications in speech recognition , 1989, Proc. IEEE.

[7]  Jin-Young Ha,et al.  Unconstrained handwritten word recognition with interconnected hidden markov models = 상호 연결된 은닉 마르코프 모델을 이용한 무제약 필기 단어 인식 , 1994 .

[8]  Jian Zhou,et al.  Off-Line Handwritten Word Recognition Using a Hidden Markov Model Type Stochastic Network , 1994, IEEE Trans. Pattern Anal. Mach. Intell..

[9]  Ellis Horowitz,et al.  Fundamentals of Computer Algorithms , 1978 .

[10]  Colin Higgins,et al.  Online recognition of connected handwriting by segmentation and template matching , 1992, Proceedings., 11th IAPR International Conference on Pattern Recognition. Vol.II. Conference B: Pattern Recognition Methodology and Systems.

[11]  Alex Waibel,et al.  Readings in speech recognition , 1990 .

[12]  Frank Fallside,et al.  Computer speech processing , 1985 .

[13]  David Malcolm Ford,et al.  On-line recognition of connected handwriting , 1991 .

[14]  Han Shu.  On-line handwriting recognition using hidden Markov models , 1997 .

[15]  M. Kadirkamanathan,et al.  A SCALE-SPACE FILTERING APPROACH TO STROKE SEGMENTATION OF CURSIVE SCRIPT , 1990 .

[16]  L. Baum,et al.  An inequality and associated maximization technique in statistical estimation of probabilistic functions of a Markov process , 1972 .