Earth mover's distances on discrete surfaces

DOI10.1145/2601097.2601175zbMath1396.65063OpenAlexW2164260102MaRDI QIDQ4635693

Justin Solomon, Raif M. Rustamov, Adrian Butscher, Leonidas J. Guibas

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

zbMATH Keywords

finite elementsWasserstein metricoptimal transportationgeometric medianEarth mover's distance

Mathematics Subject Classification ID

Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Related Items

Discrete geodesic graph (DGG) for computing geodesic distances on polyhedral surfaces, Quadratically Regularized Optimal Transport on Graphs, Entropy dissipation of Fokker-Planck equations on graphs, Numerical solution of Monge-Kantorovich equations via a dynamic formulation, A linear finite-difference scheme for approximating randers distances on cartesian grids, A Splitting Scheme for Flip-Free Distortion Energies, Semi-discrete optimal transport: hardness, regularization and numerical solution, Discrete Optimal Transport with Independent Marginals is #P-Hard, A transportation \(L^p\) distance for signal analysis, Semi-discrete optimal transport: a solution procedure for the unsquared Euclidean distance case, Optimal transport over nonlinear systems via infinitesimal generators on graphs, Multilevel Optimal Transport: A Fast Approximation of Wasserstein-1 Distances, \(p\)-Laplace diffusion for distance function estimation, optimal transport approximation, and image enhancement, Optimal transport: discretization and algorithms, A parallel method for earth mover's distance, Ricci curvature for parametric statistics via optimal transport, Koopman operator framework for time series modeling and analysis, Computation of optimal transport on discrete metric measure spaces, Convolutional wasserstein distances, On the Computation of Kantorovich--Wasserstein Distances Between Two-Dimensional Histograms by Uncapacitated Minimum Cost Flows, Solving Large-Scale Optimization Problems with a Convergence Rate Independent of Grid Size, Robust Wasserstein profile inference and applications to machine learning, Stochastic Control Liaisons: Richard Sinkhorn Meets Gaspard Monge on a Schrödinger Bridge