Approximation of Wasserstein distance with Transshipment
Idioma
en
Document de travail - Pré-publication
Resumen en inglés
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 ...Leer más >
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.< Leer menos
Proyecto europeo
Nonlocal Methods for Arbitrary Data Sources
Proyecto ANR
Generalized Optimal Transport Models for Image processing - ANR-16-CE33-0010
Orígen
Importado de HalCentros de investigación