Convolutional Wasserstein distances: efficient optimal transportation on geometric domains
From MaRDI portal
Publication:2802296
DOI10.1145/2766963zbMATH Open1334.68267OpenAlexW2009172320MaRDI QIDQ2802296FDOQ2802296
Andy Nguyen, Justin Solomon, Marco Cuturi, Fernando de Goes, Gabriel Peyré, Leonidas Guibas, Tao Du, Adrian Butscher
Publication date: 25 April 2016
Published in: ACM Transactions on Graphics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/2766963
Recommendations
- Fast entropic regularized optimal transport using semidiscrete cost approximation
- Algorithms for optimal transport and Wasserstein distances
- Multilevel optimal transport: a fast approximation of Wasserstein-1 distances
- A stochastic multi-layer algorithm for semi-discrete optimal transport with applications to texture synthesis and style transfer
- A review of optimal transport in image processing
Numerical optimization and variational techniques (65K10) Measures of information, entropy (94A17) Numerical interpolation (65D05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)
Cites Work
- The earth mover's distance as a metric for image retrieval
- Direct Methods for Sparse Linear Systems
- Elements of Information Theory
- A Relationship Between Arbitrary Positive Matrices and Doubly Stochastic Matrices
- On a Least Squares Adjustment of a Sampled Frequency Table When the Expected Marginal Totals are Known
- Barycenters in the Wasserstein Space
- Title not available (Why is that?)
- A computational fluid mechanics solution to the Monge-Kantorovich mass transfer problem
- A convexity principle for interacting gases
- Title not available (Why is that?)
- Efficient Algorithms for Shortest Paths in Sparse Networks
- From the Schrödinger problem to the Monge-Kantorovich problem
- Title not available (Why is that?)
- Numerical methods for matching for teams and Wasserstein barycenters
- Iterative Bregman Projections for Regularized Transportation Problems
- Sliced and Radon Wasserstein barycenters of measures
- Multi-marginal optimal transport on Riemannian manifolds
- Diffusion processes in a small time interval
- Regularized Discrete Optimal Transport
- On the scaling of multidimensional matrices
- The Sinkhorn–Knopp Algorithm: Convergence and Applications
- Short time behavior of the heat kernel and its logarithmic deviatives
- Conformal Wasserstein distances: comparing surfaces in polynomial time
- Earth mover's distances on discrete surfaces
- A Variational Model for Histogram Transfer of Color Images
- Diagonal Equivalence to Matrices with Prescribed Row and Column Sums
- Weighted Triangulations for Geometry Processing
Cited In (98)
- A hierarchically low-rank optimal transport dissimilarity measure for structured data
- On the Computation of Kantorovich--Wasserstein Distances Between Two-Dimensional Histograms by Uncapacitated Minimum Cost Flows
- Optimal transport: discretization and algorithms
- On the computation of Wasserstein barycenters
- Fréchet means and Procrustes analysis in Wasserstein space
- A smoothed dual approach for variational Wasserstein problems
- People mover's distance: class level geometry using fast pairwise data adaptive transportation costs
- Information Geometry for Regularized Optimal Transport and Barycenters of Patterns
- Simple approximative algorithms for free-support Wasserstein barycenters
- Preconditioning of Optimal Transport
- Reduced-order model for the BGK equation based on POD and optimal transport
- Displacement Interpolation Using Monotone Rearrangement
- Empirical optimal transport on countable metric spaces: distributional limits and statistical applications
- Title not available (Why is that?)
- Entropic optimal transport is maximum-likelihood deconvolution
- Computation of optimal transport and related hedging problems via penalization and neural networks
- Stochastic Control Liaisons: Richard Sinkhorn Meets Gaspard Monge on a Schrödinger Bridge
- Title not available (Why is that?)
- Scaling algorithms for unbalanced optimal transport problems
- A stochastic multi-layer algorithm for semi-discrete optimal transport with applications to texture synthesis and style transfer
- Quantum entropic regularization of matrix-valued optimal transport
- Ground metric learning on graphs
- Elements of Statistical Inference in 2-Wasserstein Space
- A Framework for Wasserstein-1-Type Metrics
- Multimarginal Optimal Transport with a Tree-Structured Cost and the Schrödinger Bridge Problem
- Minimax estimation of smooth optimal transport maps
- Approximate Wasserstein attraction flows for dynamic mass transport over networks
- Limit laws for empirical optimal solutions in random linear programs
- Optimal Transport Approximation of 2-Dimensional Measures
- Semi-discrete optimal transport: a solution procedure for the unsquared Euclidean distance case
- An Algorithm for Optimal Transport between a Simplex Soup and a Point Cloud
- Stochastic approximation versus sample average approximation for Wasserstein barycenters
- Central limit theorems for entropy-regularized optimal transport on finite spaces and statistical applications
- Optimal transport, mean partition, and uncertainty assessment in cluster analysis
- Randomized Wasserstein Barycenter Computation: Resampling with Statistical Guarantees
- A second order equation for Schrödinger bridges with applications to the hot gas experiment and entropic transportation cost
- A transportation \(L^p\) distance for signal analysis
- Title not available (Why is that?)
- Coupling matrix manifolds assisted optimization for optimal transport problems
- Domain decomposition for entropy regularized optimal transport
- Wasserstein Dictionary Learning: Optimal Transport-Based Unsupervised Nonlinear Dictionary Learning
- Entropic Approximation of Wasserstein Gradient Flows
- A Smoothed Dual Approach for Variational Wasserstein Problems
- Sharp asymptotic and finite-sample rates of convergence of empirical measures in Wasserstein distance
- Estimation of Wasserstein distances in the spiked transport model
- Semidual Regularized Optimal Transport
- Convergence of Entropic Schemes for Optimal Transport and Gradient Flows
- Manifold learning for coherent design interpolation based on geometrical and topological descriptors
- Stochastic distance transform: theory, algorithms and applications
- Conditional density estimation and simulation through optimal transport
- The Sinkhorn algorithm, parabolic optimal transport and geometric Monge-Ampère equations
- An optimal transport approach for the Schrödinger bridge problem and convergence of Sinkhorn algorithm
- CytOpT: Optimal Transport with Domain Adaptation for Interpreting Flow Cytometry data
- Fast Entropic Regularized Optimal Transport Using Semidiscrete Cost Approximation
- Surrogate parametric metamodel based on optimal transport
- Empirical geodesic graphs and CAT\((k)\) metrics for data analysis
- Convex histogram-based joint image segmentation with regularized optimal transport cost
- Projection-based reduced order models for a cut finite element method in parametrized domains
- Title not available (Why is that?)
- Multilevel Optimal Transport: A Fast Approximation of Wasserstein-1 Distances
- Geodesic PCA in the Wasserstein space by convex PCA
- Global regularity for the Monge-Ampère equation with natural boundary condition
- Stabilized Sparse Scaling Algorithms for Entropy Regularized Transport Problems
- Kantorovich-Rubinstein distance and barycenter for finitely supported measures: foundations and algorithms
- Optimal vector quantization in terms of Wasserstein distance
- Towards optimal running timesfor optimal transport
- A linear finite-difference scheme for approximating randers distances on cartesian grids
- Optimal transportation for electrical impedance tomography
- Accelerate rotation invariant sliced Gromov-Wasserstein distance by an alternative optimization method
- Polynomial-time algorithms for multimarginal optimal transport problems with structure
- Randomized methods for computing optimal transport without regularization and their convergence analysis
- Efficient and exact multimarginal optimal transport with pairwise costs
- Kernel Approximation on Algebraic Varieties
- Entropic Optimal Transport on Random Graphs
- Automatically Controlled Morphing of 2D Shapes with Textures
- Title not available (Why is that?)
- Transport Monte Carlo: High-Accuracy Posterior Approximation via Random Transport
- Semi-discrete optimal transport: hardness, regularization and numerical solution
- Discrete Optimal Transport with Independent Marginals is #P-Hard
- Wasserstein Barycenters Are NP-Hard to Compute
- Optimal Estimation of Wasserstein Distance on a Tree With an Application to Microbiome Studies
- Learning to generate Wasserstein barycenters
- From law of the iterated logarithm to Zolotarev distance for supercritical branching processes in random environment
- Regularity of optimal mapping between hypercubes
- Geometric Averages of Partitioned Datasets
- The Wasserstein metric matrix and its computational property
- A note on the radiant formula and its relations to the sliced Wasserstein distance
- A registration method for reduced basis problems using linear optimal transport
- Quantitative stability of barycenters in the Wasserstein space
- Optimal transport for generative models
- A family of pairwise multi-marginal optimal transports that define a generalized metric
- Geometry-Sensitive Ensemble Mean Based on Wasserstein Barycenters: Proof-of-Concept on Cloud Simulations
- Statistical inference with regularized optimal transport
- On quantum optimal transport
- Propagation of chaos for mean field Schrödinger problems
- Distributionally robust chance constrained SVM model with \(\ell_2\)-Wasserstein distance
- Sparse Wasserstein barycenters and application to reduced order modeling
- Fast convergence of empirical barycenters in Alexandrov spaces and the Wasserstein space
Uses Software
This page was built for publication: Convolutional Wasserstein distances: efficient optimal transportation on geometric domains
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2802296)
