The RW2 Algorithm for Exact Graph Matching

The RW algorithm has been proposed recently to solve the exact graph matching problem. This algorithm exploits Random Walk theory to compute a topological signature which can be used to match the nodes in two isomorphic graphs. However, the algorithm may suffer from the presence of colliding signatures in the same graph, which may prevent the procedure from finding the complete mapping between the matching nodes. In this paper we propose an improved version of the original algorithm, the RW2 algorithm, which progressively expands the node signatures by a recursive visit of the node descendants and ancestors to disambiguate the colliding signatures. The experimental results, performed on a benchmark dataset, show that the new algorithm attains a better matching rate with almost the same computational cost as the original one.

[1]  Antonio Robles-Kelly,et al.  Graph edit distance from spectral seriation , 2005, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[2]  Marco Gori,et al.  Graph matching using random walks , 2004, ICPR 2004.

[3]  Franco Scarselli,et al.  Inside PageRank , 2005, TOIT.

[4]  Mario Vento,et al.  Thirty Years Of Graph Matching In Pattern Recognition , 2004, Int. J. Pattern Recognit. Artif. Intell..

[5]  Shinji Umeyama,et al.  An Eigendecomposition Approach to Weighted Graph Matching Problems , 1988, IEEE Trans. Pattern Anal. Mach. Intell..

[6]  Valerie Isham,et al.  Non‐Negative Matrices and Markov Chains , 1983 .

[7]  P. Foggia,et al.  Performance evaluation of the VF graph matching algorithm , 1999, Proceedings 10th International Conference on Image Analysis and Processing.

[8]  Douglas C. Schmidt,et al.  A Fast Backtracking Algorithm to Test Directed Graphs for Isomorphism Using Distance Matrices , 1976, J. ACM.

[9]  Mario Vento,et al.  A Database of Graphs for Isomorphism and Sub-Graph Isomorphism Benchmarking , 2001 .

[10]  Mario Vento,et al.  A Performance Comparison of Five Algorithms for Graph Isomorphism , 2001 .

[11]  Julian R. Ullmann,et al.  An Algorithm for Subgraph Isomorphism , 1976, J. ACM.

[12]  Edwin R. Hancock,et al.  String Edit Distance, Random Walks And Graph Matching , 2004, Int. J. Pattern Recognit. Artif. Intell..

[13]  Marco Gori,et al.  Exact and approximate graph matching using random walks , 2005, IEEE Transactions on Pattern Analysis and Machine Intelligence.