Related papers: A Transport for imaging process
This paper outlines the ideas behind developing a graph-based heuristic-driven routing algorithm designed for a particular instance of a goods transportation problem with a single good type. The proposed algorithm solves the optimization…
An algorithm is proposed to calculate traveling dissipative solitons for the FitzHugh-Nagumo equations. It is based on the application of the steepest descent method to a certain functional. This approach can be used to find solitons…
To remedy the drawbacks of full-mass or fixed-mass constraints in classical optimal transport, we propose adaptive optimal transport which is distinctive from the classical optimal transport in its ability of adaptive-mass preserving. It…
Entropic optimal transport (OT) and the Sinkhorn algorithm have made it practical for machine learning practitioners to perform the fundamental task of calculating transport distance between statistical distributions. In this work, we focus…
This paper deals with the existence of optimal transport maps for some optimal transport problems with a convex but non strictly convex cost. We give a decomposition strategy to address this issue. As part of our strategy, we have to treat…
In this paper we propose and study a novel optimal transport based regularization of linear dynamic inverse problems. The considered inverse problems aim at recovering a measure valued curve and are dynamic in the sense that (i) the…
Optimal transportation provides a means of lifting distances between points on a geometric domain to distances between signals over the domain, expressed as probability distributions. On a graph, transportation problems can be used to…
We propose a novel exact algorithm for the transportation problem, one of the paradigmatic network optimization problems. The algorithm, denoted Iterated Inside Out, requires in input a basic feasible solution and is composed by two main…
We present an efficient algorithm for recent generalizations of optimal mass transport theory to matrix-valued and vector-valued densities. These generalizations lead to several applications including diffusion tensor imaging, color images…
We propose a simple subsampling scheme for fast randomized approximate computation of optimal transport distances. This scheme operates on a random subset of the full data and can use any exact algorithm as a black-box back-end, including…
We develop a fast and reliable method for solving large-scale optimal transport (OT) problems at an unprecedented combination of speed and accuracy. Built on the celebrated Douglas-Rachford splitting technique, our method tackles the…
Optimal transport has been an essential tool for reconstructing dynamics from complex data. With the increasingly available multifaceted data, a system can often be characterized across multiple spaces. Therefore, it is crucial to maintain…
We study a continuum model of dislocation transport in order to investigate the formation of heterogeneous dislocation patterns. We propose a physical mechanism which relates the formation of heterogeneous patterns to the dynamics of a…
We investigate in this work a versatile convex framework for multiple image segmentation, relying on the regularized optimal mass transport theory. In this setting, several transport cost functions are considered and used to match…
We propose a numerical method to find the optimal transport map between a measure supported on a lower-dimensional subset of R^d and a finitely supported measure. More precisely, the source measure is assumed to be supported on a simplex…
This paper presents a multiscale approach to efficiently compute approximate optimal transport plans between point sets. It is particularly well-suited for point sets that are in high-dimensions, but are close to being intrinsically…
A recent paper by Cordero-Erausquin and Klartag provides a characterization of the measures $\mu$ on $\R^d$ which can be expressed as the moment measures of suitable convex functions $u$, i.e. are of the form $(\nabla u)\_\\#e^{- u}$ for…
We formulate and solve a class of finite-time transport and mixing problems in the set-oriented framework. The aim is to obtain optimal discrete-time perturbations in nonlinear dynamical systems to transport a specified initial measure on…
We propose a new colour transfer method with Optimal Transport (OT) to transfer the colour of a sourceimage to match the colour of a target image of the same scene that may exhibit large motion changes betweenimages. By definition OT does…
The paper considers existence results of solution for a linear coupled system of Boltzmann transport equations and related inverse problem. The system models the evolution of three species of particles, photons, electrons and positrons.…