Analytic word recognition without segmentation based on Markov random fields - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2000

Analytic word recognition without segmentation based on Markov random fields

Christophe Choisy
  • Function : Author
  • PersonId : 836386
Abdel Belaïd
  • Function : Author

Abstract

In this paper, a method for analytic handwritten word recognition based on causal Markov random fields is described. The words models are hmms where each state corresponds to a letter; each letter is modelled by a nshp-hmm (Markov field). Global models are build dynamically, and used for recognition and learning with the baum-welch algorithm. Learning of letter and word models is made using the parameters reestimated on the generated global models. No segmentation is necessary: the system determines itself the best limits between the letters during learning. First experiments on a real base of french check amount words give encouraging results of 83.4% for recognition.
Fichier principal
Vignette du fichier
A00-R-185.pdf (62.44 Ko) Télécharger le fichier
Loading...

Dates and versions

inria-00099041 , version 1 (26-09-2006)

Identifiers

  • HAL Id : inria-00099041 , version 1

Cite

Christophe Choisy, Abdel Belaïd. Analytic word recognition without segmentation based on Markov random fields. 7th International Workshop on Frontiers in Handwriting Recognition - IWFHR'2000, 2000, Amsterdam, Hollande. ⟨inria-00099041⟩
85 View
25 Download

Share

Gmail Facebook Twitter LinkedIn More