A graph matching method and a graph matching distance based on subgraph assignments

Pattern Recognition Letters

Volumn 31, Issue 5, 2010, Pages 394-406

  Raveaux, Romain ^a   Burie, Jean Christophe ^a   Ogier, Jean Marc ^a  

^a UNIVERSITY OF LA ROCHELLE   (France)

Author keywords

Bipartite graph matching; Graph based representation; Graph distance; Graph matching

Indexed keywords

ATTRIBUTED GRAPHS; BI-PARTITE GRAPH MATCHING; CONVENTIONAL METHODS; DATA SETS; DISTANCE-BASED; FEATURE VECTORS; GRAPH DISTANCES; GRAPH MATCHINGS; GRAPH-BASED; GRAPH-MATCHING METHODS; LOCAL INFORMATION; OBJECT REPRESENTATIONS; ROOT NODES; SPEED-UPS; STRUCTURAL FEATURE; SUBGRAPH MATCHING; SUBGRAPHS; TWO-GRAPHS;

GRAPH THEORY;

EID: 75149188132     PISSN: 01678655     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.patrec.2009.10.011     Document Type: Article

References (59)

1. Antoine Champin P., and Solnon C. Measuring the similarity of labeled graphs. Case-based Reason. Res. Dev. (2003) 80-95
2. Auwatanamongkol S. Inexact graph matching using a genetic algorithm for image recognition. Pattern Recognition Lett. 28 12 (2007) 1428-1437.
3. Bengoetxea E., Larrañaga P., Bloch I., Perchant A., and Boeres C. Inexact graph matching by means of estimation of distribution algorithms. Pattern Recognition 35 12 (2002) 2867-2880
4. Bonabeau E. Graph multidimensional scaling with self-organizing maps. Inform. Sci. 143 1-4 (2002) 159-180
5. Borgwardt K.M., and Kriegel H.-P. Shortest-path kernels on graphs. IEEE Internat. Conf. Data Mining (2005) 74-81.
6. Bunke H., and Messmer B.T. Recent advances in graph matching. Internat. J. Pattern Recognition Artif. Intell. (IJPRAI) 11 1 (1997) 169-203
7. Bunke H., and Shearer K. A graph distance metric based on the maximal common subgraph. Pattern Recognition Lett. 19 3-4 (1998) 255-259
8. Christmas M.W.J., and Kittler J. Structural matching in computer vision using probabilistic relaxation. IEEE Trans. Pattern Anal. Machine Intell. 17 8 (1995) 749-764
9. Ciaccia, P., Patella, M., Zezula, P., 1997. M-tree: An efficient access method for similarity search in metric spaces. In: Proc. 23rd Internat. Conf. on Very Large Data Bases (VLDB'97), pp. 426-435.
10. Conte D., Foggia P., Sansone C., and Vento M. Thirty years of graph matching in pattern recognition. Internat. J. Pattern Recognition Artif. Intell. 18 3 (2004) 265-298
11. Coughlan J.M., and Ferreira S.J. Finding deformable shapes using loopy belief propagation. Internat. Conf. Comput. Vision (-ECCV 2002) (2002) 453-468
12. Cox M.F., and Cox M.A.A. Multidimensional Scaling. Quantitative Applications in the Social Sciences (2001), Chapman and Hall
13. Cross A.D.J., and Hancock E.R. Inexact graph matching with genetic search. Adv. Struct. Syntact. Pattern Recognition (1996) 150-159
14. Cross A.D.J., and Hancock E.R. Graph matching with a dual-step em algorithm. IEEE Trans. Pattern Anal. Machine Intell. 20 11 (1998) 1236-1253.
15. Cross E.H.A.D.J., and Wilson R.C. Inexact graph matching using genetic search. Pattern Recognition 30 6 (1997) 953-970
16. Erd"os, P., Rényi, A., 1959. On Random Graphs, Publicationes Mathematicae Debrecen, vol. 6, pp. 290-297.
17. Ferrer M., Valveny E., and Serratosa F. Spectral median graphs applied to graphical symbol recognition. Progr. Pattern Recognition Image Anal. Appl. (2006) 774-783
18. Finch E.H.A.M., and Wilson R.C. Matching delaunay graphs. Pattern Recognition 30 1 (1997) 123-140
19. Ford G.P., and Zhang J. Structural graph-matching approach to image understanding. Intell. Robots Comput. Vision X: Algorithms Techniq. 1607 1 (1992) 559-569
20. Gold S., and Rangarajan A. A graduated assignment for graph matching. IEEE Trans. Pattern Anal. Machine Intell. 18 4 (1996) 377-388
21. Gold S., and Rangarajan A. Graph matching by graduated assignment. IEEE Trans. Pattern Anal. Machine Intell. (1996) 239-244
22. Gordon A.D. Classification. second ed. (1999), Chapman and Hall
23. Graph based knowledge discovery (subdue), SUBDUE, .
24. Hidovic D., and Pelillo M. Metrics for attributed graphs based on the maximal similarity common subgraph. Internat. J. Pattern Recognition Artif. Intell. 18 3 (2004) 299-313
25. Jiang, X., Münger, A., Bunke, H., 2000. Synthesis of representative graphical symbols by computing generalized median graph. In: Chhabra, A.K., Dori, D., (Eds.), Graphics Recognition: Recent Advances, pp. 183-192.
26. Kashima, H., Tsuboi, Y., 2004. Kernel-based discriminative learning algorithms for labeling sequences, trees, and graphs. In: Proc. 21st Internat. Conf. on Machine Learning.
27. Kaufman, L., Rousseeuw, P., 1990. Finding groups in data: An introduction to cluster analysis. Probability Mathematical Statistics, ISBN:10-0471878766.
28. Khotanzad A., and Hong Y.H. Invariant image recognition by zernike moments. IEEE Trans. Pattern Anal. Mach. Intell. 12 5 (1990) 489-497
29. Kuhn H.W. The Hungarian method for the assignment problem. Nav. Res. Logist. Quart. 2 (1955) 83-97
30. Kuner P., and Ueberreiter B. Pattern recognition by graph matching: Combinatorial versus continuous optimization. Internat. J. Pattern Recognition Artif. Intell. 2 3 (1988) 527-542
31. Lee R., and Liu J. Tropical cyclone identification and tracking system using integrated neural oscillatory elastic graph matching and hybrid rbf network track mining techniques. IEEE Trans. on Neural Networks 11 3 (2000) 680-689 10.1109/72.846739
32. Lee Y.-L., and Park R.-H. A surface-based approach to 3-d object recognition using a mean field annealing neural network. Pattern Recognition 35 2 (2002) 299-316
33. Lladós, J., 1997. Combining graph matching and hough transform for hand-drawn graphical document analysis. Application to architectural drawings. Ph.D. thesis, Universitat Auto-noma de Barcelona and University, Paris, p. 8.
34. Lopresti D., and Wilfong G. A fast technique for comparing graph representations with applications to performance evaluation. Internat. J. Doc. Anal. Recognition 6 4 (2003) 219-229.
35. Luo, B., Hancock, E.R., 2000. Symbolic graph matching using the em algorithm and singular value decomposition. In: 15th Internat. Conf. on Pattern Recognition (ICPR'00), pp. 2141-2144.
36. Mahé, P., Ueda, N., Akutsu, T., Perret, J.-L., Vert, J.-P., 2004. Extensions of marginalized graph kernels. In:Proc. 21st Internat. Conf. on Machine Learning.
37. Mahé P., Ueda N., Akutsu T., Perret J.-L., and Vert J.-P. Graph kernels for molecular structure-activity relationship analysis with support vector machines. J. Chem. Inform. Model. 45 4 (2005) 939-951
38. Mehlhorn K. Graph Algorithms and NP-completeness (1984), Springer-Verlag New York, Inc., New York, NY, USA
39. Messmer B.T., and Bunke H. A decision tree approach to graph and subgraph isomorphism detection. Pattern Recognition 32 12 (1999) 1979-1998
40. Munkres J. Algorithms for the assignment and transportation problems. J. Soc. Ind. Appl. Math. 5 1 (1957) 32-38
41. Myers R., Wilson R.C., and Hancock E.R. Bayesian graph edit distance. IEEE Trans. Pattern Anal. Mach. Intell. 22 6 (2000) 628-635
42. Neuhaus M., and Bunke H. Automatic learning of cost functions for graph edit distance. Inform. Sci. 177 1 (2007) 239-247
43. Papadopoulos, A., Manolopoulos, Y., 1999. Structure-based similarity search with graph histograms. In: Proc. Structure-based Similarity Search with Graph Histograms, pp. 174-178.
44. Peter Kriegel H., and Schonauer S. Similarity search in structured data. Data Warehousing Knowledge Discovery (2003) 309-319
45. Public IAM graph database repository, IAM. .
46. Ralaivola L., Swamidass S.J., Saigo H., and Baldi P. Graph kernels for chemical informatics. Neural Networks 18 8 (2005) 1093-1110
47. Robles-Kelly A., and Hancock E.R. Graph edit distance from spectral seriation. IEEE Trans. Pattern Anal. Mach. Intell. 27 3 (2005) 365-378
48. Schenker A., Last M., Bunke H., and Kandel A. Classification of web documents using graph matching. Internat. J. Pattern Recognition Artif. Intell. 18 3 (2004) 475-496
49. Seong D.S., Choi Y.K., Kim H.S., and Park K.H. An algorithm for optimal isomorphism between two random graphs. Pattern Recognition Lett. 15 4 (1994) 321-327
50. Serrau A., Marcialis G.L., Bunke H., and Roli F. An experimental comparison of fingerprint classification methods using graphs. Graph-based Representations Pattern Recognition (2005) 281-290
51. Shokoufandeh A., Bretzner L., Macrini D., Demirci M.F., Jönsson C., and Dickinson S. The representation and matching of categorical shape. Comput. Vision Image Understanding 103 2 (2006) 139-154.
52. Suard F., Rakotomamonjy A., and Bensrhair A. Object categorization using kernels combining graphs and histograms of gradients. Image Anal. Recognition (2006) 23-34
53. Suganthan D.M.P.N., and Teoh E.K. Pattern recognition by graph matching using the potts mft neural networks. Pattern Recognition 28 7 (1995) 997-1009
54. Suganthan D.M.P.N., and Teoh E.K. Pattern recognition by homomorphic graph matching using hopfield neural networks. Image Vision Comput. 13 1 (1995) 45-60
55. Valveny E., and Dosch P. Performance evaluation of symbol recognition. Doc. Anal. Syst. VI (2004) 354-365
56. Vapnik, V., 1982. Estimation of Dependences Based on Empirical Data, Empirical Inference Science. Series: Information Science and Statistics.
57. Vidal E. New formulation and improvements of the nearest-neighbour approximating and eliminating search algorithm (aesa). Pattern Recognition Lett. 15 1 (1994) 1-7
58. Wilson R., and Hancock E. A bayesian compatibility model for graph matching. Pattern Recognition Lett. 17 (1996) 263-276
59. Wong A.K.C., and You M. Entropy and distance of random graphs with application to structural pattern recognition. IEEE Trans. Pattern Anal. Machine Intell. 7 5 (1985) 599-609