Curve Matching, Time Warping, and Light Fields: New Algorithms for Computing Similarity between Curves
暂无分享,去创建一个
Suresh Venkatasubramanian | Quanfu Fan | Alon Efrat | Suresh Venkatasubramanian | A. Efrat | Quanfu Fan
[1] J. A. Sethian,et al. Fast Marching Methods , 1999, SIAM Rev..
[2] J. Ambjorn,et al. The geometry of dynamical triangulations , 1996, hep-th/9612069.
[3] Dieter Pfoser,et al. On Map-Matching Vehicle Tracking Data , 2005, VLDB.
[4] Helmut Alt,et al. Approximate matching of polygonal shapes , 1995, SCG '91.
[5] Piotr Indyk,et al. Pattern Matching for Sets of Segments , 2000, SODA '01.
[6] R. Manmatha,et al. Word image matching using dynamic time warping , 2003, 2003 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 2003. Proceedings..
[7] Esther M. Arkin,et al. An efficiently computable metric for comparing polygonal shapes , 1991, SODA '90.
[8] Pietro Perona,et al. Visual Identification by Signature Tracking , 2003, IEEE Trans. Pattern Anal. Mach. Intell..
[9] Eamonn J. Keogh,et al. An online algorithm for segmenting time series , 2001, Proceedings 2001 IEEE International Conference on Data Mining.
[10] Edsger W. Dijkstra,et al. A note on two problems in connexion with graphs , 1959, Numerische Mathematik.
[11] Trevor J. Hastie,et al. Regression analysis of multiple protein structures , 1998, RECOMB '98.
[12] Michael Clausen,et al. Approximately matching polygonal curves with respect to the Fre'chet distance , 2005, Comput. Geom..
[13] Yijie Han,et al. Shortest paths on a polyhedron , 1990, SCG '90.
[14] Helmut Alt,et al. Computing the Fréchet distance between two polygonal curves , 1995, Int. J. Comput. Geom. Appl..
[15] Man Hon Wong,et al. Fast time-series searching with scaling and shifting , 1999, PODS '99.
[16] R. Manmatha,et al. Lower-Bounding of Dynamic Time Warping Distances for Multivariate Time Series , 2003 .
[17] Yijie Han,et al. Shortest paths on a polyhedron , 1996, Int. J. Comput. Geom. Appl..
[18] Kevin Buchin,et al. Computing the Fréchet distance between simple polygons , 2008, Comput. Geom..
[19] Joseph O'Rourke,et al. An Implementation of Chen & Han's Shortest Paths Algorithm , 2000, Canadian Conference on Computational Geometry.
[20] Jörg-Rüdiger Sack,et al. Approximating weighted shortest paths on polyhedral surfaces , 1997, SCG '97.
[21] Rajeev Motwani,et al. Geometric shape matching and drug design , 1999 .
[22] Eamonn J. Keogh,et al. Scaling up Dynamic Time Warping to Massive Dataset , 1999, PKDD.
[23] Eamonn J. Keogh,et al. Everything you know about Dynamic Time Warping is Wrong , 2004 .
[24] Leonidas J. Guibas,et al. Partial matching of planar polylines under similarity transformations , 1997, SODA '97.
[25] Helmut Alt,et al. Matching Polygonal Curves with Respect to the Fréchet Distance , 2001, STACS.
[26] E. Wolf,et al. Principles of Optics Electromagnetic Theory of Propagation, Interference and Diffraction of Light 2nd edition , 1964 .
[27] Biing-Hwang Juang,et al. Fundamentals of speech recognition , 1993, Prentice Hall signal processing series.
[28] Marc Berthod,et al. Subpixel contour matching using continuous dynamic programming , 1994, 1994 Proceedings of IEEE Conference on Computer Vision and Pattern Recognition.
[29] David H. Douglas,et al. ALGORITHMS FOR THE REDUCTION OF THE NUMBER OF POINTS REQUIRED TO REPRESENT A DIGITIZED LINE OR ITS CARICATURE , 1973 .
[30] James A. Sethian,et al. Level Set Methods and Fast Marching Methods , 1999 .
[31] Paul R. Cohen,et al. Using Dynamic Time Warping to Bootstrap HMM-Based Clustering of Time Series , 2001, Sequence Learning.
[32] Padhraic Smyth,et al. Deformable Markov model templates for time-series pattern matching , 2000, KDD '00.
[33] Wesley W. Chu,et al. Segment-based approach for subsequence searches in sequence databases , 2001, Comput. Syst. Sci. Eng..
[34] J. March. Introduction to the Calculus of Variations , 1999 .
[35] Pankaj K. Agarwal,et al. Efficient Algorithms for Approximating Polygonal Chains , 2000, Discret. Comput. Geom..
[36] Sanjiv Kapoor,et al. Efficient computation of geodesic shortest paths , 1999, STOC '99.
[37] Pietro Perona,et al. Continuous dynamic time warping for translation-invariant curve alignment with applications to signature verification , 1999, Proceedings of the Seventh IEEE International Conference on Computer Vision.
[38] Kevin Buchin,et al. Computing the Fréchet distance between simple polygons in polynomial time , 2006, SCG '06.
[39] Jörg-Rüdiger Sack,et al. Approximation algorithms for geometric shortest path problems , 2000, STOC '00.
[40] Joseph S. B. Mitchell,et al. The Discrete Geodesic Problem , 1987, SIAM J. Comput..
[41] Günter Rote,et al. Matching planar maps , 2003, SODA '03.
[42] Hans Sagan,et al. Introduction to the Calculus of Variations. , 1969 .
[43] J A Sethian,et al. Computing geodesic paths on manifolds. , 1998, Proceedings of the National Academy of Sciences of the United States of America.