Script recognition using hidden Markov models
- 23 March 2005
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 11, 2071-2074
- https://doi.org/10.1109/icassp.1986.1168951
Abstract
A handwritten script recognition system is presented which uses Hidden Markov Models (HMM), a technique widely used in speech recognition. The script is encoded as templates in the form of a sequence of quantised inclination angles of short equal length vectors together with some additional features. A HMM is created for each written word from a set of training data. Incoming templates are recognised by calculating which model has the highest probability for producing that template. The task chosen to test the system is that of handwritten word recognition, where the words are digits written by one person. Results are given which show that HMMs provide a versatile pattern matching tool suitable for some image processing tasks as well as speech processing problems.Keywords
This publication has 4 references indexed in Scilit:
- An Introduction to the Application of the Theory of Probabilistic Functions of a Markov Process to Automatic Speech RecognitionBell System Technical Journal, 1983
- On-line recognition of hand-written characters utilizing positional and stroke vector sequencesPattern Recognition, 1981
- The DRAGON system--An overviewIEEE Transactions on Acoustics, Speech, and Signal Processing, 1975
- A Maximization Technique Occurring in the Statistical Analysis of Probabilistic Functions of Markov ChainsThe Annals of Mathematical Statistics, 1970