Earth mover's distances on discrete surfaces
From MaRDI portal
Publication:4635693
DOI10.1145/2601097.2601175zbMath1396.65063MaRDI 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
finite elements; Wasserstein metric; optimal transportation; geometric median; Earth mover's distance
65D18: Numerical aspects of computer graphics, image analysis, and computational geometry
Related Items
On the Computation of Kantorovich--Wasserstein Distances Between Two-Dimensional Histograms by Uncapacitated Minimum Cost Flows, Stochastic Control Liaisons: Richard Sinkhorn Meets Gaspard Monge on a Schrödinger Bridge, A linear finite-difference scheme for approximating randers distances on cartesian grids, A Splitting Scheme for Flip-Free Distortion Energies, Multilevel Optimal Transport: A Fast Approximation of Wasserstein-1 Distances, Solving Large-Scale Optimization Problems with a Convergence Rate Independent of Grid Size, Robust Wasserstein profile inference and applications to machine learning, Semi-discrete optimal transport: hardness, regularization and numerical solution, Discrete Optimal Transport with Independent Marginals is #P-Hard, \(p\)-Laplace diffusion for distance function estimation, optimal transport approximation, and image enhancement, Entropy dissipation of Fokker-Planck equations on graphs, A transportation \(L^p\) distance for signal analysis, Optimal transport over nonlinear systems via infinitesimal generators on graphs, 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, Numerical solution of Monge-Kantorovich equations via a dynamic formulation, Semi-discrete optimal transport: a solution procedure for the unsquared Euclidean distance case, Optimal transport: discretization and algorithms, Computation of optimal transport on discrete metric measure spaces, Discrete geodesic graph (DGG) for computing geodesic distances on polyhedral surfaces, Convolutional wasserstein distances, Quadratically Regularized Optimal Transport on Graphs
