A Maximum Likelihood Approach to Continuous Speech Recognition
IEEE Transactions on Pattern Analysis and Machine Intelligence
Multilingual machine printed OCR
Hidden Markov models
Offline recognition of omnifont Arabic text using the HMM ToolKit (HTK)
Pattern Recognition Letters
Recognising cursive Arabic text using a speech recognition system
ICAI'06 Proceedings of the 7th WSEAS International Conference on Automation & Information
HMM-based system for recognizing words in historical Arabic manuscript
International Journal of Robotics and Automation
SACH'06 Proceedings of the 2006 conference on Arabic and Chinese handwriting recognition
Mono-font cursive arabic text recognition using speech recognition system
SSPR'06/SPR'06 Proceedings of the 2006 joint IAPR international conference on Structural, Syntactic, and Statistical Pattern Recognition
| Hi-index | 0.01 |
This paper proposes a recognition system of constrained Handwritten Hangul (Korean character) and alphanumeric characters using discrete hidden Markov models (HMMs). The HMM process encodes the distortion and similarity among patterns of a class through a doubly stochastic approach. Characterizing the statistical properties of characters using selected features, a recognition system can be implemented by absorbing possible variations in the form. Hangul shapes are classified into six types by fuzzy according to their effectiveness in each class. The constrained alphanumerics recognition is also performed using the same features employed in Hangul recogndition. The forward-backward, Viterbi and Baum-Welch reestimation algorithms are used for training and recognition of handwritten Hangul and alphanumeric characters. The simulation result shows that the proposed method recognizes effectively handwritten Korean charaters and alphanumerics