Fast best-match shape searching in rotation invariant metric spaces

3Citations
Citations of this article
18Readers
Mendeley users who have this article in their library.

Abstract

Object recognition and content-based image retrieval systems rely heavily on the accurate and efficient identification of shapes. A fundamental requirement in the shape analysis process is that shape similarities should be computed invariantly to basic geometric transformations, e.g. scaling, shifting, and most importantly, rotations. And while scale and shift invariance are easily achievable through a suitable shape representation, rotation invariance is much harder to deal with. In this work we explore the metric properties of the rotation invariant distance measures and propose an algorithm for fast similarity search in the shape space. The algorithm can be utilized in a number of important data mining tasks such as shape clustering and classification, or for discovering of motifs and discords in image collections. The technique is demonstrated to introduce a dramatic speed-up over the current approaches, and is guaranteed to introduce no false dismissals.

Cite

CITATION STYLE

APA

Yankov, D., Keogh, E., Wei, L., Xi, X., & Hodges, W. (2007). Fast best-match shape searching in rotation invariant metric spaces. In Proceedings of the 7th SIAM International Conference on Data Mining (pp. 611–616). Society for Industrial and Applied Mathematics Publications. https://doi.org/10.1137/1.9781611972771.70

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free