Exact and approximate graph matching using random walks

IEEE Transactions on Pattern Analysis and Machine Intelligence

Volumn 27, Issue 7, 2005, Pages 1100-1111

  Gori, Marco ^a   Maggini, Marco ^a   Sarti, Lorenzo ^a  

^a UNIVERSITY OF SIENA   (Italy)

Author keywords

Approximate graph matching; Exact graph matching; Image retrieval; PageRank; Random walks

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; DATABASE SYSTEMS; GRAPH THEORY; IMAGE RETRIEVAL; MARKOV PROCESSES; MATHEMATICAL MODELS; MATRIX ALGEBRA; POLYNOMIALS; PROBABILITY DISTRIBUTIONS; RANDOM PROCESSES; THEOREM PROVING;

APPROXIMATE GRAPH MATCHING; EXACT GRAPH MATCHING; RANDOM WALKS;

PATTERN MATCHING;

ALGORITHM; ARTICLE; ARTIFICIAL INTELLIGENCE; AUTOMATED PATTERN RECOGNITION; CLUSTER ANALYSIS; COMPARATIVE STUDY; COMPUTER ASSISTED DIAGNOSIS; COMPUTER SIMULATION; EVALUATION; INFORMATION RETRIEVAL; MATHEMATICAL COMPUTING; METHODOLOGY; SIGNAL PROCESSING; STATISTICAL MODEL;

ALGORITHMS; ARTIFICIAL INTELLIGENCE; CLUSTER ANALYSIS; COMPUTER SIMULATION; IMAGE INTERPRETATION, COMPUTER-ASSISTED; INFORMATION STORAGE AND RETRIEVAL; MODELS, STATISTICAL; NUMERICAL ANALYSIS, COMPUTER-ASSISTED; PATTERN RECOGNITION, AUTOMATED; SIGNAL PROCESSING, COMPUTER-ASSISTED;

EID: 22944432498     PISSN: 01628828     EISSN: None     Source Type: Journal    
DOI: 10.1109/TPAMI.2005.138     Document Type: Article

References (26)

1. J.R. Ullmann, "An Algorithm For Subgraph Isomorphism," J. ACM, vol. 23, no. 1, pp. 31-42, 1976.
2. D.C. Schmidt and L.E. Druffel, "A Fast Backtracking Algorithm to Test Directed Graphs For Isomorphism Using Distance Matrices," J. ACM, vol. 23, no. 3, pp. 433-445, 1976.
3. B.D. McKay, "Practical Graph Isomorphism," Congressus Numerantium, vol. 30, pp. 45-87, 1981.
4. L.P. Cordelia, P. Foggia, C. Sansone, and M. Vento, "Performance Evaluation of the VF Graph Matching Algorithm," Proc. 10th Int'l Conf. Image Analysis and Processing, pp. 1172-1177, 1999.
5. M.A. Eschera and K.S. Fu, "A Graph Distance Measure for Image Analysis," IEEE Trans. Systems, Man, and Cybernetics, vol. 14, pp. 398-407, 1984.
6. W.J. Christmas, J. Kittler, and M. Petrou, "Structural Matching in Computer Vision Using Probabilistic Relaxation," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 17, no. 8, pp. 749-764, Aug. 1995.
7. K.A. DeJong and W.M. Spears, "Using Genetic Algorithm to Solve NP-Complete Problems," Proc. Int'l Conf. Genetic Algorithms, pp. 124-132, 1989.
8. S. Umeyama, "An Eigendecomposition Approach to Weighted Graph Matching Problems," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 10, no. 5, pp. 695-703, May 1988.
9. B. Luo and E.R. Hancock, "Structural Graph Matching Using the EM Algorithm and Singular Value Decomposition," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 23, no. 10, pp. 1120-1136, Oct. 2001.
10. F. DePiero, M. Trivedi, and S. Serbin, "Graph Matching Using a Direct Classification of Node Attendance," Pattern Recognition, vol. 29, no. 6, pp. 1031-1048, 1996.
11. L. Page, S. Brin, R. Motwani, and T. Winograd, "The PageRank Citation Ranking: Bringing Order to the Web," technical report, Computer Science Dept., Stanford Univ., 1999.
12. M. Diligenti, M. Gori, and M. Maggini, "A Unified Probabilistic Framework for Web Page Scoring Systems," IEEE Trans. Knowledge and Data Eng., vol. 16, no. 1, pp. 4-16, Jan. 2004.
13. E. Seneta, Non-Negative Matrices and Markov Chains. Springer-Verlag, 1981.
14. L. Padulo and M. Arbib, System Theory - A Unified Approach to Continous and Discrete Systems. Philadelphia, London, Toronto: W.B. Saunders Company, 1974.
15. A. Pasini, "On Two Matrices Related to the Transition Matrix of a Graph," technical report, Dipartimento di Matematica, Univ. di Siena, 2004.
16. M. Bianchini, M. Gori, and F. Scarselli, "Inside PageRank," ACM Trans. Internet Technology, 2005.
17. H.W. Kuhn, "The Hungarian Method for the Assignment Problem," Naval Research Logistics Quarterly, vol. 2, pp. 83-97, 1955.
18. P.K. Agarwal and K. Varadarajan, "Approximation Algorithms for Bipartite and Non-Bipartite Matching in the Plane," Proc. 10th Ann. ACM-SIAM Symp. Discrete Algorithms, pp. 805-814, 1999.
19. H.N. Gabow and R.E. Tarjan, "Faster Scaling Algorithms for Network Problems," SIAM J. Computing, vol. 18, no. 5, pp. 1013-1036, 1989.
20. P. Foggia, C. Sansone, and M. Vento, "A Database of Graphs for Isomorphism and Subgraph Isomorphism Benchmarking," Proc. Third IAPR TC-15 Int'l Workshop Graph-Based Representations in Pattern Recognition, pp. 176-187, 2001.
21. P. Foggia, C. Sansone, and M. Vento, "A Performance Comparison of Five Algorithms for Graph Isomorphism," Proc. Third IAPR TC-15 Int'l Workshop Graph-Based Representations in Pattern Recognition, pp. 188-199, 2001.
22. S.A. Nene, S.K. Nayar, and H. Murase, "Columbia Object Image Library (COIL-100)," technical report, Columbia Univ., 1996.
23. S.A. Nene, S.K. Nayar, and H. Murase, "Real-Time 100 Object Recognition System," Proc. IEEE Int'I Conf. Robotics and Automation, pp. 2321-2325, 1996.
24. M. Pontil and A. Verri, "Support Vector Machines for 3D Object Recognition," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 20, no. 6, pp. 637-646, June 1998.
25. C. DeMauro, M. Diligenti, M. Gori, and M. Maggini, "Similarity Learning for Graphnn-Based Image Representations," Proc. Third IAPR TC-15 Int'l Workshop Graph-Based Representations in Pattern Recognition, pp. 250-259, 2001.
26. M. Diligenti, M. Gori, and M. Maggini, "A Learning Algorithm for Web Page Scoring Systems," Proc. 18th Int'l Joint Conf. Artificial Intelligence, pp. 575-580, 2003.