The application of evaluation method based on HMM for results validity of complex simulation system
WSC '05 Proceedings of the 37th conference on Winter simulation
Hindi handwritten word recognition using HMM and symbol tree
Proceeding of the workshop on Document Analysis and Recognition
| Hi-index | 0.00 |
A fast Discrete HMM algorithm is proposed for on-line hand written character recognition. After preprocessing input stroke are discretized so that a discrete HMM is used. This particular discretization naturally leads to a simple procedure for assigning initial state and state transition probabilities. In the training phase, complete marginalization with respect to state is not performed. A criterion based on normalized maximum likelihood ratio is given for deciding when to create a new model for the same character in the learning phase, in order to cope with stroke order variations and large shape variations. Experiments are done on the Kuchibue database from TUAT. The algorithm appears to be very robust against stroke number variations and have reasonable robustness against stroke order variations and large shape variations. A drawback of the proposed algorithm is its memory requirement when the number of character classes and their associated models becomes large.