A connected character recogniser using level building of HMMs

The recognition of a printed word is traditionally limited by its segmentation into individual characters due to the noise introduced by facsimile transmission, photocopying, handling or ageing. In this paper, a character recogniser is described which does not require a prior segmentation of the word, and is thus suited to the recognition of noisy text images. A novel method is described whereby hidden Markov models are used to recognise a horizontal "profile" of a word generated from an analysis of each vertical line of pixels in its image.

[1]  Mindy Bokser,et al.  Omnidocument technologies , 1992, Proc. IEEE.

[2]  Stephen E. Levinson,et al.  A speaker-independent, syntax-directed, connected word recognition system based on hidden Markov models and level building , 1985, IEEE Trans. Acoust. Speech Signal Process..

[3]  Henry S. Baird,et al.  Document image defect models , 1995 .

[4]  David Pairman,et al.  Optimality of reassignment rules in dynamic clustering , 1988, Pattern Recognit..

[5]  Chinmoy B. Bose,et al.  Connected and degraded text recognition using hidden Markov model , 1992, Proceedings., 11th IAPR International Conference on Pattern Recognition. Vol.II. Conference B: Pattern Recognition Methodology and Systems.