An image similarity measure based on graph matching

Proceedings - 7th International Symposium on String Processing and Information Retrieval, SPIRE 2000

Volumn , Issue , 2000, Pages 28-38

  Baeza Yates, R ^a   Valiente, G ^b  

^a UNIVERSITY OF CHILE   (Chile)

^b UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

ECONOMIC AND SOCIAL EFFECTS; IMAGE RECOGNITION; IMAGE SEGMENTATION; INFORMATION RETRIEVAL;

DISTANCE MEASURE; GRAPH MATCHINGS; IMAGE SIMILARITY; PIXEL SIMILARITIES; REGION ADJACENCY GRAPHS; RELATIVE SIZES; TIME COMPLEXITY; TRADE OFF;

PIXELS;

EID: 84964493058     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SPIRE.2000.878177     Document Type: Conference Paper

References (21)

1. J.-I. Aoe, editor. Computer Algorithms: String Pattern Matching Strategies. IEEE Computer Science Press, 1994.
2. M. Atallah. A linear time algorithm for the Hausdorff distance between convex polygons. Inform. Process. Lett., 17:207-209, 1983.
3. C. R. Brice and C. L. Fennema. Image analysis using regions. Artif. Intell., 1(3-4):205-226, 1970.
4. H. Bunke. Structural and syntactic pattern recognition. In C. H. Chen, L. F. Pau, and P. S. P. Wang, editors, Handbook of Pattern Recognition and Computer Vision, chapter 1.5, pages 163-209. World Scientific, 1993.
5. E. Chávez, G. Navarro, R. Baeza-Yates, and J. L. Marroquín. A survey of algorithms for searching in metric spaces. Technical Report TR/DCC-99-3, Department of Computer Science, University of Chile, 1999.
6. V. di Gesù and V. Starovoitov. Distance-based functions for image comparison. Pattern Recogn. Lett., 20(2):207-214, 1999.
7. Y. El-Sonbaty and M. A. Ismail. A new algorithm for subgraph optimal isomorphism. Pattern Recogn., 31(2):205-218, 1998.
8. D. P. Huttenlocher, G. A. Klanderman, and W. J. Rucklidge. Comparing images using the Hausdorff distance. IEEE T. Pattern Anal. and Machine Intelligence, 15(9):850-863, 1993.
9. D. P. Huttenlocher, W. J. Rucklidge, and G. A. Klanderman. Comparing images using the Hausdorff distance under translation. In Proc. IEEE Conf. Computer Vision and Pattern Recognition, pages 654-656, 1992.
10. D. E. Knuth. The Stanford GraphBase: A Platform for Combinatorial Computing. ACM Press, 1993.
11. E. Kubicka, G. Kubicki, and I. Vakalis. Using graph distance in object recognition. In Proc. 18th ACM Annual Computer Science Conf., pages 43-48. ACM, 1990.
12. S. Z. Li. Matching: Invariant to translations, rotations and scale changes. Pattern Recogn., 25(6):583-594, 1992.
13. K. Mehlhorn and S. Näher. The LEDA Platform of Combinatorial and Geometric Computing. Cambridge University Press, 1999.
14. T. Nishizeki and N. Chiba. Planar Graphs: Theory and Algorithms, volume 140 of North-Holland Mathematical Studies. North-Holland, 1988.
15. A. Rosenfeld. Adjacency in digital pictures. Inform. Contr., 26:24-33, 1974.
16. A. Rosenfeld and J. L. Pfaltz. Distance functions on digital pictures. Pattern Recogn., 1:33-61, 1968.
17. R. Shonwilker. An image algorithm for computing the Hausdorff distance efficiently in linear time. Inform. Process. Lett., 30:87-89, 1989.
18. p point distance. Inform. Process. Lett., 38:201-207, 1991.
19. R. E. Tarjan. Depth-first search and linear graph algorithms. SIAM J. Comput., 1:146-160, 1972.
20. R. E. Tarjan. Data Structures and Network Algorithms. SIAM, 1983.
21. J. T. L. Wang, K. Zhang, and G.-W. Chirn. Algorithms for approximate graph matching. Information Sciences, 82:45-74, 1995.