SAXually Explicit Images: Finding Unusual Shapes
Authors:
- 1 December 2006
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE International Conference on Data Mining (ICDM)
- No. 15504786,p. 711-720
Abstract
Over the past three decades, there has been a great deal of research on shape analysis, focusing mostly on shape indexing, clustering, and classification. In this work, we introduce the new problem of finding shape discords, the most unusual shapes in a collection. We motivate the problem by considering the utility of shape discords in diverse domains including zoology, anthropology, and medicine. While the brute force search algorithm has quadratic time complexity, we avoid this by using locality-sensitive hashing to estimate similarity between shapes which enables us to reorder the search more efficiently. An extensive experimental evaluation demonstrates that our approach can speed up computation by three to four orders of magnitude.Keywords
This publication has 17 references indexed in Scilit:
- Rotation invariant indexing of shapes and line drawings2005
- Gapped Local Similarity Search with Provable Guarantees2004
- Review of shape representation and description techniquesPattern Recognition, 2004
- A review of symbolic analysis of experimental dataReview of Scientific Instruments, 2003
- A symbolic representation of time series, with implications for streaming algorithms2003
- Cladistics Is Useful for Reconstructing Archaeological Phylogenies: Palaeoindian Points from the Southeastern United StatesJournal of Archaeological Science, 2001
- Dimensionality Reduction for Fast Similarity Search in Large Time Series DatabasesKnowledge and Information Systems, 2001
- A survey of shape analysis techniquesPattern Recognition, 1998
- Using signature files for querying time-series data1997
- Anytime algorithm development toolsACM SIGART Bulletin, 1996