Skip to main content

Speeding Up Shape Classification by Means of a Cyclic Dynamic Time Warping Lower Bound

  • Conference paper
Intelligent Data Engineering and Automated Learning – IDEAL 2006 (IDEAL 2006)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 4224))

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  • Bartolini, I., Ciaccia, P., Patella, M.: WARP: Accurate Retrieval of Shapes Using Phase of Fourier Descriptors and Time Warping Distance. IEEE Transactions on Pattern Analysis and Machine Intelligence 27(1), 142–147 (2005)

    Article  Google Scholar 

  • Serge, B., Jitendra, M., Jan, P., Belongie, S., Malik, J., Puzicha, J.: Shape matching and object recognition using shape contexts. IEEE Trans. Pattern Anal. Mach. Intell. 24(4), 509–522 (2002)

    Article  Google Scholar 

  • Bünke, H., Bühler, H.: Applications of approximate string matching to 2D shape recognition. Pattern Recognition 26(12), 1797–1812 (1993)

    Article  Google Scholar 

  • 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 

  • Maes, M.: Polygonal Shape Recognition using String Matching Techniques. Pattern Recognition 24(5), 433–440 (1991)

    Article  Google Scholar 

  • Maes, M.: On a Cyclic String-to-String Correction Problem. Information Processing Letters 35, 73–78 (1990)

    Article  MATH  MathSciNet  Google Scholar 

  • Marzal, A., Palazón, V.: Dynamic time warping of cyclic strings for shape matching. In: Singh, S., Singh, M., Apte, C., Perner, P. (eds.) ICAPR 2005. LNCS, vol. 3687, pp. 644–652. Springer, Heidelberg (2005)

    Chapter  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 

  • Sikora, T.: The mpeg-7 visual standard for content description – an overview. IEEE Transactions on Circuits and Systems for Video Technology 11(6), 696–702 (2001)

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Palazón, V., Marzal, A. (2006). Speeding Up Shape Classification by Means of a Cyclic Dynamic Time Warping Lower Bound. In: Corchado, E., Yin, H., Botti, V., Fyfe, C. (eds) Intelligent Data Engineering and Automated Learning – IDEAL 2006. IDEAL 2006. Lecture Notes in Computer Science, vol 4224. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11875581_53

Download citation

  • DOI: https://doi.org/10.1007/11875581_53

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-45485-4

  • Online ISBN: 978-3-540-45487-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics