Mathematics – Optimization and Control
Scientific paper
2009-02-20
SIAM J. Appl. Math. Volume 70, Issue 7, pp. 2239-2258 (2010)
Mathematics
Optimization and Control
Added affiliation for the third author in arXiv metadata; no change in the source. AMS-LaTeX, 20 pages, 5 figures (pgf/TiKZ an
Scientific paper
10.1137/090772708
Consider the problem of optimally matching two measures on the circle, or equivalently two periodic measures on the real line, and suppose the cost of matching two points satisfies the Monge condition. We introduce a notion of locally optimal transport plan, motivated by the weak KAM (Aubry-Mather) theory, and show that all locally optimal transport plans are conjugate to shifts and that the cost of a locally optimal transport plan is a convex function of a shift parameter. This theory is applied to a transportation problem arising in image processing: for two sets of point masses on the circle, both of which have the same total mass, find an optimal transport plan with respect to a given cost function satisfying the Monge condition. In the circular case the sorting strategy fails to provide a unique candidate solution and a naive approach requires a quadratic number of operations. For the case of $N$ real-valued point masses we present an O(N |log epsilon|) algorithm that approximates the optimal cost within epsilon; when all masses are integer multiples of 1/M, the algorithm gives an exact solution in O(N log M) operations.
Delon Julie
Salomon Julien
Sobolevskii Andrei
No associations
LandOfFree
Fast transport optimization for Monge costs on the circle does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Fast transport optimization for Monge costs on the circle, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Fast transport optimization for Monge costs on the circle will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-670899