Hidden Markov Model Based Word Recognition and Its Application to Legal Amount Reading on French Checks
- 30 June 1998
- journal article
- Published by Elsevier in Computer Vision and Image Understanding
- Vol. 70 (3) , 404-419
- https://doi.org/10.1006/cviu.1998.0685
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Recognition of handwritten words using stochastic modelsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- A hybrid radial basis function network/hidden Markov model handwritten word recognition systemPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- The A2iA Intercheque System: Courtesy Amount and Legal Amount Recognition for French ChecksInternational Journal of Pattern Recognition and Artificial Intelligence, 1997
- LeRec: A NN/HMM Hybrid for On-Line Handwriting RecognitionNeural Computation, 1995
- Connectionist Speech RecognitionPublished by Springer Nature ,1994
- Segmentation-recognition algorithm for zip code field recognitionMachine Vision and Applications, 1992
- An introduction to hidden Markov modelsIEEE ASSP Magazine, 1986
- An Introduction to the Application of the Theory of Probabilistic Functions of a Markov Process to Automatic Speech RecognitionBell System Technical Journal, 1983
- A Maximization Technique Occurring in the Statistical Analysis of Probabilistic Functions of Markov ChainsThe Annals of Mathematical Statistics, 1970
- An inequality with applications to statistical estimation for probabilistic functions of Markov processes and to a model for ecologyBulletin of the American Mathematical Society, 1967