Related papers: Optimal Transport and Tessellation
We study a multi-marginal optimal transportation problem on a Riemannian manifold, with cost function given by the average distance squared from multiple points to their barycenter. Under a standard regularity condition on the first…
In this paper we extend recent developments in computational optimal transport to the setting of Riemannian manifolds. In particular, we show how to learn optimal transport maps from samples that relate probability distributions defined on…
This is an expository paper describing how duality theory for Hessian manifolds provides a natural setting for optimal transport. We explain how this can be used to solve Monge-Amp\`ere equations and survey recent results along these lines…
Entropically regularized optimal transport between probability measures supported on compact subsets of Euclidean space admits a representation as an information projection under moment inequality constraints. Exploiting this structure, I…
In this paper we analyze a mass transportation problem in a bounded domain with the possibility to transport mass to/from the boundary, paying the transport cost, that is given by the Euclidean distance plus an extra cost depending on the…
We prove results relating the theory of optimal transport and generalized Ricci flow. We define an adapted cost functional for measures using a solution of the associated dilaton flow. This determines a formal notion of geodesics in the…
We consider the numerical solution of the optimal transport problem between densities that are supported on sets of unequal dimension. Recent work by McCann and Pass reformulates this problem into a non-local Monge-Amp\`ere type equation.…
In this paper, we study optimal transportation problems for multifractal random measures. Since these measures are much less regular than optimal transportation theory requires, we introduce a new notion of transportation which is…
We consider approximating distributions within the framework of optimal mass transport and specialize to the problem of clustering data sets. Distances between distributions are measured in the Wasserstein metric. The main problem we…
This work is about the use of regularized optimal-transport distances for convex, histogram-based image segmentation. In the considered framework, fixed exemplar histograms define a prior on the statistical features of the two regions in…
Let $L=\DD+Z$ for a $C^1$ vector field $Z$ on a complete Riemannian manifold possibly with a boundary. By using the uniform distance, a number of transportation-cost inequalities on the path space for the (reflecting) $L$-diffusion process…
In this paper, we give a new characterization of the cut locus of a point on a compact Riemannian manifold as the zero set of the optimal transport density solution of the Monge-Kantorovich equations, a PDE formulation of the optimal…
We consider the $L^\infty$-optimal mass transportation problem \[ \min_{\Pi(\mu, \nu)} \gamma-\mathrm{ess\,sup\,} c(x,y), \] for a new class of costs $c(x,y)$ for which we introduce a tentative notion of twist condition. In particular we…
We consider the problem of finding an optimal transport plan between an absolutely continuous measure $\mu$ on $\mathcal{X} \subset \mathbb{R}^d$ and a finitely supported measure $\nu$ on $\mathbb{R}^d$ when the transport cost is the…
We explore the geometry of the Bures-Wasserstein space for potentially degenerate Gaussian measures on a separable Hilbert space. In this general setting, the optimal transport map is formally the subgradient of a convex function that is…
In this paper the optimal transport and the metamorphosis perspectives are combined. For a pair of given input images geodesic paths in the space of images are defined as minimizers of a resulting path energy. To this end, the underlying…
We propose a volumetric formulation for computing the Optimal Transport problem defined on surfaces in $\mathbb{R}^3$, found in disciplines like optics, computer graphics, and computational methodologies. Instead of directly tackling the…
Optimal Transport has received much attention in Machine Learning as it allows to compare probability distributions by exploiting the geometry of the underlying space. However, in its original formulation, solving this problem suffers from…
Using optimal transport we study some dynamical properties of expanding circle maps acting on measures by push-forward. Using the definition of the tangent space to the space of measures introduced by Gigli, their derivative at the unique…
Caffarelli's contraction theorem states that the Brenier optimal transport map from the standard Gaussian measure to a more log-concave probability measure is 1-Lipschitz. Owing to its many applications in analysis, probability, and…