A Sparse Multiscale Algorithm for Dense Optimal Transport

Abstract : Discrete optimal transport solvers do not scale well on dense large problems since they do not explicitly exploit the geometric structure of the cost function. In analogy to continuous optimal transport, we provide a framework to verify global optimality of a discrete transport plan locally. This allows the construction of an algorithm to solve large dense problems by considering a sequence of sparse problems instead. The algorithm lends itself to being combined with a hierarchical multiscale scheme. Any existing discrete solver can be used as internal black-box. We explicitly describe how to select the sparse sub-problems for several cost functions, including the noisy squared Euclidean distance. Significant reductions in run-time and memory requirements have been observed.
Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-01385274
Contributor : Bernhard Schmitzer <>
Submitted on : Friday, October 21, 2016 - 11:01:55 AM
Last modification on : Thursday, April 26, 2018 - 10:28:35 AM

Links full text

Identifiers

Collections

Citation

Bernhard Schmitzer. A Sparse Multiscale Algorithm for Dense Optimal Transport. Journal of Mathematical Imaging and Vision, Springer Verlag, 2016, ⟨10.1007/s10851-016-0653-9⟩. ⟨hal-01385274⟩

Share

Metrics

Record views

490