A heuristic based on the intrinsic dimensionality for reducing the number of cyclic DTW comparisons in shape classification and retrieval using AESA

  • Authors:
  • Vicente Palazón-González;Andrés Marzal

  • Affiliations:
  • Dept. Llenguatges i Sistemes Informàtics and Institute of New Imaging Technologies, Universitat Jaume I de Castelló, Spain;Dept. Llenguatges i Sistemes Informàtics and Institute of New Imaging Technologies, Universitat Jaume I de Castelló, Spain

  • Venue:
  • SSPR'12/SPR'12 Proceedings of the 2012 Joint IAPR international conference on Structural, Syntactic, and Statistical Pattern Recognition
  • Year:
  • 2012

Quantified Score

Hi-index 0.00

Visualization

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.