Hidden Markov Models in Text Recognition

A multi-level multifont character recognition is presented. The system proceeds by first delimiting the context of the characters. As a way of enhancing system performance, typographical information is extracted and used for font identification before actual character recognition is performed. This has the advantage of sure character identification as well as text reproduction in its original form. The font identification is based on decision trees where the characters are automatically arranged differently in confusion classes according to the physical characteristics of fonts. The character recognizers are built around the first and second order hidden Markov models (HMM) as well as Euclidean distance measures. The HMMs use the Viterbi and the Extended Viterbi algorithms to which enhancements were made. Also present is a majority-vote system that polls the other systems for advice before deciding on the identity of a character. Among other things, this last system is shown to give better results than each of the other systems applied individually. The system finally uses combinations of stochastic and dictionary verification methods for word recognition and error-correction.

[1]  George Nagy,et al.  DOCUMENT ANALYSIS WITH AN EXPERT SYSTEM , 1986 .

[2]  David W. Capson.  An improved algorithm for the sequential extraction of boundaries from a raster scan , 1984, Comput. Vis. Graph. Image Process..

[3]  Sargur N. Srihari,et al.  An Integrated Algorithm for Text Recognition: Comparison with a Cascaded Algorithm , 1983, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[4]  Yang He,et al.  2-D Shape Classification Using Hidden Markov Model , 1991, IEEE Trans. Pattern Anal. Mach. Intell..

[5]  K. M. Kulkarni,et al.  A high accuracy algorithm for recognition of handwritten numerals , 1988, Pattern Recognit..

[6]  Paramvir Bahl,et al.  Recognition of handwritten word: first and second order hidden Markov model based approach , 1988, Proceedings CVPR '88: The Computer Society Conference on Computer Vision and Pattern Recognition.

[7]  Yang He,et al.  On optimal order in modeling sequence of letters in words of common language as a Markov chain , 1991, Pattern Recognit..

[8]  S. Impedovo,et al.  Optical Character Recognition - a Survey , 1991, Int. J. Pattern Recognit. Artif. Intell..

[9]  L. R. Rabiner,et al.  On the application of vector quantization and hidden Markov models to speaker-independent, isolated word recognition , 1983, The Bell System Technical Journal.

[10]  Richard Rubinstein,et al.  Digital typography - an introduction to type and composition for computer system design , 1988 .

[11]  C. Xydeas,et al.  Printed character recognition using Markov models , 1987 .

[12]  James K. Baker,et al.  Stochastic modeling for automatic speech understanding , 1990 .

[13]  Hsiao-Chuan Wang,et al.  A speech recognition method based on feature distributions , 1991, Pattern Recognit..

[14]  Godfried T. Toussaint,et al.  The Sensitivity of the Modified Viterbi Algorithm to the Source Statistics , 1980, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[15]  Frank K. Soong,et al.  High performance connected digit recognition, using hidden Markov models , 1988, ICASSP-88., International Conference on Acoustics, Speech, and Signal Processing.

[16]  Lawrence R. Rabiner,et al.  Mathematical foundations of hidden Markov models , 1988 .

[17]  David L. Neuhoff,et al.  The Viterbi algorithm as an aid in text recognition (Corresp.) , 1975, IEEE Trans. Inf. Theory.

[18]  A. Ardeshir Goshtasby,et al.  Description and Discrimination of Planar Shapes Using Shape Matrices , 1985, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[19]  Theodosios Pavlidis,et al.  On the Recognition of Printed Characters of Any Font and Size , 1987, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[20]  Yang He.  Extended Viterbi algorithm for second order hidden Markov process , 1988, [1988 Proceedings] 9th International Conference on Pattern Recognition.

[21]  RAOUF F. H. FARAG,et al.  Word-Level Recognition of Cursive Script , 1979, IEEE Transactions on Computers.

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

[23]  Henry S. Baird,et al.  Feature identification for hybrid structural/statistical pattern classification , 1988, Comput. Vis. Graph. Image Process..

[24]  R. Mahesh K. Sinha,et al.  On partitioning a dictionary for visual text recognition , 1990, Pattern Recognit..

[25]  A. Ardeshir Goshtasby,et al.  Contextual word recognition using probabilistic relaxation labeling , 1988, Pattern Recognit..

[26]  R. Mahesh K. Sinha,et al.  Visual text recognition through contextual processing , 1988, Pattern Recognit..

[27]  Seymour Shlien.  Multifont Character Recognition for Typeset Documents , 1988, Int. J. Pattern Recognit. Artif. Intell..