Abstract.
In this paper a method for analytic handwritten word recognition based on causal Markov random fields is described. The word models are hmms where each state corresponds to a letter modeled by a nshp-hmm (Markov field). The word models are built dynamically. Training is operated using Baum-Welch algorithm where the parameters are reestimated on the generated word models. The segmentation is unnecessary: the system determines itself during training the best repartition of the information within the letter models. First experiments on two real databases of French check amount words give very encouraging results up to 86% for recognition without rejection.
Similar content being viewed by others
Author information
Authors and Affiliations
Additional information
Received: March 31, 2000 / Accepted: January 9, 2002
Rights and permissions
About this article
Cite this article
Choisy, C., Belaïd, A. Cross-learning in analytic word recognition without segmentation. IJDAR 4, 281–289 (2002). https://doi.org/10.1007/s100320200078
Issue Date:
DOI: https://doi.org/10.1007/s100320200078