Similarity measures for hierarchical representations of graphs with unique node labels

International Journal of Pattern Recognition and Artificial Intelligence

Volumn 18, Issue 3, 2004, Pages 425-442

  Dickinson, P J ^a   Kraetzl, M ^a   Bunke, H ^b   Neuhaus, M ^b   Dadej, A ^c  

^a DEFENCE SCIENCE AND TECHNOLOGY ORGANISATION   (Australia)

^b UNIVERSITY OF BERN   (Switzerland)

^c UNIVERSITY OF SOUTH AUSTRALIA   (Australia)

Author keywords

Computer network monitoring; Graph; Graph abstraction; Graph similarity

Indexed keywords

ALGORITHMS; COMPUTER NETWORKS; COMPUTER VISION; CONTENT BASED RETRIEVAL; GRAPH THEORY; HIERARCHICAL SYSTEMS;

COMPUTER NETWORK MONITORING; GRAPH ABSTRACTION; GRAPH SIMILARITY; SHAPE ANALYSIS;

PATTERN RECOGNITION;

EID: 3142693267     PISSN: 02180014     EISSN: None     Source Type: Journal    
DOI: 10.1142/S021800140400323X     Document Type: Article

References (30)

1. D. Ballard and C. Brown, Computer Vision (Prentice Hall, 1982).
2. S. Beretti, A. Del Bimbo and E. Vicario, Efficient matching and indexing of graph models in content-based retrieval, IEEE Trans. PAMI23 (2001) 1089-1106.
3. H. Bunke, On a relation between graph edit distance and maximum common subgraph, Patt. Recogn. Lett. 18 (1997) 689-694.
4. W. J. Christmas, J. Kittler and M. Petrou, Structural matching in computer vision using probabilistic relaxation, IEEE Trans. PAMI17 (1995) 749-764.
5. A. Cross, R. Wilson and E. Hancock, Inexact graph matching with genetic search, Patt. Recogn. 30 (1997) 953-970.
6. P. Dickinson, H. Bunke, A. Dadej and M. Kraetzl, Application of median graphs in detection of anomalous change in communication networks, in Proc. World Multiconference on Systemics, Cybernetics and Informatics, Vol. 5, 2001, Orlando, pp. 194-197.
7. P. Foggia, C. Sansone and M. Vento, A performance comparison of five algorithms for graph isomorphism, in Proc. 3rd IAPR-TC15 Workshop on Graph-Based Representations in Pattern Recognition, 2001, pp. 188-199.
8. L. Guigues, H. Le Men and J.-P. Coquerez, Graphs, cocoons and image segmentation, in Proc. 3rd IAPR TC15 Workshop on Graph-Based Representations in Pattern Recognition (Cuen Press, 2001), pp. 22-31.
9. S. Kosinov and T. Caelli, Inexact multisubgraph matching using graph eigenspace and clustering models, in Structural, Syntactic, and Statistical Pattern Recognition, eds. T. Caelli, A. Amin, R. Duin, M. Kamel and D. de Ridder, Lecture Notes in Computer Science, Vol. 2396 (Springer Verlag, 2002), pp. 133-142.
10. W. Kropatsch, M. Burge, S. Ben Jacoub and N. Sehmanoui, Dual graph contraction with LEDA, Computing 12(Suppl.) (1998) 101-110.
11. J. Larrosa and G. Valiente, Constraint satisfaction algorithms for graph pattern matching, Math. Struct. Comput. Sci. 12 (2002) 403-422.
12. S. W. Lee, J. H. Kim and P. Groen, Translation-, rotation- and scale invariant recognition of hand-drawn symbols in schematic diagrams, Int. J. Patt. Recogn. Artif. Intell. 4 (1990) 1-25.
13. J. Liang and D. Doerman, Logical labeling of document images using layout graph matching with adaptive learning, in Document Analysis Systems V, eds. D. Lopresti, J. Hu and R. Kashi, Lecture Notes in Computer Science, Vol. 2423 (Springer Verlag, 2002), pp. 224-235.
14. J. Llados, E. Marti and J. J. Villanueva, Symbol recognition by error-tolerant sub-graph matching between region adjacency graphs, IEEE Trans. PAMI23 (2001) 1137-1143.
15. B. Luo and E. Hancock, Structural graph matching using the EM algorithm and singular value decomposition, IEEE Trans. PAMI23 (2001) 1120-1136.
16. B. Luo, R. Wilson and E. Hancock, Spectral feature vectors for graph clustering, in Structural, Syntactic, and Statistical Pattern Recognition, eds. T. Caelli, A. Amin, R. Duin, M. Kamel and D. de Ridder, Lecture Notes in Computer Science, Vol. 2396 (Springer Verlag, 2002), pp. 83-93.
17. D. Macrini, A. Shokoufandeh, S. Dickinson, K. Siddiqi and S. Zucker, Spectral methods for view-based 3-D object recognition using silhouettes, in Structural, Syntactic, and Statistical Pattern Recognition, eds. T. Caelli, A. Amin, R. Duin, M. Kamel and D. de Ridder, Lecture Notes in Computer Science, Vol. 2396 (Springer Verlag, 2002), pp. 1-14.
18. J. McGregor, Backtrack search algorithms and the maximal common subgraph problem, Software-Practice and Experience 12 (1982) 23-34.
19. B. Messmer and H. Bunke, A new algorithm for error tolerant subgraph isomorphism, IEEE Trans. PAMI20 (1998) 493-505.
20. M. Pelillo, K. Siddiqi and S. Zucker, Matching hierarchical structures using association graphs, IEEE Trans. PAMI21 (1999) 1105-1120.
21. S. Rizzi, Genetic operators for hierarchical graph clustering, Patt. Recogn. Lett. 19 (1998) 1293-1300.
22. A. Sanfeliu and K. Fu, A distance measure between attributed relational graphs for pattern recognition, IEEE Trans. SMC13 (1983) 353-363.
23. A. Schenker, M. Last, H. Bunke and A. Kandel, Clustering of web documents using a graph model, in Web Document Analysis: Challenges and Opportunities, eds. A. Antonacopoulos and J. Hu (World Scientific, 2003), pp. 3-18.
24. K. Shearer, H. Bunke and S. Venkatesh, Video indexing and similarity retrieval by largest common subgraph detection using decision trees, Patt. Recogn. 34 (2001) 1075-1091.
25. J. Ullman, An algorithm for subgraph isomorphism, J. Assoc. Comput. Mach. 23 (1976) 31-42.
26. M. A. van Wyk and B. J. van Wyk, A RKHS interpolator-based graph matching algorithm, IEEE Trans. PAMI24 (2002) 988-995.
27. I. Wang, K-C. Fan and J.-T. Horng, Genetic-based search for error-correcting graph isomorphism, IEEE Trans. SMC27 (1997) 588-597.
28. R. C. Wilson and E. Hancock, Structural matching by discrete relaxation, IEEE Trans. PAMI19 (1997) 634-648.
29. E. K. Wong, Model matching in robot vision by subgraph isomorphism, Patt. Recogn. 25 (1992) 287-304.
30. C. T. Zahn, Graph-theoretical methods for detecting and describing gestalt structures, IEEE Trans. Comput. C20 (1971) 68-86.