Related papers: Improving the primal-dual algorithm for the transp…
In this paper, we study the optimal transport problem induced by separable cost functions. In this framework, transportation can be expressed as the composition of two lower-dimensional movements. Through this reformulation, we prove that…
This paper considers the problem of finding a quickest path between two points in the Euclidean plane in the presence of a transportation network. A transportation network consists of a planar network where each road (edge) has an…
In this paper, we propose new techniques for solving geometric optimization problems involving interpoint distances of a point set in the plane. Given a set $P$ of $n$ points in the plane and an integer $1 \leq k \leq \binom{n}{2}$, the…
We present a primal--dual memory efficient algorithm for solving a relaxed version of the general transportation problem. Our approach approximates the original cost function with a differentiable one that is solved as a sequence of…
Given two points in the plane, and a set of "obstacles" given as curves through the plane with assigned weights, we consider the point-separation problem, which asks for the minimum-weight subset of the obstacles separating the two points.…
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…
Transportation Problem is an important problem which has been widely studied in Operations Research domain. It has been often used to simulate different real life problems. In particular, application of this Problem in NP Hard Problems has…
We extend the traditional problem of calculating the traveled distance of a fly that is moving with constant speed on a straight path between two trains that are approaching one another, we found two analytical solutions for the traditional…
In this paper we study the problem of locating a given number of hyperplanes minimizing an objective function of the closest distances from a set of points. We propose a general framework for the problem in which norm-based distances…
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…
This work originates from a heart's images tracking which is to generate an apparent continuous motion, observable through intensity variation from one starting image to an ending one both supposed segmented. Given two images $\rho_0$ and…
We propose a fast algorithm for the calculation of the Wasserstein-1 distance, which is a particular type of optimal transport distance with homogeneous of degree one transport cost. Our algorithm is built on multilevel primal-dual…
For pattern recognition like image recognition, it has become clear that each machine-learning dictionary data actually became data in probability space belonging to Euclidean space. However, the distances in the Euclidean space and the…
The purpose of this paper is to introduce a new numerical method to solve multi-marginal optimal transport problems with pairwise interaction costs. The complexity of multi-marginal optimal transport generally scales exponentially in the…
This paper defines a distance function that measures the dissimilarity between planar geometric figures formed with straight lines. This function can in turn be used in partial matching of different geometric figures. For a given pair of…
A central aspect of robotic motion planning is collision avoidance, where a multitude of different approaches are currently in use. Optimization-based motion planning is one method, that often heavily relies on distance computations between…
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…
In the geometric transportation problem, we are given a collection of points $P$ in $d$-dimensional Euclidean space, and each point is given a supply of $\mu(p)$ units of mass, where $\mu(p)$ could be a positive or a negative integer, and…
In this work, we provide faster algorithms for approximating the optimal transport distance, e.g. earth mover's distance, between two discrete probability distributions $\mu, \nu \in \Delta^n$. Given a cost function $C : [n] \times [n] \to…
Motivated by a recent Diophantine transport problem about how to transport profitably a group of persons or objects, we survey classical facts about solving systems of linear Diophantine equations and inequalities in nonnegative integers.…