Issue No. 07 - July (2012 vol. 34)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TPAMI.2012.45
Zhi-Yong Liu , Chinese Academy of Sciences, Beijing
Hong Qiao , Chinese Academy of Sciences, Beijing
Lei Xu , Chinese University of Hong Kong, Hong Kong
The path following algorithm was proposed recently to approximately solve the matching problems on undirected graph models and exhibited a state-of-the-art performance on matching accuracy. In this paper, we extend the path following algorithm to the matching problems on directed graph models by proposing a concave relaxation for the problem. Based on the concave and convex relaxations, a series of objective functions are constructed, and the Frank-Wolfe algorithm is then utilized to minimize them. Several experiments on synthetic and real data witness the validity of the extended path following algorithm.
Graph matching, convex relaxation, concave relaxation, directed graph, PATH following algorithm.
Z. Liu, L. Xu and H. Qiao, "An Extended Path Following Algorithm for Graph-Matching Problem," in IEEE Transactions on Pattern Analysis & Machine Intelligence, vol. 34, no. , pp. 1451-1456, 2012.