A Path Following Algorithm for Graph Matching

Authors:
Mikhail Zaslavskiy;Francis Bach;Jean-Philippe Vert
Affiliations:
The Center for Computational Biology, École des Mines de Paris, ParisTech, Fontainebleau, France and The Center for Mathematical Morphology, École des Mines de Paris, ParisTech, Fontaine ...;INRIA-Willow Project, École Normale Supérieure, Paris, France;The Center for Computational Biology, École des Mines de Paris, ParisTech, Fontainebleau, France and Institut Curie, Section Recherche, INSERM U900, Paris, France
Venue:
ICISP '08 Proceedings of the 3rd international conference on Image and Signal Processing
Year:
2008

Citing 10
Cited 0

An Eigendecomposition Approach to Weighted Graph Matching Problems

IEEE Transactions on Pattern Analysis and Machine Intelligence
Feature-based correspondence: an eigenvector approach

Image and Vision Computing - Special issue: BMVC 1991
A Graduated Assignment Algorithm for Graph Matching

IEEE Transactions on Pattern Analysis and Machine Intelligence
Matrix computations (3rd ed.)

Matrix computations (3rd ed.)
A Linear Programming Approach for the Weighted Graph Matching Problem

IEEE Transactions on Pattern Analysis and Machine Intelligence
Shape Matching and Object Recognition Using Shape Contexts

IEEE Transactions on Pattern Analysis and Machine Intelligence
Graph-based handwritten digit string recognition

ICDAR '95 Proceedings of the Third International Conference on Document Analysis and Recognition (Volume 2) - Volume 2
An Eigenspace Projection Clustering Method for Inexact Graph Matching

IEEE Transactions on Pattern Analysis and Machine Intelligence
Pairwise global alignment of protein interaction networks by matching neighborhood topology

RECOMB'07 Proceedings of the 11th annual international conference on Research in computational molecular biology
Probabilistic subgraph matching based on convex relaxation

EMMCVPR'05 Proceedings of the 5th international conference on Energy Minimization Methods in Computer Vision and Pattern Recognition

Quantified Score

Hi-index	0.00

Visualization

Abstract

We propose a convex-concave programming approach for the labelled weighted graph matching problem. The convex-concave programming formulation is obtained by rewriting the 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 aslo a complex combinatorial problem. We therefore construct an approximation of the concave problem solution by following a solution path of the convex-concave problem obtained by linear interpolation of the convex and concave formulations, starting from the convex relaxation. The algorithm is compared with some of the best performing graph matching methods on three datasets: simulated graphs, QAPLib and handwritten chinese characters.