Earth mover's distances on discrete surfaces
From MaRDI portal
Publication:4635693
DOI10.1145/2601097.2601175zbMATH Open1396.65063OpenAlexW2164260102MaRDI QIDQ4635693FDOQ4635693
Leonidas Guibas, Justin Solomon, Raif M. Rustamov, Adrian Butscher
Publication date: 23 April 2018
Published in: ACM Transactions on Graphics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/2601097.2601175
Recommendations
Cited In (25)
- Ricci curvature for parametric statistics via optimal transport
- A linear finite-difference scheme for approximating randers distances on cartesian grids
- A Splitting Scheme for Flip-Free Distortion Energies
- On the Computation of Kantorovich--Wasserstein Distances Between Two-Dimensional Histograms by Uncapacitated Minimum Cost Flows
- Optimal transport: discretization and algorithms
- Computation of optimal transport on discrete metric measure spaces
- A parallel method for earth mover's distance
- Semi-discrete optimal transport: hardness, regularization and numerical solution
- Discrete Optimal Transport with Independent Marginals is #P-Hard
- Koopman operator framework for time series modeling and analysis
- Solving Large-Scale Optimization Problems with a Convergence Rate Independent of Grid Size
- Stochastic Control Liaisons: Richard Sinkhorn Meets Gaspard Monge on a Schrödinger Bridge
- Numerical solution of Monge-Kantorovich equations via a dynamic formulation
- Convolutional Wasserstein distances: efficient optimal transportation on geometric domains
- Discrete geodesic graph (DGG) for computing geodesic distances on polyhedral surfaces
- A Volumetric approach to Monge's optimal transport on surfaces
- Optimal transport over nonlinear systems via infinitesimal generators on graphs
- Entropy dissipation of Fokker-Planck equations on graphs
- Semi-discrete optimal transport: a solution procedure for the unsquared Euclidean distance case
- A transportation \(L^p\) distance for signal analysis
- Optimal transport for generative models
- Quadratically Regularized Optimal Transport on Graphs
- Robust Wasserstein profile inference and applications to machine learning
- Multilevel Optimal Transport: A Fast Approximation of Wasserstein-1 Distances
- \(p\)-Laplace diffusion for distance function estimation, optimal transport approximation, and image enhancement
This page was built for publication: Earth mover's distances on discrete surfaces
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4635693)