A path following algorithm for the graph matching problem

Computer Science – Computer Vision and Pattern Recognition

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

23 pages, 13 figures,typo correction, new results in sections 4,5,6

Scientific paper

We propose a convex-concave programming approach for the labeled weighted graph matching problem. The convex-concave programming formulation is obtained by rewriting the weighted graph matching problem as a least-square problem on the set of permutation matrices and relaxing it to two different optimization problems: a quadratic convex and a quadratic concave optimization problem on the set of doubly stochastic matrices. The concave relaxation has the same global minimum as the initial graph matching problem, but the search for its global minimum is also a hard combinatorial problem. We therefore construct an approximation of the concave problem solution by following a solution path of a convex-concave problem obtained by linear interpolation of the convex and concave formulations, starting from the convex relaxation. This method allows to easily integrate the information on graph label similarities into the optimization problem, and therefore to perform labeled weighted graph matching. The algorithm is compared with some of the best performing graph matching methods on four datasets: simulated graphs, QAPLib, retina vessel images and handwritten chinese characters. In all cases, the results are competitive with the state-of-the-art.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

A path following algorithm for the graph matching problem does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A path following algorithm for the graph matching problem, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A path following algorithm for the graph matching problem will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-282522

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.