Metrics for attributed graphs based on the maximal similarity common subgraph

International Journal of Pattern Recognition and Artificial Intelligence

Volumn 18, Issue 3, 2004, Pages 299-313

  Hidović, Džena ^a   Pelillo, Marcello ^b  

^a UNIVERSITY OF BIRMINGHAM   (United Kingdom)

^b CA' FOSCARI UNIVERSITY OF VENICE   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTER VISION; DISTANCE MEASUREMENT; GRAPH THEORY; MATHEMATICAL TRANSFORMATIONS; PERTURBATION TECHNIQUES; PROBLEM SOLVING; ROBUSTNESS (CONTROL SYSTEMS);

GRAPH MATCHING; SUBSTRUCTURE-BASED METHODS;

PATTERN MATCHING;

EID: 3142737184     PISSN: 02180014     EISSN: None     Source Type: Journal    
DOI: 10.1142/S0218001404003216     Document Type: Article

References (11)

1. D. Ballard and C. M. Brown, Computer Vision (Prentice-Hall, Englewood Cliffs, NJ, 1982).
2. I. M. Bomze, M. Budinich, P. M. Pardalos, and M. Pelillo, The maximum clique problem, Handbook of Combinatorial Optimization (Suppl. Vol. A), eds. D.-Z. Du and P. M. Pardalos (Kluwer, Boston, MA, 1999), pp. 1-74.
3. H. Bunke, Recent developments in graph matching, in Proc. 15th Int. Conf. Pattern Recognition, Vol. 2 (IEEE Computer Society Press, 2000), pp. 117-124.
4. H. Bunke and K. Shearer, A graph distance metric based on the maximal common subgraph, Patt. Recogn. Lett. 19 (1998) 255-259.
5. H. Bunke, Error correcting graph matching: on the influence of the underlying cost function, IEEE Trans. Patt. Anal Mach. Intell. 21 (1999) 917-922.
6. S. Dickinson, M. Pelillo and R. Zabih (eds.), Special section on graph algorithms in computer vision, IEEE Trans. Patt. Anal. Mach. Intell. 23 (2001) 1049-1052.
7. M. L. Fernandez and G. Valiente, A graph distance metric combining maximum common subgraph and minimum common supergraph, Patt. Recogn. Lett. 22 (2001) 753-758.
8. P. Klein, S. Tirthapura, D. Sharvit and B. Kimia, A tree-edit-distance algorithm for comparing simple, closed shapes, in Proc. 10th Ann. ACM-SIAM Symp. Discr. Algorithms (SODA) San Francisco, CA, 2000, pp. 696-704.
9. T.-L. Liu and D. Geiger, Approximate tree matching and shape similarity, in Proc. ICCV'99 - 7th Int. Conf. Computer Vision, 1999, Kerkyra, Greece, pp. 456-462.
10. M. Pelillo, K. Siddiqi and S. W. Zucker, Matching hierarchical structures using association graphs, IEEE Trans. Patt. Anal. Mach. Intell. 21 (1999) 1105-1120.
11. W. D. Wallis, P. Shoubridge, M. Kraetz and D. Ray, Graph distances using graph union, Patt. Recogn. Lett. 22 (2001) 701-704.