Shape similarity measures, properties and constructions

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

Volumn 1929, Issue , 2000, Pages 467-476

  Veltkamp, Remco C ^a   Hagedoorn, Michiel ^a  

^a UTRECHT UNIVERSITY   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

INFORMATION SYSTEMS;

KANTOROVICH METRIC; SHAPE SIMILARITY; SIMILARITY MEASURE;

IMAGE RETRIEVAL;

EID: 84959057867     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-40053-2_41     Document Type: Conference Paper

References (28)

1. H. Alt, B. Behrends, and J. Blömer. Approximate matching of polygonal shapes. Annals of Mathematics and Artificial Intelligence, pages 251-265, 1995.
2. H. Alt, U. Fuchs, G. Rote, and G. Weber. Matching convex shapes with respect to the symmetric difference. In Proc. ESA, pages 320-333. LNCS 1136, Springer, 1996.
3. H. Alt and M. Godeau. Computing the Fréchet distance between two polygonal curves. International Journal of Computational Geometry & Applications, pages 75-91, 1995.
4. E. Arkin, P. Chew, D. Huttenlocher, K. Kedem, and J. Mitchel. An eÆciently computable metric for comparing polygonal shapes. IEEE Transactions on Pattern Anal-ysis and Machine Intelligence, 13(3):209-215, 1991.
5. Alta Vista Photo Finder, http://image.altavista.com/cgi-bin/avncgi.
6. A. J. Baddeley. An error metric for binary images. In Robust Computer Vision: Qual-ity of Vision Algorithms, Proc. of the Int. Workshop on Robust Computer Vision, Bonn, 1992, pages 59-78. Wichmann, 1992.
7. L. P. Chew, M. T. Goodrich, D. P. Huttenlocher, K. Kedem, J. M. Kleinberg, and D. Kravets. Geometric pattern matching under Euclidean motion. Computational Geometry, Theory and Applications, 7:113-124, 1997.
8. P. Chew and K. Kedem. Improvements on approximate pattern matching. In 3rd Scandinav. Workshop Algorithm Theory, LNCS 621, pages 318-325. Springer, 1992.
9. S. D. Cohen and L. J. Guibas. Partial matching of planar polylines under similarity transformations. In Proc. SODA, pages 777-786, 1997.
10. G. Cortelazzo, G. A. Mian, G. Vezzi, and P. Zamperoni. Trademark shapes descrip-tion by string-matching techniques. Pattern Recognition, 27:1005-1018, 1994.
11. A. Efrat and A. Itai. Improvements on bottleneck matching and related problems using geometry. Proc. SoCG, pages 301-310, 1996.
12. R. Fagin and L. Stockmeyer. Relaxing the triangle inequality in pattern matching. Int. Journal of Computer Vision, 28(3):219-231, 1998.
13. R. Fleischer, K. Mehlhorn, G. Rote, E. Welzl, and C. Yap. Simultaneous inner and outer approximation of shapes. Algorithmica, 8:365-389, 1992.
14. D. Fry. Shape Recognition using Metrics on the Space of Shapes. PhD thesis, Harvard University, Department of Mathematics, 1993.
15. M. Hagedoorn and R. C. Veltkamp. Metric pattern spaces. Technical Report UU-CS-1999-03, Utrecht University, 1999.
16. M. Hagedoorn and R. C. Veltkamp. Reliable and eÆcient pattern matching using an aÆne invariant metric. Int. Journal of Computer Vision, 31(2/3):203-225, 1999.
17. D. P. Huttenlocher, K. Kedem, and J. M. Kleinberg. On dynamic Voronoi diagrams and the minimum Hausdorff distance for point sets under Euclidean motion in the plane. In Proc. SoCG, pages 110-120, 1992.
18. D. P. Huttenlocher, K. Kedem, and M. Sharir. The upper envelope of Voronoi surfaces and its applications. Discrete and Comp. Geometry, 9:267-291, 1993.
19. D. P. Huttenlocher, G. A. Klanderman, and W. J. Rucklidge. Comparing images using the Hausdorff distance. IEEE Transactions on Pattern Analysis and Machinen Intelligence, 15:850-863, 1993.
20. Plato. Meno. Perseus Encyclopedia, Tuft University, http://www.perseus.tufts.edu/Texts/chunk_TOC.grk.html#Plato, 380 B.C.
21. QBIC project, http://wwwqbic.almaden.ibm.com/.
22. S. Rachev. The Monge-Kantorovich mass transference problem and its stochastical applications. Theory of Probability and Applications, 29:647-676, 1985.
23. Y. Rubner, C. Tomassi, and L Guibas. A metric for distributions with applications to image databases. In Proc. of the IEEE Int. Conf. on Comp. Vision, Bombay, India, pages 59-66, 1998.
24. W. Rucklidge. EÆcient Visual Recognition Using the Hausdorff Distance. LNCS. Springer, 1996.
25. S. Schirra. Approximate decision algorithms for approximate congruence. Informa-tion Processing Letters, 43:29-34, 1992.
26. L. Schomaker, E. de Leau, and L. Vuurpijl. Using pen-based outlines for object-based annotation and image-based queries. In Visual Information and Information Systems, LNCS 1614, pages 585-592. Springer, 1999.
27. A. Tversky. Features of similarity. Psychological Review, 84(4):327-352, 1977.
28. J. Vleugels and R. C. Veltkamp. EÆcient image retrieval through vantage objects. In Visual Information and Information Systems, LNCS 1614, pages 575-584. Springer, 1999.