Computing the Gromov-Wasserstein Distance between Two Surface Meshes Using Optimal Transport
The Gromov-Wasserstein (GW) formalism can be seen as a generalization of the optimal transport (OT) formalism for comparing two distributions associated with different metric spaces. It is a quadratic optimization problem and solving it usually has computational costs that can rise sharply if the pr...
Main Authors: | Patrice Koehl, Marc Delarue, Henri Orland |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2023-02-01
|
Series: | Algorithms |
Subjects: | |
Online Access: | https://www.mdpi.com/1999-4893/16/3/131 |
Similar Items
-
Fused Gromov-Wasserstein Distance for Structured Objects
by: Titouan Vayer, et al.
Published: (2020-08-01) -
Subspace Detours Meet Gromov–Wasserstein
by: Clément Bonet, et al.
Published: (2021-12-01) -
Explainable AI Using the Wasserstein Distance
by: Shion Samadder Chaudhury, et al.
Published: (2024-01-01) -
Correcting nuisance variation using Wasserstein distance
by: Gil Tabak, et al.
Published: (2020-02-01) -
Probability Forecast Combination via Entropy Regularized Wasserstein Distance
by: Ryan Cumings-Menon, et al.
Published: (2020-08-01)