Hierarchical Chamfer Matching: A Parametric Edge Matching Algorithm
IEEE Transactions on Pattern Analysis and Machine Intelligence
ACM Transactions on Graphics (TOG)
Searching in metric spaces with user-defined and approximate distances
ACM Transactions on Database Systems (TODS)
IEEE Transactions on Pattern Analysis and Machine Intelligence
Leaf Image Retrieval with Shape Features
VISUAL '00 Proceedings of the 4th International Conference on Advances in Visual Information Systems
On the need for time series data mining benchmarks: a survey and empirical demonstration
Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining
Indexing multi-dimensional time-series with support for multiple distance measures
Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining
Efficient contour-based shape representation and matching
MIR '03 Proceedings of the 5th ACM SIGMM international workshop on Multimedia information retrieval
Face Recognition from Face Profile Using Dynamic Time Warping
ICPR '04 Proceedings of the Pattern Recognition, 17th International Conference on (ICPR'04) Volume 4 - Volume 04
WARP: Accurate Retrieval of Shapes Using Phase of Fourier Descriptors and Time Warping Distance
IEEE Transactions on Pattern Analysis and Machine Intelligence
Curves vs. skeletons in object recognition
Signal Processing - Special section on content-based image and video retrieval
Using the Inner-Distance for Classification of Articulated Shapes
CVPR '05 Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 2 - Volume 02
Shape Classifer Based on Generalized Probabilistic Descent Method with Hidden Markov Descriptor
ICCV '05 Proceedings of the Tenth IEEE International Conference on Computer Vision (ICCV'05) Volume 1 - Volume 01
Rotation invariant indexing of shapes and line drawings
Proceedings of the 14th ACM international conference on Information and knowledge management
Atomic Wedgie: Efficient Query Filtering for Streaming Times Series
ICDM '05 Proceedings of the Fifth IEEE International Conference on Data Mining
Exact indexing of dynamic time warping
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
Indexing large human-motion databases
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
Evaluation of similarity searching methods for music data in P2P networks
International Journal of Business Intelligence and Data Mining
Skyline Index for Time Series Data
IEEE Transactions on Knowledge and Data Engineering
Dynamic time warping of cyclic strings for shape matching
ICAPR'05 Proceedings of the Third international conference on Pattern Recognition and Image Analysis - Volume Part II
Automatic target recognition by matching oriented edge pixels
IEEE Transactions on Image Processing
A multiscale representation method for nonrigid shapes with a single closed contour
IEEE Transactions on Circuits and Systems for Video Technology
Scaling-invariant boundary image matching using time-series matching techniques
Data & Knowledge Engineering
Boundary-based lower-bound functions for dynamic time warping and their indexing
Information Sciences: an International Journal
An envelope-based approach to rotation-invariant boundary image matching
DaWaK'11 Proceedings of the 13th international conference on Data warehousing and knowledge discovery
Searching historical manuscripts for near-duplicate figures
Proceedings of the 2011 Workshop on Historical Document Imaging and Processing
Shape-based template matching for time series data
Knowledge-Based Systems
Similarity in (spatial, temporal and) spatio-temporal datasets
Proceedings of the 15th International Conference on Extending Database Technology
Searching and mining trillions of time series subsequences under dynamic time warping
Proceedings of the 18th ACM SIGKDD international conference on Knowledge discovery and data mining
On the dynamic time warping of cyclic sequences for shape retrieval
Image and Vision Computing
SSPR'12/SPR'12 Proceedings of the 2012 Joint IAPR international conference on Structural, Syntactic, and Statistical Pattern Recognition
Experimental comparison of representation methods and distance measures for time series data
Data Mining and Knowledge Discovery
Accelerating subsequence similarity search based on dynamic time warping distance with FPGA
Proceedings of the ACM/SIGDA international symposium on Field programmable gate arrays
The impact of motion dimensionality and bit cardinality on the design of 3D gesture recognizers
International Journal of Human-Computer Studies
ACM Transactions on Knowledge Discovery from Data (TKDD) - Special Issue on ACM SIGKDD 2012
Data mining a trillion time series subsequences under dynamic time warping
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Instruction set extensions for dynamic time warping
Proceedings of the Ninth IEEE/ACM/IFIP International Conference on Hardware/Software Codesign and System Synthesis
Discovering longest-lasting correlation in sequence databases
Proceedings of the VLDB Endowment
CID: an efficient complexity-invariant distance for time series
Data Mining and Knowledge Discovery
Hi-index | 0.00 |
Shape matching and indexing is important topic in its own right, and is a fundamental subroutine in most shape data mining algorithms. Given the ubiquity of shape, shape matching is an important problem with applications in domains as diverse as biometrics, industry, medicine, zoology and anthropology. The distance/similarity measure for used for shape matching must be invariant to many distortions, including scale, offset, noise, articulation, partial occlusion, etc. Most of these distortions are relatively easy to handle, either in the representation of the data or in the similarity measure used. However, rotation invariance is noted in the literature as being an especially difficult challenge. Current approaches typically try to achieve rotation invariance in the representation of the data, at the expense of discrimination ability, or in the distance measure, at the expense of efficiency. In this work, we show that we can take the slow but accurate approaches and dramatically speed them up. On real world problems our technique can take current approaches and make them four orders of magnitude faster without false dismissals. Moreover, our technique can be used with any of the dozens of existing shape representations and with all the most popular distance measures including Euclidean distance, dynamic time warping and Longest Common Subsequence. We further show that our indexing technique can be used to index star light curves, an important type of astronomical data, without modification.