Convolutional Wasserstein distances: efficient optimal transportation on geometric domains
From MaRDI portal
(Redirected from Publication:2802296)
Numerical interpolation (65D05) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Numerical optimization and variational techniques (65K10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Measures of information, entropy (94A17)
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
Cites work
- A computational fluid mechanics solution to the Monge-Kantorovich mass transfer problem
- A convexity principle for interacting gases
- A Relationship Between Arbitrary Positive Matrices and Doubly Stochastic Matrices
- A Variational Model for Histogram Transfer of Color Images
- Alternating projection methods.
- Barycenters in the Wasserstein space
- Conformal Wasserstein distances: comparing surfaces in polynomial time
- Diagonal Equivalence to Matrices with Prescribed Row and Column Sums
- Diffusion processes in a small time interval
- Direct Methods for Sparse Linear Systems
- Earth mover's distances on discrete surfaces
- Efficient Algorithms for Shortest Paths in Sparse Networks
- Elements of Information Theory
- From the Schrödinger problem to the Monge-Kantorovich problem
- scientific article; zbMATH DE number 1909499 (Why is no real title available?)
- scientific article; zbMATH DE number 3296905 (Why is no real title available?)
- Iterative Bregman projections for regularized transportation problems
- Multi-marginal optimal transport on Riemannian manifolds
- Numerical methods for matching for teams and Wasserstein barycenters
- On a Least Squares Adjustment of a Sampled Frequency Table When the Expected Marginal Totals are Known
- On the scaling of multidimensional matrices
- Regularized discrete optimal transport
- Short time behavior of the heat kernel and its logarithmic deviatives
- Sliced and Radon Wasserstein barycenters of measures
- The earth mover's distance as a metric for image retrieval
- The Sinkhorn–Knopp Algorithm: Convergence and Applications
- Weighted triangulations for geometry processing
Cited in
(only showing first 100 items - show all)- CytOpT: Optimal Transport with Domain Adaptation for Interpreting Flow Cytometry data
- Entropic optimal transport is maximum-likelihood deconvolution
- Convex histogram-based joint image segmentation with regularized optimal transport cost
- A transportation \(L^p\) distance for signal analysis
- Fréchet means and Procrustes analysis in Wasserstein space
- Projection-based reduced order models for a cut finite element method in parametrized domains
- Computation of optimal transport and related hedging problems via penalization and neural networks
- A stochastic multi-layer algorithm for semi-discrete optimal transport with applications to texture synthesis and style transfer
- Ground metric learning on graphs
- Minimax estimation of smooth optimal transport maps
- Coupling matrix manifolds assisted optimization for optimal transport problems
- Domain decomposition for entropy regularized optimal transport
- Global regularity for the Monge-Ampère equation with natural boundary condition
- Surrogate parametric metamodel based on optimal transport
- Kantorovich-Rubinstein distance and barycenter for finitely supported measures: foundations and algorithms
- A hierarchically low-rank optimal transport dissimilarity measure for structured data
- Approximate Wasserstein attraction flows for dynamic mass transport over networks
- Limit laws for empirical optimal solutions in random linear programs
- The Sinkhorn algorithm, parabolic optimal transport and geometric Monge-Ampère equations
- Stochastic distance transform: theory, algorithms and applications
- An optimal transport approach for the Schrödinger bridge problem and convergence of Sinkhorn algorithm
- Semi-discrete optimal transport: a solution procedure for the unsquared Euclidean distance case
- Optimal transport: discretization and algorithms
- Central limit theorems for entropy-regularized optimal transport on finite spaces and statistical applications
- Empirical optimal transport on countable metric spaces: distributional limits and statistical applications
- On the computation of Wasserstein barycenters
- Empirical geodesic graphs and CAT(k) metrics for data analysis
- Reduced-order model for the BGK equation based on POD and optimal transport
- Sharp asymptotic and finite-sample rates of convergence of empirical measures in Wasserstein distance
- A second order equation for Schrödinger bridges with applications to the hot gas experiment and entropic transportation cost
- People mover's distance: class level geometry using fast pairwise data adaptive transportation costs
- Estimation of Wasserstein distances in the spiked transport model
- Manifold learning for coherent design interpolation based on geometrical and topological descriptors
- Distributionally robust chance constrained SVM model with _2-Wasserstein distance
- Simple approximative algorithms for free-support Wasserstein barycenters
- A smoothed dual approach for variational Wasserstein problems
- Scaling algorithms for unbalanced optimal transport problems
- Elements of statistical inference in 2-Wasserstein space
- A review of optimal transport in image processing
- Geometry-Sensitive Ensemble Mean Based on Wasserstein Barycenters: Proof-of-Concept on Cloud Simulations
- Entropic approximation of Wasserstein gradient flows
- Semidual regularized optimal transport
- Regularized optimal transport and the rot mover's distance
- Displacement Interpolation Using Monotone Rearrangement
- Wasserstein dictionary learning: optimal transport-based unsupervised nonlinear dictionary learning
- An algorithm for optimal transport between a simplex soup and a point cloud
- Fast entropic regularized optimal transport using semidiscrete cost approximation
- A framework for Wasserstein-1-type metrics
- Optimal transport, mean partition, and uncertainty assessment in cluster analysis
- Stochastic control liaisons. Richard Sinkhorn meets Gaspard Monge on a Schrödinger bridge
- A fast globally linearly convergent algorithm for the computation of Wasserstein barycenters
- scientific article; zbMATH DE number 7370561 (Why is no real title available?)
- Multimarginal Optimal Transport with a Tree-Structured Cost and the Schrödinger Bridge Problem
- Scott: shape-location combined tracking with optimal transport
- Stochastic approximation versus sample average approximation for Wasserstein barycenters
- Wasserstein Barycenters Are NP-Hard to Compute
- Randomized Wasserstein barycenter computation: resampling with statistical guarantees
- A linear finite-difference scheme for approximating Randers distances on Cartesian grids
- Algorithms for optimal transport and Wasserstein distances
- Automatically Controlled Morphing of 2D Shapes with Textures
- On the computation of Kantorovich-Wasserstein distances between two-dimensional histograms by uncapacitated minimum cost flows
- Multilevel optimal transport: a fast approximation of Wasserstein-1 distances
- Information geometry for regularized optimal transport and barycenters of patterns
- scientific article; zbMATH DE number 7415088 (Why is no real title available?)
- Geodesic PCA in the Wasserstein space by convex PCA
- A smoothed dual approach for variational Wasserstein problems
- Stabilized Sparse Scaling Algorithms for Entropy Regularized Transport Problems
- Quantum entropic regularization of matrix-valued optimal transport
- Preconditioning of optimal transport
- Optimal vector quantization in terms of Wasserstein distance
- Convergence of entropic schemes for optimal transport and gradient flows
- scientific article; zbMATH DE number 7650079 (Why is no real title available?)
- Kernel Approximation on Algebraic Varieties
- Geometric Averages of Partitioned Datasets
- Optimal transport on discrete domains
- Semi-discrete optimal transport: hardness, regularization and numerical solution
- Polynomial-time algorithms for multimarginal optimal transport problems with structure
- Optimal Estimation of Wasserstein Distance on a Tree With an Application to Microbiome Studies
- Regularity of optimal mapping between hypercubes
- Transport Monte Carlo: High-Accuracy Posterior Approximation via Random Transport
- A family of pairwise multi-marginal optimal transports that define a generalized metric
- On quantum optimal transport
- Entropic Optimal Transport on Random Graphs
- Discrete Optimal Transport with Independent Marginals is #P-Hard
- Learning to generate Wasserstein barycenters
- Fast convergence of empirical barycenters in Alexandrov spaces and the Wasserstein space
- Optimal Transport Approximation of 2-Dimensional Measures
- The Wasserstein metric matrix and its computational property
- Quantitative stability of barycenters in the Wasserstein space
- Towards optimal running timesfor optimal transport
- Optimal transportation for electrical impedance tomography
- Accelerate rotation invariant sliced Gromov-Wasserstein distance by an alternative optimization method
- Efficient and exact multimarginal optimal transport with pairwise costs
- Randomized methods for computing optimal transport without regularization and their convergence analysis
- Algorithms for Euclidean-regularised optimal transport
- From law of the iterated logarithm to Zolotarev distance for supercritical branching processes in random environment
- Optimal transport for generative models
- A note on the radiant formula and its relations to the sliced Wasserstein distance
- A Volumetric approach to Monge's optimal transport on surfaces
- A registration method for reduced basis problems using linear optimal transport
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)
