On hidden Markov models and cyclic strings for shape recognition
Visualitza/
Impacte
Scholar |
Altres documents de l'autoria: Palazón González, Vicente; Marzal Varó, Andrés; Vilar Torres, Juan Miguel
Metadades
Mostra el registre complet de l'elementcomunitat-uji-handle:10234/9
comunitat-uji-handle2:10234/43662
comunitat-uji-handle3:10234/43643
comunitat-uji-handle4:
INVESTIGACIONMetadades
Títol
On hidden Markov models and cyclic strings for shape recognitionData de publicació
2014Editor
ElsevierISSN
0031-3203Tipus de document
info:eu-repo/semantics/articleVersió de l'editorial
http://www.sciencedirect.com/science/article/pii/S0031320314000363?np=yVersió
info:eu-repo/semantics/submittedVersionParaules clau / Matèries
Resum
Shape descriptions and the corresponding matching techniques must be robust to noise and
invariant to transformations for their use in recognition tasks. Most transformations are relatively
easy to handle when ... [+]
Shape descriptions and the corresponding matching techniques must be robust to noise and
invariant to transformations for their use in recognition tasks. Most transformations are relatively
easy to handle when contours are represented by strings. However, starting point invariance is
difficult to achieve. One interesting possibility is the use of cyclic strings, which are strings that
have no starting and final points. We propose new methodologies to use Hidden Markov Models
to classify contours represented by cyclic strings. Experimental results show that our proposals
outperform other methods in the literature. [-]
Publicat a
Pattern Recognition Volume 47, Issue 7, July 2014, Pages 2490–2504Drets d'accés
0031-3203 & 2014 Elsevier Ltd. All rights reserved.
http://rightsstatements.org/vocab/InC/1.0/
info:eu-repo/semantics/openAccess
http://rightsstatements.org/vocab/InC/1.0/
info:eu-repo/semantics/openAccess
Apareix a les col.leccions
- INIT_Articles [743]