Journal of Mathematical Imaging and Vision

, Volume 27, Issue 3, pp 203–216 | Cite as

Curve Matching, Time Warping, and Light Fields: New Algorithms for Computing Similarity between Curves

  • Alon Efrat
  • Quanfu Fan
  • Suresh Venkatasubramanian


The problem of curve matching appears in many application domains, like time series analysis, shape matching, speech recognition, and signature verification, among others. Curve matching has been studied extensively by computational geometers, and many measures of similarity have been examined, among them being the Fréchet distance (sometimes referred in folklore as the “dog-man” distance).

A measure that is very closely related to the Fréchet distance but has never been studied in a geometric context is the Dynamic Time Warping measure (DTW), first used in the context of speech recognition. This measure is ubiquitous across different domains, a surprising fact because notions of similarity usually vary significantly depending on the application. However, this measure suffers from some drawbacks, most importantly the fact that it is defined between sequences of points rather than curves. Thus, the way in which a curve is sampled to yield such a sequence can dramatically affect the quality of the result. Some attempts have been made to generalize the DTW to continuous domains, but the resulting algorithms have exponential complexity.

In this paper we propose similarity measures that attempt to capture the “spirit” of dynamic time warping while being defined over continuous domains, and present efficient algorithms for computing them. Our formulation leads to a very interesting connection with finding short paths in a combinatorial manifold defined on the input chains, and in a deeper sense relates to the way light travels in a medium of variable refractivity.


curve matching light field curve compression signature verification 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    P.K. Agarwal and K. Varadarajan, “Efficient algorithms for approximating polygonal chains,” Discrete Comput. Geom., Vol. 23, pp. 273–291, 2000.zbMATHCrossRefMathSciNetGoogle Scholar
  2. 2.
    H. Alt, B. Behrends, and J. Blömer, “Approximate matching of polygonal shapes,” Ann. Math. Artif. Intell., Vol. 13, pp. 251–266, 1995.zbMATHCrossRefGoogle Scholar
  3. 3.
    K. Buchin, M. Buchin, and C. Wenk, “Computing the Fréchet Distance Between Simple Polygons in Polynomial Time,” in Proc. 22th ACM Symp. on Computational Geometry (SoCG), 2006, pp. 80–88.Google Scholar
  4. 4.
    H. Alt and M. Godau, “Computing the Fréchet distance between two polygonal curves,” International J. Computational Geometry and Applications, Vol. 5, pp. 75–91, 1995.zbMATHCrossRefMathSciNetGoogle Scholar
  5. 5.
    H. Alt, C. Knauer, and C. Wenk, “Matching polygonal curves with respect to the Fréchet distance,” in Symp. on Theoretical Aspects of Computer Science (STACS), 2001, pp. 63–74.Google Scholar
  6. 6.
    H. Alt, A. Efrat, G. Rote, and C. Wenk, “Matching planar maps,” J. Alg., Vol. 49, pp. 262–283, 2003.zbMATHMathSciNetGoogle Scholar
  7. 7.
    L. Aleksandrov, M. Lanthier, A. Maheshwari, and J.-R. Sack, “Approximation algorithms for geometric shortest path problems,” in 32nd ACM Symposium on Theory of Computing, 2000.Google Scholar
  8. 8.
    J. Ambjørn, M. Carfora, and A. Marzuoli, The Geometry of Dynamical Triangulations, volume m50 of Lecture Notes in Physics, Springer-Verlag, 1997.Google Scholar
  9. 9.
    E.M. Arkin, L.P. Chew, D.P. Huttenlocher, K. Kedem, and Joseph S.B. Mitchell, “An efficiently computable metric for comparing polygonal shapes,” IEEE Trans. Pattern Anal. Mach. Intell., Vol. 13, No. 3, pp. 209–216, 1991.CrossRefGoogle Scholar
  10. 10.
    P. Baxandall and H. Liebeck, Vector Calculus, Oxford University Press, 1986.Google Scholar
  11. 11.
    U. Brechtken-Manderschied, Introduction to the Calculus of Variations, Chapman and Hall, 1991.Google Scholar
  12. 12.
    M. Born and E. Wolf, Principles of Optics: Electromagnetic Theory of Propagation, Interference and Diffraction of Light, 6th edition. Cambridge University Press, 1980.Google Scholar
  13. 13.
    S. Brakatsoulas, D. Pfoser, R. Salas, and C. Wenk, “On Map-Matching Vehicle Tracking Data,” in Very Large Data Bases (VLDB), 2005, pp. 853–864.Google Scholar
  14. 14.
    M. Clausen and A. Mosig, “Approximately Matching Polygonal Curves with Respect to the Frechet Distance,” in Computational Geometry: Theory and Applications. (Special Issue on the 19th Europ. Workshop on Comp. Geom) to appear.Google Scholar
  15. 15.
    S.D. Cohen and L. Guibas, “Partial matching of planar polylines under similarity transformations,” in Proc. 8th ACM-SIAM Sympos. Discrete Algorithms, 1997, pp. 777–786.Google Scholar
  16. 16.
    J. Chen and Y. Han, “Shortest paths on a polyhedron,” Internat. J. Comput. Geom. Appl., Vol. 6, pp. 127–144, 1996.zbMATHCrossRefMathSciNetGoogle Scholar
  17. 17.
    K.K.W. Chu and M.H. Wong, “Fast time-series searching with scaling and shifting,” in Symposium on Principles of Database Systems, 1999, pp. 237–248.Google Scholar
  18. 18.
    E.W. Dijkstra, “A note on two problems in connection with graphs,” Numerische Mathematic, Vol. 1, pp. 269–271, 1959.zbMATHCrossRefMathSciNetGoogle Scholar
  19. 19.
    D.H. Douglas and T.K. Peucker, “Algorithms for the reduction of the number of points required to represent a digitized line or its caricature,” Canadian Cartographer, Vol. 10 No. 2, pp. 112–122, 1973.Google Scholar
  20. 20.
    A. Efrat, P. Indyk, and S. Venkatasubramanian, “Pattern matching with sets of segments,” in Proc. 12th ACM-SIAM Symposium on Discrete Algorithms (SODA), 2001, pp. 295–304.Google Scholar
  21. 21.
    Xianping Ge and Padhraic Smyth, “Deformable markov model templates for time-series pattern matching,” in Sixth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD), 2000, pp. 81–90.Google Scholar
  22. 22.
    S. Kapoor, “Efficient computation of geodesic shortest paths,” in 31st ACM Symposium on the Theory of Computing (STOC),1999, pp. 770–779.Google Scholar
  23. 23.
    B. Kaneva and J. O’Rourke, “An implementation of chen and han’s shortest paths algorithm,” in Proc. 12th Canad. Conf. Comput. Geom. (CCCG), 2000, pp. 139–146.Google Scholar
  24. 24.
    E. Keogh and M. Pazzani, “Scaling up dynamic time warping to massive datasets,” in Proc. 3rd European Conference on Principles and Practice of Knowledge Discovery in Databases (KDD), 1999, pp. 1–11.Google Scholar
  25. 25.
    E. Keogh, S. Chu, D. Hart, and M. Pazzani, “An Online Algorithm for Segmenting Time Series,” in IEEE International Conference on Data. Mining (ICDM), 2001, pp. 289–296.Google Scholar
  26. 26.
    R. Kimmel and J. Sethian, “Fast marching methods on triangulated domains,” in Proc. National Academy of Sciences, 1998, Vol. 95, pp. 8431–8435.zbMATHCrossRefMathSciNetGoogle Scholar
  27. 27.
    M. Lanthier, A. Maheshwari, and J. Sack, “Approximating weighted shortest paths on polyhedral surfaces,” in Proc. 13th ACM Symp. on Computational Geometry (SoCG), 1997, pp. 274–283.Google Scholar
  28. 28.
    Joseph S.B. Mitchell, D.M. Mount, and C.H. Papadimitriou, “The discrete geodesic problem,” SIAM J. Comput., Vol. 16, pp. 647–668, 1987.zbMATHCrossRefMathSciNetGoogle Scholar
  29. 29.
    M. Munich and P. Perona, “Continuous dynamic time warping for translation-invariant curve alignment with applications to signature verification,” in International Conference on Computer Vision (ICCV), 1999, pp. 108–115.Google Scholar
  30. 30.
    M.E. Munich and P. Perona, “Visual identification by signature tracking,” IEEE Transactions PAMI, Vol. 25, No. 2, pp. 200–217, 2003.Google Scholar
  31. 31.
    Mario Munich, Signature data. Dist1.0.tgz.Google Scholar
  32. 32.
    T. Oates, L. Firoiu, and P. Cohen, Using Dynamic Time Warping to Bootstrap HMM-Based Clustering of Time Series, chapter Sequence Learning: Paradigms, Algorithms and Applications. Springer-Verlag, 2000.Google Scholar
  33. 33.
    S. Park, S.W. Kim, and W.W. Chu, “Segment-based approach for subsequence searches in sequence databases,” in Proc. of the Sixteenth acm Symposium on Applied Computing, 2001, pp. 248–252.Google Scholar
  34. 34.
    L.R. Rabiner and B.H. Huang, Fundamentals of Speech Recognition Prentice Hall, 1993.Google Scholar
  35. 35.
    C.A. Ratanamahatana and E. Keogh, “Everything you know about Dynamic Time Warping is Wrong,” in Third Workshop on Mining Temporal and Sequential Data, in conjunction with the Tenth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD), 2004, pp. 22–25.Google Scholar
  36. 36.
    T.M. Rath and R. Manmatha, “Lower-Bounding of Dynamic Time Warping Distances for Multivariate Time Series,” Technical Report MM-40, Center for Intelligent Information Retrieval, University of Massachusetts, Amherst, 2002.Google Scholar
  37. 37.
    T.M. Rath and R. Manmatha, “Word Image Matching Using Dynamic Time Warping,” in Proc. of the Conf. on Computer Vision and Pattern Recognition (CVPR), 2003, pp. 521–527.Google Scholar
  38. 38.
    J. Sethian, Level Set Methods and Fast Marching Methods. 2nd edition, Cambridge University Press, 1999.Google Scholar
  39. 39.
    B. Serra and M. Berthod, “Subpixel contour matching using continuous dynamic programming,” in IEEE Conference on Computer Vision and Pattern Recognition (CVPR), 1994, pp. 202–207.Google Scholar
  40. 40.
    S. Venkatasubramanian, Geometric Shape Matching and Drug Design, PhD thesis, Department of Computer Science, Stanford University, August 1999.Google Scholar
  41. 41.
    T. Wu, T. Hastie, S. Schmidler, and D. Brutlag, “Regression analysis of multiple protein structures,” in 2nd Annual Conference on Research in Computational Biology, 1998, pp. 585–595.Google Scholar

Copyright information

© Springer Science + Business Media, LLC 2007

Authors and Affiliations

  • Alon Efrat
    • 1
  • Quanfu Fan
    • 1
  • Suresh Venkatasubramanian
    • 2
  1. 1.Department of Computer ScienceUniversity of ArizonaUSA
  2. 2.AT&T Labs – ResearchUSA

Personalised recommendations