Mostrar el registro sencillo del ítem
A Heuristic Based on the Intrinsic Dimensionality for Reducing the Number of Cyclic DTW Comparisons in Shape Classification and Retrieval Using AESA
dc.contributor.author | Palazón González, Vicente | |
dc.contributor.author | Marzal Varó, Andrés | |
dc.date.accessioned | 2013-04-18T08:09:25Z | |
dc.date.available | 2013-04-18T08:09:25Z | |
dc.date.issued | 2012 | |
dc.identifier.citation | Palazón-González, Vicente; Andrés Mazal "A Heuristic Based on the Intrinsic Dimensionality for Reducing the Number of Cyclic DTW Comparisons in Shape Classification and Retrieval Using AESA". En: Structural, Syntactic, and Statistical Pattern Recognition– Joint IAPR International Workshop, SSPR & SPR 2012, Hiroshima, Japan, November 7-9, 2012, Proceedings / Gimel´farb, G. [et al.] (Eds.). Berlin : Springer, 2012. (Lecture Notes in Computer Science; 7626). ISBN 978-3-642-34165-6, pp. 548-556 | ca_CA |
dc.identifier.isbn | 978-3-642-34165-6 | |
dc.identifier.issn | 0302-9743 | |
dc.identifier.issn | 1611-3349 | |
dc.identifier.uri | http://hdl.handle.net/10234/61504 | |
dc.description.abstract | Cyclic Dynamic Time Warping (CDTW) is a good dissimilarity of shape descriptors of high dimensionality based on contours, but it is computationally expensive. For this reason, to perform recognition tasks, a method to reduce the number of comparisons and avoid an exhaustive search is convenient. The Approximate and Eliminate Search Algorithm (AESA) is a relevant indexing method because of its drastic reduction of comparisons, however, this algorithm requires a metric distance and that is not the case of CDTW. In this paper, we introduce a heuristic based on the intrinsic dimensionality that allows to use CDTW and AESA together in classification and retrieval tasks over these shape descriptors. Experimental results show that, for descriptors of high dimensionality, our proposal is optimal in practice and significantly outperforms an exhaustive search, which is the only alternative for them and CDTW in these tasks. | ca_CA |
dc.format.extent | 9 p. | ca_CA |
dc.format.mimetype | application/pdf | ca_CA |
dc.language.iso | eng | ca_CA |
dc.publisher | Springer Berlin Heidelberg | ca_CA |
dc.relation.isPartOfSeries | Lecture Notes in Computer Science;7626 | |
dc.rights.uri | http://rightsstatements.org/vocab/CNE/1.0/ | * |
dc.subject | Cyclic strings | ca_CA |
dc.subject | Cyclic sequences | ca_CA |
dc.subject | Cyclic dynamic time warping | ca_CA |
dc.subject | Shape classification | ca_CA |
dc.subject | Shape retrieval | ca_CA |
dc.subject | Intrinsic dimensionality | ca_CA |
dc.subject | Metric spaces | ca_CA |
dc.subject | AESA | ca_CA |
dc.title | A Heuristic Based on the Intrinsic Dimensionality for Reducing the Number of Cyclic DTW Comparisons in Shape Classification and Retrieval Using AESA | ca_CA |
dc.type | info:eu-repo/semantics/bookPart | ca_CA |
dc.rights.holder | © Springer, Part of Springer Science+Business Media | |
dc.identifier.doi | http://dx.doi.org/10.1007/978-3-642-34166-3_60 | |
dc.rights.accessRights | info:eu-repo/semantics/openAccess | ca_CA |
dc.relation.publisherVersion | http://link.springer.com/chapter/10.1007%2F978-3-642-34166-3_60# | ca_CA |
Ficheros en el ítem
Este ítem aparece en la(s) siguiente(s) colección(ones)
-
LSI_Capítols de llibres [17]
Capítols de llibres escrits per professors del Departament de Llenguatges i Sistemes Informàtics