Approximation of Wasserstein distance with Transshipment

Abstract : An algorithm for approximating the p-Wasserstein distance between histograms defined on unstructured discrete grids is presented. It is based on the computation of a barycenter constrained to be supported on a low dimensional subspace, which corresponds to a transshipment problem. A multi-scale strategy is also considered. The method provides sparse transport matrices and can be applied to large scale and non structured data.
Document type :
Preprints, Working Papers, ...
Liste complète des métadonnées

https://hal.archives-ouvertes.fr/hal-01997598
Contributor : Nicolas Papadakis <>
Submitted on : Tuesday, January 29, 2019 - 10:33:20 AM
Last modification on : Wednesday, January 30, 2019 - 1:24:31 AM

Links full text

Identifiers

  • HAL Id : hal-01997598, version 1
  • ARXIV : 1901.09400

Collections

IMB

Citation

Nicolas Papadakis. Approximation of Wasserstein distance with Transshipment. 2019. ⟨hal-01997598⟩

Share

Metrics

Record views

17