Skip to Main content Skip to Navigation
Conference papers

Optimal Transport vs Many-to-many assignment for Graph Matching

Anca-Ioana Grapa 1, 2 Laure Blanc-Féraud 1, 2 Ellen van Obberghen-Schilling 3, 2 Xavier Descombes 1, 2
1 MORPHEME - Morphologie et Images
CRISAM - Inria Sophia Antipolis - Méditerranée , IBV - Institut de Biologie Valrose : U1091, Laboratoire I3S - SIS - Signal, Images et Systèmes
Abstract : Graph matching for shape comparison or network analysis is a challenging issue in machine learning and computer vision. Gener-ally, this problem is formulated as an assignment task, where we seek the optimal matching between the vertices that minimizes the differencebetween the graphs. We compare a standard approach to perform graph matching, to a slightly-adapted version of regularized optimal transport,initially conceived to obtain the Gromov-Wassersein distance between structured objects (e.g. graphs) with probability masses associated to thenodes. We adapt the latter formulation to undirected and unlabeled graphs of different dimensions, by adding dummy vertices to cast the probleminto an assignment framework. The experiments are performed on randomly generated graphs onto which different spatial transformations areapplied. The results are compared with respect to the matching cost and execution time, showcasing the different limitations and/or advantagesof using these techniques for the comparison of graph networks.
Document type :
Conference papers
Complete list of metadatas

Cited literature [9 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-02279634
Contributor : Anca-Ioana Grapa <>
Submitted on : Thursday, September 5, 2019 - 2:34:11 PM
Last modification on : Tuesday, May 26, 2020 - 6:50:59 PM
Long-term archiving on: : Thursday, February 6, 2020 - 1:56:35 AM

File

GRETSI_2019.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-02279634, version 1

Collections

Citation

Anca-Ioana Grapa, Laure Blanc-Féraud, Ellen van Obberghen-Schilling, Xavier Descombes. Optimal Transport vs Many-to-many assignment for Graph Matching. GRETSI 2019 - XXVIIème Colloque francophone de traitement du signal et des images, Aug 2019, Lille, France. ⟨hal-02279634⟩

Share

Metrics

Record views

220

Files downloads

509