Abstract-The path following algorithm was proposed recently to approximately solve the matching problems on undirected graph models and exhibited a state-ofthe-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 FrankWolfe algorithm is then utilized to minimize them. Several experiments on synthetic and real data witness the validity of the extended path following algorithm.
Liu et al. REF extended the original algorithm for solving the directed graph matching problems defined on an adjacency matrix by modifying the concave relaxation method.
An Extended Path Following Algorithm for Graph-Matching Problem
IEEE Transactions on Pattern Analysis and Machine Intelligence
IEEE Transactions on Pattern Analysis and Machine Intelligence
Computer Science Medicine