A multiscale approach to optimal transport

Abstract : In this paper, we propose an improvement of an algorithm of Aurenhammer, Hoffmann and Aronov to find a least square matching between a probability density and finite set of sites with mass constraints, in the Euclidean plane. Our algorithm exploits the multiscale nature of this optimal transport problem. We iteratively simplify the target using Lloyd's algorithm, and use the solution of the simplified problem as a rough initial solution to the more complex one. This approach allows for fast estimation of distances between measures related to optimal transport (known as Earth-mover or Wasserstein distances). We also discuss the implementation of these algorithms, and compare the original one to its multiscale counterpart.
Document type :
Journal articles
Computer Graphics Forum, Wiley, 2011, 30 (5), pp.1584-1592. <10.1111/j.1467-8659.2011.02032.x>
Liste complète des métadonnées


https://hal.archives-ouvertes.fr/hal-00604684
Contributor : Quentin Mérigot <>
Submitted on : Wednesday, June 29, 2011 - 3:15:46 PM
Last modification on : Friday, June 5, 2015 - 1:32:03 PM
Document(s) archivé(s) le : Monday, November 12, 2012 - 9:51:58 AM

File

opttransport-preprint.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

Quentin Mérigot. A multiscale approach to optimal transport. Computer Graphics Forum, Wiley, 2011, 30 (5), pp.1584-1592. <10.1111/j.1467-8659.2011.02032.x>. <hal-00604684>

Share

Metrics

Record views

663

Document downloads

952