An elastic partial shape matching technique

Authors:
Longin Jan Latecki;Vasileios Megalooikonomou;Qiang Wang;Deguang Yu
Affiliations:
Computer and Information Sciences Department, Temple University, 1805 North Broad Street, Philadelphia, PA 19122, USA;Computer and Information Sciences Department, Temple University, 1805 North Broad Street, Philadelphia, PA 19122, USA;Computer and Information Sciences Department, Temple University, 1805 North Broad Street, Philadelphia, PA 19122, USA;Computer and Information Sciences Department, Temple University, 1805 North Broad Street, Philadelphia, PA 19122, USA
Venue:
Pattern Recognition
Year:
2007

Citing 14
Cited 4

Shape Similarity Measure Based on Correspondence of Visual Parts

IEEE Transactions on Pattern Analysis and Machine Intelligence
Shape Matching and Object Recognition Using Shape Contexts

IEEE Transactions on Pattern Analysis and Machine Intelligence
Efficient Retrieval of Similar Time Sequences Under Time Warping

ICDE '98 Proceedings of the Fourteenth International Conference on Data Engineering
On Similarity-Based Queries for Time Series Data

ICDE '99 Proceedings of the 15th International Conference on Data Engineering
Discovering Similar Multidimensional Trajectories

ICDE '02 Proceedings of the 18th International Conference on Data Engineering
Curvature Scale Space Representation: Theory, Applications, and MPEG-7 Standardization

Curvature Scale Space Representation: Theory, Applications, and MPEG-7 Standardization
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
Probabilistic discovery of time series motifs

Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining
Towards parameter-free data mining

Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining
A Multiresolution Symbolic Representation of Time Series

ICDE '05 Proceedings of the 21st International Conference on Data Engineering
Part-based shape retrieval

Proceedings of the 13th annual ACM international conference on Multimedia
Partial Elastic Matching of Time Series

ICDM '05 Proceedings of the Fifth IEEE International Conference on Data Mining
Partial shape recognition by sub-matrix matching for partial matching guided image labeling

Pattern Recognition
Distance sets for shape filters and shape recognition

IEEE Transactions on Image Processing

Matching incomplete time series with dynamic time warping: an algorithm and an application to post-stroke rehabilitation

Artificial Intelligence in Medicine
Partial matching of garment panel shapes with dynamic sketching design

Proceedings of the 1st Augmented Human International Conference
Scale invariant and deformation tolerant partial shape matching

Image and Vision Computing
Pre-organizing Shape Instances for Landmark-Based Shape Correspondence

International Journal of Computer Vision

Quantified Score

Hi-index	0.01

Visualization

Abstract

We consider the problem of partial shape matching. We propose to transform shapes into sequences and utilize an algorithm that determines a subsequence of a target sequence that best matches a query. In the proposed algorithm we map the problem of the best matching subsequence to the problem of a cheapest path in a directed acyclic graph (DAG). The approach allows us to compute the optimal scale and translation of sequence values, which is a nontrivial problem in the case of subsequence matching. Our experimental results demonstrate that the proposed algorithm outperforms the commonly used techniques in retrieval accuracy.