Contour-Based shape retrieval using dynamic time warping

Authors:
Andrés Marzal;Vicente Palazón;Guillermo Peris
Affiliations:
Dept. Llenguatges i Sistemes Informàtics, Universitat Jaume I de Castelló, Spain;Dept. Llenguatges i Sistemes Informàtics, Universitat Jaume I de Castelló, Spain;Dept. Llenguatges i Sistemes Informàtics, Universitat Jaume I de Castelló, Spain
Venue:
CAEPIA'05 Proceedings of the 11th Spanish association conference on Current Topics in Artificial Intelligence
Year:
2005

Citing 8
Cited 1

On a cyclic string-to-string correction problem

Information Processing Letters
Polygonal shape recognition using string-matching techniques

Pattern Recognition
The String-to-String Correction Problem

Journal of the ACM (JACM)
On Aligning Curves

IEEE Transactions on Pattern Analysis and Machine Intelligence
Efficient Techniques for a Very Accurate Measurement of Dissimilarities between Cyclic Patterns

Proceedings of the Joint IAPR International Workshops on Advances in Pattern Recognition
Content-Based Image Retrieval Using Fourier Descriptors on a Logo Database

ICPR '02 Proceedings of the 16 th International Conference on Pattern Recognition (ICPR'02) Volume 3 - Volume 3
Fast Cyclic Edit Distance Computation with Weighted Edit Costs in Classification

ICPR '02 Proceedings of the 16 th International Conference on Pattern Recognition (ICPR'02) Volume 4 - Volume 4
WARP: Accurate Retrieval of Shapes Using Phase of Fourier Descriptors and Time Warping Distance

IEEE Transactions on Pattern Analysis and Machine Intelligence

Faster retrieval with a two-pass dynamic-time-warping lower bound

Pattern Recognition

Quantified Score

Hi-index	0.00

Visualization

Abstract

A dissimilarity measure for shapes described by their contour, the Cyclic Dynamic Time Warping (CDTW) dissimilarity, is introduced. The dissimilarity measure is based on Dynamic Time Warping of cyclic strings, i.e., strings with no definite starting/ending points. The Cyclic Edit Distance algorithm by Maes cannot be directly extended to compute the CDTW dissimilarity, as we show in the paper. We present an algorithm that computes the CDTW dissimilarity in O(mnlogn) time, where m and n are the lengths of the cyclic strings. Shape retrieval with the new dissimilarity measure is experimentally compared with the WARP system on a standard corpus.