On a cyclic string-to-string correction problem
Information Processing Letters
Fast Cyclic Edit Distance Computation with Weighted Edit Costs in Classification
ICPR '02 Proceedings of the 16 th International Conference on Pattern Recognition (ICPR'02) Volume 4 - Volume 4
A Shape Descriptor Based on Circular Hidden Markov Model
ICPR '00 Proceedings of the International Conference on Pattern Recognition - Volume 1
| Hi-index | 0.00 |
Hidden Markov Models (HMM) have been successfully applied to describe sequences of observable events. In some problems, objects are more appropriately described as cyclic sequences, i.e., sequences with no begin/end point. Conventional HMMs with Viterbi score cannot deal adequately with cyclic sequences. We propose a cyclic Viterbi score that can be efficiently computed for Linear HMMs. Linear HMMs model sequences that can be partitioned into contiguous segments where each state is responsible for emitting all symbols in one of the segments. Experiments show that our proposal outperforms other approaches in an isolated characters handwritten-text recognition task.