In classification tasks, shape descriptions, combined with matching techniques, must be robust to noise and invariant to transformations. Most of these distortions are relatively easy to handle, particularly if we represent contours by sequences. However, starting point invariance seems to be difficult to achieve. The concept of cyclic sequence, a sequence that has no initial/final point, can be of great help. We propose a new methodology to use HMMs to classify contours represented by cyclic sequences. Experimental results show that our proposal significantly outperforms other methods in the literature. © Springer-Verlag Berlin Heidelberg 2007.
CITATION STYLE
Palazón, V., Marzal, A., & Vilar, J. M. (2007). Cyclic linear hidden Markov models for shape classification. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4872 LNCS, pp. 152–165). Springer Verlag. https://doi.org/10.1007/978-3-540-77129-6_17
Mendeley helps you to discover research relevant for your work.