Speeding Up Shape Classification by Means of a Cyclic Dynamic Time Warping Lower Bound
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.
KeywordsOptimal Path Near Neighbour Dynamic Time Warping Dissimilarity Measure Optimal Alignment
Unable to display preview. Download preview PDF.
- Keogh, E.J.: Exact indexing of dynamic time warping. In: VLDB, pp. 406–417 (2002)Google Scholar
- Latecki, J., Lakämper, R., Eckhardt, U.: Shape descriptors for non-rigid shapes with a single closed contour. In: Proc. of the IEEE Conf. on Computer Vision and Pattern Recognition, pp. 424–429 (2000)Google Scholar
- Mokhtarian, F., Kittler, J., Abbasi, S.: Shape queries using image databases, http://www.ee.surrey.ac.uk/Research/VSSP/imagedb/demo.html
- Sharvit, D., Chan, J., Tek, H., Kimia, B.B.: Symmetry-based Indexing of Image Databases. In: CBAIVL 1998, pp. 56–62 (1998)Google Scholar