Optimal Transport Approximation of 2-Dimensional Measures
DOI10.1137/18m1193736zbMath1524.65097arXiv1804.08356OpenAlexW2913142797WikidataQ127989346 ScholiaQ127989346MaRDI QIDQ6175992
Jonas Kahn, Pierre Weiss, Léo Lebrat, Frédéric de Gournay
Publication date: 25 July 2023
Published in: SIAM Journal on Imaging Sciences (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1804.08356
optimizationquantizationpath planningsampling theorymeasure theoryWasserstein distancecurve projectionblue noisenonphotorealistic rendering
Numerical smoothing, curve fitting (65D10) Newton-type methods (49M15) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Optimal transportation (49Q22)
Related Items (3)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Simple examples for the failure of Newton's method with line search for strictly convex minimization
- Gradient methods for minimizing composite functions
- A projection method on measures sets
- Motion of level sets by mean curvature. I
- Regularized Newton method for unconstrained convex optimization
- The geometry of optimal transportation
- Minkowski-type theorems and least-squares clustering
- Differentiation and regularity of semi-discrete optimal transport with respect to the parameters of the discrete measure
- Convergence of a Newton algorithm for semi-discrete optimal transport
- Convolutional wasserstein distances
- Consistency of variational continuous-domain quantization via kinetic theory
- An Algorithm for Variable Density Sampling with Block-Constrained Acquisition
- Proximal Splitting Methods in Signal Processing
- Optimal Delaunay and Voronoi Quantization Schemes for Pricing American Style Options
- BREAKING THE COHERENCE BARRIER: A NEW THEORY FOR COMPRESSED SENSING
- Linear Convergence and Metric Selection for Douglas-Rachford Splitting and ADMM
- Dithering by Differences of Convex Functions
- Global Convergence of Splitting Methods for Nonconvex Composite Optimization
- A Numerical Algorithm forL2Semi-Discrete Optimal Transport in 3D
- Numerical Optimization
- Fast Summation at Nonequispaced Knots by NFFT
- Affine plane curve evolution: a fully consistent scheme
- An Algorithm for Optimal Transport between a Simplex Soup and a Point Cloud
- Centroidal Voronoi Tessellations: Applications and Algorithms
- Power Diagrams: Properties, Algorithms and Applications
- Least squares quantization in PCM
- On Alternating Direction Methods of Multipliers: A Historical Perspective
- On the Generation of Sampling Schemes for Magnetic Resonance Imaging
- Comparison between W2 distance and Ḣ−1 norm, and Localization of Wasserstein distance
- Regularized Newton Methods for Minimizing Functions with Hölder Continuous Hessians
- A fast algorithm for particle simulations
This page was built for publication: Optimal Transport Approximation of 2-Dimensional Measures