Optimal Transport Approximation of 2-Dimensional Measures
From MaRDI portal
Publication:6175992
Abstract: We propose a fast and scalable algorithm to project a given density on a set of structured measures defined over a compact 2D domain. The measures can be discrete or supported on curves for instance. The proposed principle and algorithm are a natural generalization of previous results revolving around the generation of blue-noise point distributions, such as Lloyd's algorithm or more advanced techniques based on power diagrams. We analyze the convergence properties and propose new approaches to accelerate the generation of point distributions. We also design new algorithms to project curves onto spaces of curves with bounded length and curvature or speed and acceleration. We illustrate the algorithm's interest through applications in advanced sampling theory, non-photorealistic rendering and path planning.
Recommendations
- 3/4-discrete optimal transport
- A numerical algorithm for \(L_2\) semi-discrete optimal transport in 3D
- An algorithm for optimal transport between a simplex soup and a point cloud
- A fast approach to optimal transport: the back-and-forth method
- Optimal transport: fast probabilistic approximation with exact solvers
Cites work
- scientific article; zbMATH DE number 1257377 (Why is no real title available?)
- scientific article; zbMATH DE number 1909499 (Why is no real title available?)
- scientific article; zbMATH DE number 3099866 (Why is no real title available?)
- A fast algorithm for particle simulations
- A numerical algorithm for \(L_2\) semi-discrete optimal transport in 3D
- A projection method on measures sets
- Affine plane curve evolution: a fully consistent scheme
- An algorithm for optimal transport between a simplex soup and a point cloud
- An algorithm for variable density sampling with block-constrained acquisition
- Breaking the coherence barrier: a new theory for compressed sensing
- Centroidal Voronoi Tessellations: Applications and Algorithms
- Comparison between \(W_2\) distance and \(\dot{H}^{-1}\) norm, and localization of Wasserstein distance
- Consistency of variational continuous-domain quantization via kinetic theory
- Convergence of a Newton algorithm for semi-discrete optimal transport
- Convolutional Wasserstein distances: efficient optimal transportation on geometric domains
- Differentiation and regularity of semi-discrete optimal transport with respect to the parameters of the discrete measure
- Dithering by differences of convex functions
- Fast Summation at Nonequispaced Knots by NFFT
- Global convergence of splitting methods for nonconvex composite optimization
- Gradient methods for minimizing composite functions
- Least squares quantization in PCM
- Linear Convergence and Metric Selection for Douglas-Rachford Splitting and ADMM
- Minkowski-type theorems and least-squares clustering
- Motion of level sets by mean curvature. I
- Numerical Optimization
- On alternating direction methods of multipliers: a historical perspective
- On the generation of sampling schemes for magnetic resonance imaging
- Optimal Delaunay and Voronoi quantization schemes for pricing American style options
- Power Diagrams: Properties, Algorithms and Applications
- Proximal splitting methods in signal processing
- Regularized Newton method for unconstrained convex optimization
- Regularized Newton methods for minimizing functions with Hölder continuous hessians
- Simple examples for the failure of Newton's method with line search for strictly convex minimization
- The geometry of optimal transportation
Cited in
(8)- One-dimensional approximation of measures in Wasserstein distance
- From optimal transport to discrepancy
- 3/4-discrete optimal transport
- Spectral decomposition of discrepancy kernels on the Euclidean ball, the special orthogonal group, and the Grassmannian manifold
- On Optimal Transport of Matrix-Valued Measures
- A new optimal transport distance on the space of finite Radon measures
- Second-order models for optimal transport and cubic splines on the Wasserstein Space
- Curve based approximation of measures on manifolds by discrepancy minimization
This page was built for publication: Optimal Transport Approximation of 2-Dimensional Measures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6175992)
