Hidden Markov models combining discrete symbols and continuous attributes in handwriting recognition.
Prior arts in handwritten word recognition model either discrete features or continuous features, but not both. This paper combines discrete symbols and continuous attributes into structural handwriting features and model, them by transition-emitting and state-emitting hidden Markov models. The models are rigorously defined and experiments have proven their effectiveness.
Xue
Hanhong
H
Advance Clustering Technology Team, IBM, Poughkeepsie, NY 12601, USA. hanhong@us.ibm.com
Govindaraju
Venu
V
D000465:Algorithms; D001185:Artificial Intelligence; D004282:Documentation; D001330:Electronic Data Processing / Q000379:methods*; D006236:Handwriting; D007089:Image Enhancement / Q000379:methods; D007090:Image Interpretation, Computer-Assisted / Q000379:methods*; D016247:Information Storage and Retrieval / Q000379:methods*; D008390:Markov Chains; D015233:Models, Statistical; D010363:Pattern Recognition, Automated / Q000379:methods*; D011932:Reading; D015203:Reproducibility of Results; D012680:Sensitivity and Specificity