An extended path following algorithm for graph-matching problem

IEEE Transactions on Pattern Analysis and Machine Intelligence

Volumn 34, Issue 7, 2012, Pages 1451-1456

  Liu, Zhi Yong ^a   Qiao, Hong ^a   Xu, Lei ^b  

^a INSTITUTE OF AUTOMATION   (China)

^b CHINESE UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

concave relaxation; convex relaxation; directed graph; Graph matching; PATH following algorithm

Indexed keywords

CONCAVE RELAXATION; CONVEX RELAXATION; DIRECTED GRAPH MODELS; GRAPH MATCHINGS; MATCHING PROBLEMS; OBJECTIVE FUNCTIONS; PATH-FOLLOWING ALGORITHM; STATE-OF-THE-ART PERFORMANCE; SYNTHETIC AND REAL DATA; UNDIRECTED GRAPH;

ALGORITHMS; DIRECTED GRAPHS; PATTERN MATCHING; RELAXATION PROCESSES;

PROBLEM SOLVING;

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

References (16)

1. M.A. Eshera and K.S. Fu, "An Image Understanding System Using Attributed Symbolic Representation and Inexact Graph-Matching," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 8, no. 5, pp. 604-618, Sept. 1986.
2. R. Singh, J.B. Xu, and B. Berger, "Global Alignment of Multiple Protein Interaction Networks with Application to Functional Orthology Detection," Proc. Nat'l Academy of Sciences USA, vol. 105, no. 35, pp. 12763-12768, 2008.
3. R. Myer, R.C. Wilson, and E.R. Hancock, "Bayesian Graph Edit Distance," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 22, no. 6, pp. 628-635, June 2000.
4. M. Zaslavskiy, F. Bach, and J.P. Vert, "A Path Following Algorithm for the Graph Matching Problem," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 31, no. 12, pp. 2227-2242, Dec. 2009.
5. J.E. Hopcroft and J.K. Wong, "Linear Time Algorithm for Isomorphism of Planar Graphs (Preliminary Report)," Proc. Sixth Ann. ACM Symp. Theory of Computing, pp. 172-184, 1974.
6. D. Conte, P. Foggia, C. Sansone, and M. Vento, "Thirty Years of Graph Matching in Pattern Recognition," Int'l J. Pattern Recognition and Artificial Intelligence, vol. 18, no. 3, pp. 265-298, 2004.
7. H. Almohamad and S. Duffuaa, "A Linear Programming Approach for the Weighted Graph Matching Problem," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 15, no. 5, pp. 522-525, May 1993.
8. S. Gold and A. Rangarajan, "A Graduated Assignment Algorithm for Graph Matching," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 18, no. 4, pp. 377-388, Apr. 1996. (Pubitemid 126771701)
9. H.W. Kuhn, "The Hungarian Method for the Assignment Problem," Naval Research Logistics Quarterly, vol. 2, nos. 1/2, pp. 83-97, 1955.
10. J.S. Li, "Kronecker Products of Positive Semidefinite Matrices," J. Math. Research and Exposition, vol. 17, no. 3, pp. 327-334, 1997.
11. X.Z. Zhan, "Extremal Eigenvalues of Real Symmetric Matrices with Entries in an Interval," SIAM J. Matrix Analysis and Applications, vol. 27, no. 3, pp. 851-860, 2006.
12. A. Dembo, "Bounds on the Extreme Eigenvalues of Positive-Definite Toeplitz Matrices," IEEE Trans. Information Theory, vol. 34, no. 2, pp. 352-355, Mar. 1988. (Pubitemid 18639995)
13. S. Boyd and L. Vandenberghe, Convex Optimization. Cambridge Univ. Press, 2004.
14. S. Umeyama, "An Eigendecomposition Approach to Weighted Graph Matching Problems," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 10, no. 5, pp. 695-703, Sept. 1988.
15. R.E. Burkard, S.E. Karisch, and F. Rendl, "Qaplib\A Quadratic Assignment Problem Library," J. Global Optimization, vol. 10, no. 4, pp. 391-403, 1997. (Pubitemid 127502198)
16. L. Xu and E. Oja, "Improved Simulated Annealing, Boltzmann Machine and Attributed Graph Matching," Proc. EURASIP Workshop 1990 Neural Networks, G. Goos and J.Hartmanis, eds., pp. 151-160, 1989.