A path following algorithm for the graph matching problem.

Mikhail Zaslavskiy 1, 2, 3 Francis Bach 4 Jean-Philippe Vert 2, 3
4 WILLOW - Models of visual object recognition and scene understanding
DI-ENS - Département d'informatique de l'École normale supérieure, ENS Paris - École normale supérieure - Paris, Inria Paris-Rocquencourt, CNRS - Centre National de la Recherche Scientifique : UMR8548
Abstract : 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, perform labeled weighted graph matching. The algorithm is compared with some of the best performing graph matching methods on four data sets: simulated graphs, QAPLib, retina vessel images, and handwritten Chinese characters. In all cases, the results are competitive with the state of the art.
Type de document :
Article dans une revue
IEEE Transactions on Pattern Analysis and Machine Intelligence, Institute of Electrical and Electronics Engineers, 2009, 31 (12), pp.2227-42. 〈10.1109/TPAMI.2008.245〉
Liste complète des métadonnées

https://hal.archives-ouvertes.fr/hal-00433567
Contributeur : Jean-Philippe Vert <>
Soumis le : jeudi 19 novembre 2009 - 23:38:12
Dernière modification le : vendredi 27 octobre 2017 - 17:36:02

Identifiants

Collections

Citation

Mikhail Zaslavskiy, Francis Bach, Jean-Philippe Vert. A path following algorithm for the graph matching problem.. IEEE Transactions on Pattern Analysis and Machine Intelligence, Institute of Electrical and Electronics Engineers, 2009, 31 (12), pp.2227-42. 〈10.1109/TPAMI.2008.245〉. 〈hal-00433567〉

Partager

Métriques

Consultations de la notice

260