An Extended Path Following Algorithm for Graph-Matching Problem

Zhiyong Liu, Hong Qiao, Lei Xu

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.
BibTeX
@article{liu2012extended,
  author = {Zhiyong Liu and Hong Qiao and Lei Xu},
  title = {{An Extended Path Following Algorithm for Graph-Matching Problem}},
  journal = {IEEE Trans. Pattern Anal. Mach. Intell.},
  year = {2012},
  url = {https://openreview.net/forum?id=xuV5ePoOmu},
}

Loading related content...

Figure