HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation
Reports

A graph matching method based on leading Eigenvector and Sinkhorn-Knopp algorithm

Romain Raveaux 1
1 RFAI - Reconnaissance des formes et analyse d'images
LIFAT - Laboratoire d'Informatique Fondamentale et Appliquée de Tours
Abstract : The goal of the report is to present a graph matching method based on the leading Eigenvector and Sinkhorn-Knopp algorithm. This method is not new and is reported in [6].
Keywords : Graph Matching Optimal Transport Lagrangean relaxation
Document type :
Reports
Complete list of metadata
https://hal-espci.archives-ouvertes.fr/hal-03390290
Contributor : Romain Raveaux Connect in order to contact the contributor
Submitted on : Tuesday, November 9, 2021 - 2:31:51 PM
Last modification on : Tuesday, January 11, 2022 - 5:56:33 PM

File

Vignette du document
AroundGraphMatchingRelaxedAndR...
Files produced by the author(s)

Identifiers

  • HAL Id : hal-03390290, version 2

Collections

ESPCI | PARISTECH | LIFAT | LIRFAI | INSA-GROUPE | UNIV-TOURS | INSA-CVL | LARA | CNRS

Citation

Romain Raveaux. A graph matching method based on leading Eigenvector and Sinkhorn-Knopp algorithm. [Research Report] Université de Tours - LIFAT. 2021. ⟨hal-03390290v2⟩

Export

BibTeX TEI DC DCterms EndNote Datacite

Share

Metrics

Record views

24

Files downloads

9