Measuring resemblance of complex patterns

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1568, Issue , 1999, Pages 286-297

  Hagedoorn, Michiel ^a   Veltkamp, Remco ^a  

^a UTRECHT UNIVERSITY   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

PATTERN MATCHING;

AFFINE INVARIANT; COMPLEX PATTERN; DISCRETISATION; DISCRIMINATIVE POWER; FEATURE DETECTION; HAUSDORFF DISTANCE; SYMMETRIC DIFFERENCE; TRANSFORMATION GROUP;

GEOMETRY;

EID: 29144523692     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-49126-0_22     Document Type: Conference Paper

References (13)

1. O. Aichholzer, H. Alt, and G. Rote. Matching shapes with a reference point. In Int. J. of Computational Geometry and Applications, volume 7, pages 349-363, August 1997.
2. H. Alt, U. Fuchs, G. Rote, and G. Weber. Matching convex shapes with respect to the symmetric difference. In Algorithms ESA’96, Proc. 4th Annual European Symp. on Algorithms, Barcelona, Spain, September’96, pages 320-333. LNCS 1136, Springer, 1996.
3. H. Alt and M. Godeau. Computing the Frechet distance between two polygonal curves. Int. J. of Computational Geometry & Applications, pages 75-91, 1995.
4. L. P. Chew, M. T. Goodrich, D. P. Huttenlocher, K. Kedem, Jon M. Kleinberg, and Dina Kravets. Geometric pattern matching under Euclidean motion. In Fifth Canadian Conference on Computational Geometry, pages 151-156, 1993.
5. S. D. Cohen and L. J. Guibas.Partial matching of planar polylines under similarity transformations. In Eight Annual ACM-SIAM Symp. on Discrete Algorithms, pages 777-786, January 1997.
6. E.T. Copson. Metric spaces. Cambridge University Press, 1968.
7. M. Hagedoorn and R. C. Veltkamp. A general method for partial point set matching. In Jean-Daniel Boissonnat, editor, Proc. 13th Annual ACM Symp. Computational Geometry, pages 406-408. ACM Press, 1997.
8. M. Hagedoorn and R. C. Veltkamp. Reliable and efficient pattern matching using an affine invariant metric. Technical Report UU-CS-1997-33, Utrecht University, 1997. revision accepted for publication in IJCV.
9. M. Hagedoorn and R. C. Veltkamp. New visibility partitions with applications in affine pattern matching. Manuscript,1998.
10. D. P. Huttenlocher and K. Kedem. Computing the minimum Hausdorff distance for point sets under translation. In Proc. 6th Annual ACM Symp. Computational Geometry, pages 340-349, 1990.
11. D. P. Huttenlocher, K. Kedem, and M. Sharir. The upper envelope of Voronoi surfaces and its applications. Discrete and Computational Geometry, 9:267-291, 1993.
12. D. P. Huttenlocher and W. J. Rucklidge. A multi-resolution technique for comparing images using the Hausdorff distance. Technical Report 92-1321, Cornell University, 1992.
13. W. Rucklidge. Efficient Visual Recognition Using the Hausdorff Distance. Lecture Notes in Computer Science. Springer-Verlag, 1996.