Hidden Markov models for character recognition

1992 ◽  
Vol 1 (4) ◽  
pp. 539-543 ◽  
Author(s):  
J.A. Vlontzos ◽  
S.Y. Kung
Keyword(s):  
Hidden Markov Models ◽  
Character Recognition ◽  
Markov Models ◽  
Hidden Markov

HIDDEN MARKOV MODELS IN TEXT RECOGNITION

1995 ◽  
Vol 09 (06) ◽  
pp. 925-958 ◽  
Author(s):  
J.C. ANIGBOGU ◽  
A. BELAÏD
Keyword(s):  
Hidden Markov Models ◽  
Character Recognition ◽  
Markov Models ◽  
Hidden Markov ◽  
Majority Vote ◽  
The Other ◽  
Distance Measures ◽  
Original Form ◽  
Verification Methods ◽  
Font Identification

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.

Sign in / Sign up

Export Citation Format

Share Document