Related papers: A new transportation distance with bulk/interface …
Recently, Papadakis et al. proposed an efficient primal-dual algorithm for solving the dynamic optimal transport problem with quadratic ground cost and measures having densities with respect to the Lebesgue measure. It is based on the fluid…
In many scientific fields imaging is used to relate a certain physical quantity to other dependent variables. Therefore, images can be considered as a map from a real-world coordinate system to the non-negative measurements being acquired.…
We introduce a new technique, which we call the boundary method, for solving semi-discrete optimal transport problems with a wide range of cost functions. The boundary method reduces the effective dimension of the problem, thus improving…
We propose an optimal solution to a deterministic dynamic assignment problem by leveraging connections to the theory of discrete optimal transport to convert the combinatorial assignment problem into a tractable linear program. We seek to…
We study the most common image and informal description of the optimal transport problem for quadratic cost, also known as the second boundary value problem for the Monge--Amp\`{e}re equation -- What is the most efficient way to fill a hole…
A prominent model for transportation networks is branched transport, which seeks the optimal transportation scheme to move material from a given initial to a final distribution. The cost of the scheme encodes a higher transport efficiency…
We consider a class of convex optimization problems modelling temporal mass transport and mass change between two given mass distributions (the so-called dynamic formulation of unbalanced transport), where we focus on those models for which…
We investigate a new multi-marginal optimal transport problem arising from a dissociation model in the Strong Interaction Limit of Density Functional Theory. In this short note, we introduce such dissociation model, the corresponding…
We provide a solution to the problem of optimal transport by Brownian martingales in general dimensions whenever the transport cost satisfies certain subharmonic properties in the target variable, as well as a stochastic version of the…
We rephrase Monge's optimal transportation (OT) problem with quadratic cost--via a Monge-Amp\`ere equation--as an infinite-dimensional optimization problem, which is in fact a convex problem when the target is a log-concave measure with…
We show that a class of Poincar\'e-Wirtinger inequalities on bounded convex sets can be obtained by means of the dynamical formulation of Optimal Transport. This is a consequence of a more general result valid for convex sets, possibly…
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…
In this work, we solve a discrete optimal transport problem in a nonuniform environment. To solve the optimal transport problem, we build the cost matrix and then use classical solvers for discrete optimal transport. The challenge is to…
We propose a discrete time formulation of the semi martingale optimal transport problembased on multi-marginal entropic transport. This approach offers a new way to formulate and solve numerically the calibration problem proposed by Guo et…
Optimal transport is a geometrically intuitive, robust and flexible metric for sample comparison in data analysis and machine learning. Its formal Riemannian structure allows for a local linearization via a tangent space approximation. This…
In this paper, we introduce a generalized dynamical unbalanced optimal transport framework by incorporating limited control input and mass dissipation, addressing limitations in conventional optimal transport for control applications. We…
We describe some analogy between optimal transport and the Schr\"odinger problem where the transport cost is replaced by an entropic cost with a reference path measure. A dual Kantorovich type formulation and a Benamou-Brenier type…
The optimal mass transportation was introduced by Monge some 200 years ago and is, today, the source of large number of results in analysis, geometry and convexity. Here I investigate a new, surprising link between optimal transformations…
The optimal (Monge-Kantorovich) transportation problem is discussed from several points of view. The Lagrangian formulation extends the action of the {\em Lagrangian} $L(v,x,t)$ from the set of orbits in $\R^n$ to a set of measure-valued…
Optimal Transport (OT) problem aims to find a transport plan that bridges two distributions while minimizing a given cost function. OT theory has been widely utilized in generative modeling. In the beginning, OT distance has been used as a…