Hidden Markov Models in Text Recognition (1995)
| Venue: | International Journal of Pattern Recognition and Artificial Intelligence |
| Citations: | 5 - 0 self |
BibTeX
@ARTICLE{Anigbogu95hiddenmarkov,
author = {J.C. Anigbogu and A. Belaïd},
title = {Hidden Markov Models in Text Recognition},
journal = {International Journal of Pattern Recognition and Artificial Intelligence},
year = {1995},
volume = {9},
pages = {95--8}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
A multi-level multifont character recognition is presented. The system proceeds by first delimiting the context of the characters. As a way or 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 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 bett...
