Many-to-Many Graph Matching: a Continuous Relaxation Approach - ENSMP_DR Accéder directement au contenu
Pré-Publication, Document De Travail Année : 2009

Many-to-Many Graph Matching: a Continuous Relaxation Approach

Résumé

Graphs provide an efficient tool for object representation in various computer vision applications. Once graph-based representations are constructed, an important question is how to compare graphs. This problem is often formulated as a graph matching problem where one seeks a mapping between vertices of two graphs which optimally aligns their structure. In the classical formulation of graph matching, only one-to-one correspondences between vertices are considered. However, in many applications, graphs cannot be matched perfectly and it is more interesting to consider many-to-many correspondences where clusters of vertices in one graph are matched to clusters of vertices in the other graph. In this paper, we formulate the many-to-many graph matching problem as a discrete optimization problem and propose an approximate algorithm based on a continuous relaxation of the combinatorial problem. We compare our method with other existing methods on several benchmark computer vision datasets.
Fichier principal
Vignette du fichier
gramaseg_hal.pdf (318.09 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00465916 , version 1 (22-03-2010)

Identifiants

Citer

Mikhail Zaslavskiy, Francis Bach, Jean-Philippe Vert. Many-to-Many Graph Matching: a Continuous Relaxation Approach. 2009. ⟨hal-00465916⟩
724 Consultations
1213 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More