{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,11,19]],"date-time":"2024-11-19T16:03:16Z","timestamp":1732032196470},"reference-count":41,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2006,11,30]],"date-time":"2006-11-30T00:00:00Z","timestamp":1164844800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Math Imaging Vis"],"published-print":{"date-parts":[[2007,4]]},"DOI":"10.1007\/s10851-006-0647-0","type":"journal-article","created":{"date-parts":[[2006,12,1]],"date-time":"2006-12-01T06:33:16Z","timestamp":1164954796000},"page":"203-216","source":"Crossref","is-referenced-by-count":117,"title":["Curve Matching, Time Warping, and Light Fields: New Algorithms for Computing Similarity between Curves"],"prefix":"10.1007","volume":"27","author":[{"given":"Alon","family":"Efrat","sequence":"first","affiliation":[]},{"given":"Quanfu","family":"Fan","sequence":"additional","affiliation":[]},{"given":"Suresh","family":"Venkatasubramanian","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2006,11,30]]},"reference":[{"key":"647_CR1","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1007\/PL00009500","volume":"23","author":"P.K. Agarwal","year":"2000","unstructured":"P.K. Agarwal and K. Varadarajan, \u201cEfficient algorithms for approximating polygonal chains,\u201d Discrete Comput. Geom., Vol. 23, pp. 273\u2013291, 2000.","journal-title":"Discrete Comput. Geom."},{"key":"647_CR2","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1007\/BF01530830","volume":"13","author":"H. Alt","year":"1995","unstructured":"H. Alt, B. Behrends, and J. Bl\u00f6mer, \u201cApproximate matching of polygonal shapes,\u201d Ann. Math. Artif. Intell., Vol. 13, pp. 251\u2013266, 1995.","journal-title":"Ann. Math. Artif. Intell."},{"key":"647_CR3","doi-asserted-by":"crossref","unstructured":"K. Buchin, M. Buchin, and C. Wenk, \u201cComputing the Fr\u00e9chet Distance Between Simple Polygons in Polynomial Time,\u201d in Proc. 22th ACM Symp. on Computational Geometry (SoCG), 2006, pp. 80\u201388.","DOI":"10.1145\/1137856.1137870"},{"key":"647_CR4","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1142\/S0218195995000064","volume":"5","author":"H. Alt","year":"1995","unstructured":"H. Alt and M. Godau, \u201cComputing the Fr\u00e9chet distance between two polygonal curves,\u201d International J. Computational Geometry and Applications, Vol. 5, pp. 75\u201391, 1995.","journal-title":"International J. Computational Geometry and Applications"},{"key":"647_CR5","doi-asserted-by":"crossref","unstructured":"H. Alt, C. Knauer, and C. Wenk, \u201cMatching polygonal curves with respect to the Fr\u00e9chet distance,\u201d in Symp. on Theoretical Aspects of Computer Science (STACS), 2001, pp. 63\u201374.","DOI":"10.1007\/3-540-44693-1_6"},{"key":"647_CR6","doi-asserted-by":"crossref","first-page":"262","DOI":"10.1016\/S0196-6774(03)00085-3","volume":"49","author":"H. Alt","year":"2003","unstructured":"H. Alt, A. Efrat, G. Rote, and C. Wenk, \u201cMatching planar maps,\u201d J. Alg., Vol. 49, pp. 262\u2013283, 2003.","journal-title":"J. Alg."},{"key":"647_CR7","doi-asserted-by":"crossref","unstructured":"L. Aleksandrov, M. Lanthier, A. Maheshwari, and J.-R. Sack, \u201cApproximation algorithms for geometric shortest path problems,\u201d in 32nd ACM Symposium on Theory of Computing, 2000.","DOI":"10.1145\/335305.335339"},{"key":"647_CR8","unstructured":"J. Ambj\u00f8rn, M. Carfora, and A. Marzuoli, The Geometry of Dynamical Triangulations, volume m50 of Lecture Notes in Physics, Springer-Verlag, 1997."},{"issue":"3","key":"647_CR9","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1109\/34.75509","volume":"13","author":"E.M. Arkin","year":"1991","unstructured":"E.M. Arkin, L.P. Chew, D.P. Huttenlocher, K. Kedem, and Joseph S.B. Mitchell, \u201cAn efficiently computable metric for comparing polygonal shapes,\u201d IEEE Trans. Pattern Anal. Mach. Intell., Vol. 13, No. 3, pp. 209\u2013216, 1991.","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"647_CR10","unstructured":"P. Baxandall and H. Liebeck, Vector Calculus, Oxford University Press, 1986."},{"key":"647_CR11","doi-asserted-by":"crossref","unstructured":"U. Brechtken-Manderschied, Introduction to the Calculus of Variations, Chapman and Hall, 1991.","DOI":"10.1007\/978-1-4899-3172-6"},{"key":"647_CR12","unstructured":"M. Born and E. Wolf, Principles of Optics: Electromagnetic Theory of Propagation, Interference and Diffraction of Light, 6th edition. Cambridge University Press, 1980."},{"key":"647_CR13","unstructured":"S. Brakatsoulas, D. Pfoser, R. Salas, and C. Wenk, \u201cOn Map-Matching Vehicle Tracking Data,\u201d in Very Large Data Bases (VLDB), 2005, pp. 853\u2013864."},{"key":"647_CR14","unstructured":"M. Clausen and A. Mosig, \u201cApproximately Matching Polygonal Curves with Respect to the Frechet Distance,\u201d in Computational Geometry: Theory and Applications. (Special Issue on the 19th Europ. Workshop on Comp. Geom) to appear."},{"key":"647_CR15","unstructured":"S.D. Cohen and L. Guibas, \u201cPartial matching of planar polylines under similarity transformations,\u201d in Proc. 8th ACM-SIAM Sympos. Discrete Algorithms, 1997, pp. 777\u2013786."},{"key":"647_CR16","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1142\/S0218195996000095","volume":"6","author":"J. Chen","year":"1996","unstructured":"J. Chen and Y. Han, \u201cShortest paths on a polyhedron,\u201d Internat. J. Comput. Geom. Appl., Vol. 6, pp. 127\u2013144, 1996.","journal-title":"Internat. J. Comput. Geom. Appl."},{"key":"647_CR17","doi-asserted-by":"crossref","unstructured":"K.K.W. Chu and M.H. Wong, \u201cFast time-series searching with scaling and shifting,\u201d in Symposium on Principles of Database Systems, 1999, pp. 237\u2013248.","DOI":"10.1145\/303976.304000"},{"key":"647_CR18","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/BF01386390","volume":"1","author":"E.W. Dijkstra","year":"1959","unstructured":"E.W. Dijkstra, \u201cA note on two problems in connection with graphs,\u201d Numerische Mathematic, Vol. 1, pp. 269\u2013271, 1959.","journal-title":"Numerische Mathematic"},{"issue":"2","key":"647_CR19","doi-asserted-by":"crossref","first-page":"112","DOI":"10.3138\/FM57-6770-U75U-7727","volume":"10","author":"D.H. Douglas","year":"1973","unstructured":"D.H. Douglas and T.K. Peucker, \u201cAlgorithms for the reduction of the number of points required to represent a digitized line or its caricature,\u201d Canadian Cartographer, Vol. 10 No. 2, pp. 112\u2013122, 1973.","journal-title":"Canadian Cartographer"},{"key":"647_CR20","unstructured":"A. Efrat, P. Indyk, and S. Venkatasubramanian, \u201cPattern matching with sets of segments,\u201d in Proc. 12th ACM-SIAM Symposium on Discrete Algorithms (SODA), 2001, pp. 295\u2013304."},{"key":"647_CR21","doi-asserted-by":"crossref","unstructured":"Xianping Ge and Padhraic Smyth, \u201cDeformable markov model templates for time-series pattern matching,\u201d in Sixth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD), 2000, pp. 81\u201390.","DOI":"10.1145\/347090.347109"},{"key":"647_CR22","doi-asserted-by":"crossref","unstructured":"S. Kapoor, \u201cEfficient computation of geodesic shortest paths,\u201d in 31st ACM Symposium on the Theory of Computing (STOC),1999, pp. 770\u2013779.","DOI":"10.1145\/301250.301449"},{"key":"647_CR23","unstructured":"B. Kaneva and J. O\u2019Rourke, \u201cAn implementation of chen and han\u2019s shortest paths algorithm,\u201d in Proc. 12th Canad. Conf. Comput. Geom. (CCCG), 2000, pp. 139\u2013146."},{"key":"647_CR24","doi-asserted-by":"crossref","unstructured":"E. Keogh and M. Pazzani, \u201cScaling up dynamic time warping to massive datasets,\u201d in Proc. 3rd European Conference on Principles and Practice of Knowledge Discovery in Databases (KDD), 1999, pp. 1\u201311.","DOI":"10.1007\/978-3-540-48247-5_1"},{"key":"647_CR25","doi-asserted-by":"crossref","unstructured":"E. Keogh, S. Chu, D. Hart, and M. Pazzani, \u201cAn Online Algorithm for Segmenting Time Series,\u201d in IEEE International Conference on Data. Mining (ICDM), 2001, pp. 289\u2013296.","DOI":"10.1109\/ICDM.2001.989531"},{"key":"647_CR26","doi-asserted-by":"crossref","first-page":"8431","DOI":"10.1073\/pnas.95.15.8431","volume":"95","author":"R. Kimmel","year":"1998","unstructured":"R. Kimmel and J. Sethian, \u201cFast marching methods on triangulated domains,\u201d in Proc. National Academy of Sciences, 1998, Vol. 95, pp. 8431\u20138435.","journal-title":"Proc. National Academy of Sciences"},{"key":"647_CR27","doi-asserted-by":"crossref","unstructured":"M. Lanthier, A. Maheshwari, and J. Sack, \u201cApproximating weighted shortest paths on polyhedral surfaces,\u201d in Proc. 13th ACM Symp. on Computational Geometry (SoCG), 1997, pp. 274\u2013283.","DOI":"10.1145\/262839.262984"},{"key":"647_CR28","doi-asserted-by":"crossref","first-page":"647","DOI":"10.1137\/0216045","volume":"16","author":"Joseph S.B. Mitchell","year":"1987","unstructured":"Joseph S.B. Mitchell, D.M. Mount, and C.H. Papadimitriou, \u201cThe discrete geodesic problem,\u201d SIAM J. Comput., Vol. 16, pp. 647\u2013668, 1987.","journal-title":"SIAM J. Comput."},{"key":"647_CR29","doi-asserted-by":"crossref","unstructured":"M. Munich and P. Perona, \u201cContinuous dynamic time warping for translation-invariant curve alignment with applications to signature verification,\u201d in International Conference on Computer Vision (ICCV), 1999, pp. 108\u2013115.","DOI":"10.1109\/ICCV.1999.791205"},{"issue":"2","key":"647_CR30","doi-asserted-by":"crossref","first-page":"200","DOI":"10.1109\/TPAMI.2003.1177152","volume":"25","author":"M.E. Munich","year":"2003","unstructured":"M.E. Munich and P. Perona, \u201cVisual identification by signature tracking,\u201d IEEE Transactions PAMI, Vol. 25, No. 2, pp. 200\u2013217, 2003.","journal-title":"IEEE Transactions PAMI"},{"key":"647_CR31","unstructured":"Mario Munich, Signature data. http:\/\/www.vision.caltech.edu\/mariomu\/research\/data\/sign Dist1.0.tgz."},{"key":"647_CR32","doi-asserted-by":"crossref","unstructured":"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.","DOI":"10.1007\/3-540-44565-X_3"},{"key":"647_CR33","doi-asserted-by":"crossref","unstructured":"S. Park, S.W. Kim, and W.W. Chu, \u201cSegment-based approach for subsequence searches in sequence databases,\u201d in Proc. of the Sixteenth acm Symposium on Applied Computing, 2001, pp. 248\u2013252.","DOI":"10.1145\/372202.372334"},{"key":"647_CR34","unstructured":"L.R. Rabiner and B.H. Huang, Fundamentals of Speech Recognition Prentice Hall, 1993."},{"key":"647_CR35","unstructured":"C.A. Ratanamahatana and E. Keogh, \u201cEverything you know about Dynamic Time Warping is Wrong,\u201d 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\u201325."},{"key":"647_CR36","unstructured":"T.M. Rath and R. Manmatha, \u201cLower-Bounding of Dynamic Time Warping Distances for Multivariate Time Series,\u201d Technical Report MM-40, Center for Intelligent Information Retrieval, University of Massachusetts, Amherst, 2002."},{"key":"647_CR37","doi-asserted-by":"crossref","unstructured":"T.M. Rath and R. Manmatha, \u201cWord Image Matching Using Dynamic Time Warping,\u201d in Proc. of the Conf. on Computer Vision and Pattern Recognition (CVPR), 2003, pp. 521\u2013527.","DOI":"10.1109\/CVPR.2003.1211511"},{"key":"647_CR38","doi-asserted-by":"crossref","unstructured":"J. Sethian, Level Set Methods and Fast Marching Methods. 2nd edition, Cambridge University Press, 1999.","DOI":"10.1137\/S0036144598347059"},{"key":"647_CR39","doi-asserted-by":"crossref","unstructured":"B. Serra and M. Berthod, \u201cSubpixel contour matching using continuous dynamic programming,\u201d in IEEE Conference on Computer Vision and Pattern Recognition (CVPR), 1994, pp. 202\u2013207.","DOI":"10.1109\/CVPR.1994.323830"},{"key":"647_CR40","unstructured":"S. Venkatasubramanian, Geometric Shape Matching and Drug Design, PhD thesis, Department of Computer Science, Stanford University, August 1999."},{"key":"647_CR41","doi-asserted-by":"crossref","unstructured":"T. Wu, T. Hastie, S. Schmidler, and D. Brutlag, \u201cRegression analysis of multiple protein structures,\u201d in 2nd Annual Conference on Research in Computational Biology, 1998, pp. 585\u2013595.","DOI":"10.1145\/279069.279132"}],"container-title":["Journal of Mathematical Imaging and Vision"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10851-006-0647-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10851-006-0647-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10851-006-0647-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T22:31:06Z","timestamp":1559255466000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10851-006-0647-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,11,30]]},"references-count":41,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2007,4]]}},"alternative-id":["647"],"URL":"https:\/\/doi.org\/10.1007\/s10851-006-0647-0","relation":{},"ISSN":["0924-9907","1573-7683"],"issn-type":[{"value":"0924-9907","type":"print"},{"value":"1573-7683","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,11,30]]}}}
