Speeding up shape classification by means of a cyclic dynamic time warping lower bound

Authors:
Vicente Palazón;Andrés Marzal
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
Venue:
IDEAL'06 Proceedings of the 7th international conference on Intelligent Data Engineering and Automated Learning
Year:
2006

Citing 8
Cited 0

On a cyclic string-to-string correction problem

Information Processing Letters
Polygonal shape recognition using string-matching techniques

Pattern Recognition
Shape Matching and Object Recognition Using Shape Contexts

IEEE Transactions on Pattern Analysis and Machine Intelligence
Symmetry-Based Indexing of Image Databases

CBAIVL '98 Proceedings of the IEEE Workshop on Content - Based Access of Image and Video Libraries
WARP: Accurate Retrieval of Shapes Using Phase of Fourier Descriptors and Time Warping Distance

IEEE Transactions on Pattern Analysis and Machine Intelligence
Exact indexing of dynamic time warping

VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
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
The MPEG-7 visual standard for content description-an overview

IEEE Transactions on Circuits and Systems for Video Technology

Quantified Score

Hi-index	0.00

Visualization

Abstract

Cyclic Dynamic Time Warping (CDTW) is a good measure of contour shapes dissimilarity, but it is computationally expensive. We introduce a lower bound for CDTW inspired in the Bunke and Bühler that leads to a significant speed up of contours classification in real tasks, as the experiments show.