Characterization of contour regularities based on the Levenshtein edit distance
Por favor, use este identificador para citar o enlazar este ítem:
http://hdl.handle.net/10045/20235
Registro completo de metadatos
Campo DC | Valor | Idioma |
---|---|---|
dc.contributor | Reconocimiento de Formas e Inteligencia Artificial | en |
dc.contributor.author | Abreu Salas, José Ignacio | - |
dc.contributor.author | Rico-Juan, Juan Ramón | - |
dc.contributor.other | Universidad de Alicante. Departamento de Lenguajes y Sistemas Informáticos | en |
dc.date.accessioned | 2012-01-09T09:18:15Z | - |
dc.date.available | 2012-01-09T09:18:15Z | - |
dc.date.issued | 2011-03-30 | - |
dc.identifier.citation | ABREU, J.; RICO-JUAN, J.R. “Characterization of contour regularities based on the Levenshtein edit distance”. Pattern Recognition Letters. Vol. 32, No. 10 (15 July 2011). ISSN 0167-8655, pp. 1421-1427 | en |
dc.identifier.issn | 0167-8655 (Print) | - |
dc.identifier.issn | 1872-7344 (Online) | - |
dc.identifier.uri | http://hdl.handle.net/10045/20235 | - |
dc.description.abstract | This paper describes a new method for quantifying the regularity of contours and comparing them (when encoded by Freeman chain codes) in terms of a similarity criterion which relies on information gathered from Levenshtein edit distance computation. The criterion used allows subsequences to be found from the minimal cost edit sequence that specifies an alignment of contour segments which are similar. Two external parameters adjust the similarity criterion. The information about each similar part is encoded by strings that represent an average contour region. An explanation of how to construct a prototype based on the identified regularities is also reviewed. The reliability of the prototypes is evaluated by replacing contour groups (samples) by new prototypes used as the training set in a classification task. This way, the size of the data set can be reduced without sensibly affecting its representational power for classification purposes. Experimental results show that this scheme achieves a reduction in the size of the training data set of about 80% while the classification error only increases by 0.45% in one of the three data sets studied. | en |
dc.description.sponsorship | This work is partially supported by the Spanish CICYT under project DPI2006-15542-C04-01, the Spanish MICINN through project TIN2009-14205-CO4-01, the Spanish research program Consolider Ingenio 2010: MIPRCV (CSD2007-00018) and by the PASCAL Network of Excellence. | en |
dc.language | eng | en |
dc.publisher | Elsevier | en |
dc.subject | Contour regularities | en |
dc.subject | Shape prototypes | en |
dc.subject | Edit distance | en |
dc.subject.other | Lenguajes y Sistemas Informáticos | en |
dc.title | Characterization of contour regularities based on the Levenshtein edit distance | en |
dc.type | info:eu-repo/semantics/article | en |
dc.peerreviewed | si | en |
dc.identifier.doi | 10.1016/j.patrec.2011.03.021 | - |
dc.relation.publisherversion | http://dx.doi.org/10.1016/j.patrec.2011.03.021 | en |
dc.rights.accessRights | info:eu-repo/semantics/restrictedAccess | en |
dc.relation.projectID | info:eu-repo/grantAgreement/EC/FP7/216886 | en |
Aparece en las colecciones: | INV - GRFIA - Artículos de Revistas Investigaciones financiadas por la UE |
Archivos en este ítem:
Archivo | Descripción | Tamaño | Formato | |
---|---|---|---|---|
2009_J_IbPRIA.pdf | Versión revisada (acceso abierto) | 159,62 kB | Adobe PDF | Abrir Vista previa |
2009_J_IbPRIA_final.pdf | Versión final (acceso restringido) | 523,37 kB | Adobe PDF | Abrir Solicitar una copia |
Todos los documentos en RUA están protegidos por derechos de autor. Algunos derechos reservados.