@inproceedings{4df528229e3841e8a330a60b9cd49134,
title = "A weight regularized relaxation based graph matching algorithm",
abstract = "In this paper we propose a regularized relaxation based graph matching algorithm. The graph matching problem is formulated as a constrained convex quadratic program, by relaxing the permutation matrix to a doubly stochastic one. To gradually push the doubly stochastic matrix back to a permutation one, a simple weighted concave regular term is added to the convex objective function. The concave regular function is not a concave relaxation of the original matching problem. However, it is shown that such a simple concave regular term has a comparative performance as the concave relaxation of the PATH following algorithm, which works only on undirected graphs. A concave-convex procedure (CCCP) together with the Frank-Wolfe algorithm is adopted to solve the matching problem, and some experimental results witness the state-of-art performance of the proposed algorithm.",
keywords = "CCCP, Frank-Wolfe algorithm, convex relaxation, graph matching",
author = "Liu, \{Zhi Yong\} and Hong Qiao and Lei Xu",
year = "2012",
doi = "10.1007/978-3-642-31919-8\_2",
language = "英语",
isbn = "9783642319181",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "9--16",
booktitle = "Intelligent Science and Intelligent Data Engineering - Second Sino-Foreign-Interchange Workshop, IScIDE 2011, Revised Selected Papers",
note = "2nd Sino-Foreign-Interchange Workshop on Intelligent Science and Intelligent Data Engineering, IScIDE 2011 ; Conference date: 23-10-2011 Through 25-10-2011",
}