Approximation of Wasserstein distance with Transshipment

arXiv1901.09400MaRDI QIDQ6313124FDOQ6313124

Authors: Nicolas Papadakis 

Publication date: 27 January 2019

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.

This page was built for publication: Approximation of Wasserstein distance with Transshipment

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6313124)