Approximately matching polygonal curves with respect to the Fréchet distance

Computational Geometry: Theory and Applications

Volumn 30, Issue 2 SPEC. ISS., 2005, Pages 113-127

  Mosig, Axel ^a   Clausen, Michael ^b  

^a UNIVERSITY OF LEIPZIG   (Germany)

^b UNIVERSITY OF BONN   (Germany)

Author keywords

Geometric pattern matching; Group theory; Time warping

Indexed keywords

LINEAR TRANSFORMATIONS; MATHEMATICAL TRANSFORMATIONS; OBJECT RECOGNITION; PATTERN MATCHING;

AFFINE TRANSFORMATIONS; APPROXIMATE ALGORITHMS; DISTANCE MEASURE; GEOMETRIC PATTERN MATCHING; LINEAR ALGEBRAIC GROUPS; TIME COMPLEXITY; TIME WARPING; TRANSFORMATION GROUP;

GROUP THEORY;

EID: 10044279113     PISSN: 09257721     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.comgeo.2004.05.004     Document Type: Conference Paper

References (15)

1. H. Alt, O. Aichholzer, and G. Rote Matching shapes with a reference point Internat. J. Comput. Geom. Appl. 7 1997 349 363
2. H. Alt, and M. Godau Computing the Fréchet distance between two polygonal curves Internat. J. Comput. Geom. Appl. 5 1995 75 91
3. H. Alt, and L.J. Guibas Discrete geometric shapes: Matching, interpolation, and approximation J.-R. Sack, J. Urrutia, Handbook of Computational Geometry 2000 Elsevier Amsterdam 121 153
4. H. Alt, C. Knauer, and C. Wenk Matching polygonal curves with respect to the Fréchet distance Proc. 18th Internat. Symp. on Theoretical Aspects of Computer Science 2001 63 74
5. C. Ambühl, S. Chakraborty, and B. Gärtner Computing largest common point sets under approximate congruence Proc. Europ. Symp. Alg. 2000
6. S. Basu, R. Pollack, and M.-F. Roy On the number of cells defined by a family of polynomials on a variety Mathematika 43 1996 120 126
7. S. Basu, R. Pollack, and M.-F. Roy On computing a set of points meeting every semi-algebraically connected component of a family of polynomials on a variety J. Complexity 13 1 1997 28 37
8. M. Clausen, and F. Kurth Content-based information retrieval by group theoretical methods Proceedings of the NATO Advanced Study Institute on Computational Noncommutative Algebra and Applications 2003 Kluwer Academic Dordrecht
9. M. Clausen, F. Kurth, A unified approach to content-based and fault tolerant music recognition, IEEE Transactions on Multimedia, submitted for publication
10. A. Efrat, P. Indyk, and S. Venkatasubramanian Pattern matching with sets of segments Proc. 12th ACM Symp. on Discrete Algorithms 2001
11. J. Humphreys Linear Algebraic Groups 1975 Springer New York
12. A. Mosig, Efficient algorithms for shape and pattern matching, PhD Thesis, Institut für Informatik III, Universität Bonn, 2004
13. M. Munich, and P. Perona Continuous dynamic time warping for translation-invariant curve alignment with applications to signature verification IEEE International Conference on Computer Vision, vol. 1, Corfu, Greece 1999 108
14. L. Rabiner, and B. Juang Fundamentals of Speech Recognition 1993 Prentice Hall Englewood Cliffs, NJ
15. C. Wenk, Shape matching in higher dimensions, PhD Thesis, Freie Universität Berlin, 2003