Binary Pattern Recognition Using Markov Random Fields and HMMs - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 1997

Binary Pattern Recognition Using Markov Random Fields and HMMs

George Saon
  • Function : Author
  • PersonId : 757082
  • IdRef : 16037636X
Abdel Belaïd
  • Function : Author
  • PersonId : 830137

Abstract

We present a stochastic framework for the recognition of binary random patterns which advantageously combine HMMs and Markov random fields (MRFs). The HMM component of the model analyzes the image along one direction, in a specific state observation probability given by the product of causal MRF-like pixel conditional probabilities. Aspects concerning definition, training and recognition via this type of model are developed throughout the paper. Experiments were performed on handwritten digits and words in a small lexicon. For the latter, we report a 89.68% average word recognition rate on the SRTP French postal cheque database (7057 words, 1779 scriptors)
No file

Dates and versions

inria-00537357 , version 1 (18-11-2010)

Identifiers

Cite

George Saon, Abdel Belaïd. Binary Pattern Recognition Using Markov Random Fields and HMMs. IEEE International Conference on Acoustics, Speech, and Signal Processing - ICASSP 1997, Apr 1997, Munich, Germany. pp.3725 - 3728, ⟨10.1109/ICASSP.1997.604678⟩. ⟨inria-00537357⟩
83 View
0 Download

Altmetric

Share

Gmail Facebook X LinkedIn More