The Gromov-Wasserstein distance: a brief overview

DOI10.3390/axioms3030335zbMath1311.68174OpenAlexW1970958500WikidataQ126013433 ScholiaQ126013433MaRDI QIDQ2345057

Facundo Mémoli

Publication date: 19 May 2015

Published in: Axioms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3390/axioms3030335

zbMATH Keywords

graph theoryshape recognitionoptimal transportationmetric geometry

Mathematics Subject Classification ID

Computing methodologies for image processing (68U10) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Machine vision and scene understanding (68T45)

Related Items (5)

Multidimensional scaling on metric measure spaces ⋮ Entropic Optimal Transport on Random Graphs ⋮ ToFU: topology functional units for deep learning ⋮ Magnitude and Topological Entropy of Digraphs ⋮ A self-improvement to the Cauchy-Schwarz inequality

Cites Work

• A spectral notion of Gromov-Wasserstein distance and related methods
• Gromov-Wasserstein distances and the metric approach to object matching
• On reconstructing \(n\)-point configurations from the distribution of distances or areas
• On the geometry of metric measure spaces. I
• Invariant Histograms
• Shape distributions

This page was built for publication: The Gromov-Wasserstein distance: a brief overview