| HAL : hal-00465916, version 1 |
| arXiv : 1004.4965 |
| Fiche détaillée | Récupérer au format |
|
|
|
|
| Many-to-Many Graph Matching: a Continuous Relaxation Approach |
|
|
| Mikhail Zaslavskiy 1, 2Francis Bach 3, 4 |
|
|
| (01/11/2009) |
|
|
| 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. |
|
|
|
|
|
|
|
|
|
|
| 1 : | Centre de Bioinformatique (CBIO) |
| Mines ParisTech | |
| 2 : | Cancer et génôme: Bioinformatique, biostatistiques et épidémiologie d'un système complexe |
| INSERM : U900 – Institut Curie – Mines ParisTech | |
| 3 : | WILLOW (INRIA Paris - Rocquencourt) |
| INRIA – Ecole Normale Supérieure de Paris - ENS Paris – CNRS : UMR8548 | |
| 4 : | Laboratoire d'informatique de l'école normale supérieure (LIENS) |
| CNRS : UMR8548 – Ecole Normale Supérieure de Paris - ENS Paris | |
|
|
|
|
|
|
|
|
| cbio;willow;u900;cmm |
|
|
|
|
| Domaine | : | Statistiques/Autres Informatique/Vision par ordinateur et reconnaissance de formes Mathématiques/Combinatoire |
|
|
| graph matching – many-to-many – pattern recognition – etl9b |
|
|
| Liste des fichiers attachés à ce document : | ||||||||||
|
|
|
| hal-00465916, version 1 | |
| http://hal.archives-ouvertes.fr/hal-00465916 | |
| oai:hal.archives-ouvertes.fr:hal-00465916 | |
| Contributeur : Mikhail Zaslavskiy | |
| Soumis le : Lundi 22 Mars 2010, 11:50:25 | |
| Dernière modification le : Mercredi 28 Avril 2010, 09:46:58 | |