title: An Extended Path Following Algorithm for Graph-Matching Problem.
abstract: 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.
authors.affiliation: State Key Laboratory of Management and Control for Complex Systems, Institute of Automation, Chinese Academy of Sciences, Beijing 100190, China. zhiyong.liu@ia.ac.cn
authors.forename: Zhi-Yong
authors.initials: ZY
authors.lastname: Liu
authors.forename: Hong
authors.initials: H
authors.lastname: Qiao
authors.forename: Lei
authors.initials: L
authors.lastname: Xu