A sparse multiscale algorithm for dense optimal transport
From MaRDI portal
Publication:334276
DOI10.1007/s10851-016-0653-9zbMath1351.49037arXiv1510.05466OpenAlexW2211336473MaRDI QIDQ334276
Publication date: 1 November 2016
Published in: Journal of Mathematical Imaging and Vision (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1510.05466
Related Items
A convergent finite difference method for optimal transport on the sphere, A Framework for Wasserstein-1-Type Metrics, Error Bounds for Discretized Optimal Transport and Its Reliable Efficient Numerical Solution, Scaling algorithms for unbalanced optimal transport problems, A multiscale semi-smooth Newton method for optimal transport, A convergence framework for optimal transport on the sphere, Randomized Wasserstein Barycenter Computation: Resampling with Statistical Guarantees, Unnamed Item, Genetic Column Generation: Fast Computation of High-Dimensional Multimarginal Optimal Transport Problems, Semi-discrete optimal transport: hardness, regularization and numerical solution, Optimal Transport via a Monge--Ampère Optimization Problem, Traversing the Schrödinger bridge strait: Robert Fortet's marvelous proof redux, Density estimation of multivariate samples using Wasserstein distance, The boundary method for semi-discrete optimal transport partitions and Wasserstein distance computation, Wassmap: Wasserstein Isometric Mapping for Image Manifold Learning, A graph space optimal transport distance as a generalization of L p distances: application to a seismic imaging inverse problem, Applications of No-Collision Transportation Maps in Manifold Learning, On coupling particle filter trajectories, Convex histogram-based joint image segmentation with regularized optimal transport cost, A transportation \(L^p\) distance for signal analysis, Semi-discrete optimal transport: a solution procedure for the unsquared Euclidean distance case, Approximation of optimal transport problems with marginal moments constraints, Multilevel Optimal Transport: A Fast Approximation of Wasserstein-1 Distances, Optimal transport: discretization and algorithms, Convergence of Entropic Schemes for Optimal Transport and Gradient Flows, Unnamed Item, A stochastic multi-layer algorithm for semi-discrete optimal transport with applications to texture synthesis and style transfer, Image Labeling Based on Graphical Models Using Wasserstein Messages and Geometric Assignment, Empirical optimal transport on countable metric spaces: distributional limits and statistical applications, Domain decomposition for entropy regularized optimal transport, Stabilized Sparse Scaling Algorithms for Entropy Regularized Transport Problems, Minimal convex extensions and finite difference discretisation of the quadratic Monge–Kantorovich problem, A hierarchically low-rank optimal transport dissimilarity measure for structured data, Unnamed Item, Empirical Regularized Optimal Transport: Statistical Theory and Applications, A particle-evolving method for approximating the optimal transport plan
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Transport between RGB images motivated by dynamic optimal transport
- Numerical solution of the optimal transportation problem using the Monge-Ampère equation
- A class of Cartesian grid embedded boundary algorithms for incompressible flow with time-varying complex geometries
- Optimal mass transportation and Mather theory
- Globally optimal joint image segmentation and shape matching based on Wasserstein modes
- The geometry of optimal transportation
- The earth mover's distance as a metric for image retrieval
- Perspectives of Monge properties in optimization
- A linear optimal transportation framework for quantifying and visualizing variations in sets of images
- A computational fluid mechanics solution to the Monge-Kantorovich mass transfer problem
- Optimal transport for applied mathematicians. Calculus of variations, PDEs, and modeling
- Optimal mass transport for registration and warping
- Regularized Regression and Density Estimation based on Optimal Transport
- From Knothe's Transport to Brenier's Map and a Continuation Method for Optimal Transport
- A sparse algorithm for dense optimal transport
- Finding Minimum-Cost Circulations by Successive Approximation
- A generalized model for optimal transport of images including dissipation and density modulation
- Polar factorization and monotone rearrangement of vector‐valued functions
- Solution of Optimal Transportation Problems Using a Multigrid Linear Programming Approach
- Iterative Bregman Projections for Regularized Transportation Problems
- Convex analysis and monotone operator theory in Hilbert spaces
- Optimal Transport
- Polar factorization of maps on Riemannian manifolds
