Afficher la notice abrégée

hal.structure.identifierInstitut de Mathématiques de Bordeaux [IMB]
dc.contributor.authorPAPADAKIS, Nicolas
dc.date.accessioned2024-04-04T03:00:18Z
dc.date.available2024-04-04T03:00:18Z
dc.identifier.urihttps://oskar-bordeaux.fr/handle/20.500.12278/192807
dc.description.abstractEnAn 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.
dc.description.sponsorshipGeneralized Optimal Transport Models for Image processing - ANR-16-CE33-0010
dc.language.isoen
dc.title.enApproximation of Wasserstein distance with Transshipment
dc.typeDocument de travail - Pré-publication
dc.subject.halInformatique [cs]/Traitement du signal et de l'image
dc.identifier.arxiv1901.09400
dc.description.sponsorshipEuropeNonlocal Methods for Arbitrary Data Sources
bordeaux.hal.laboratoriesInstitut de Mathématiques de Bordeaux (IMB) - UMR 5251*
bordeaux.institutionUniversité de Bordeaux
bordeaux.institutionBordeaux INP
bordeaux.institutionCNRS
hal.identifierhal-01997598
hal.version1
hal.origin.linkhttps://hal.archives-ouvertes.fr//hal-01997598v1
bordeaux.COinSctx_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.au=PAPADAKIS,%20Nicolas&rft.genre=preprint


Fichier(s) constituant ce document

FichiersTailleFormatVue

Il n'y a pas de fichiers associés à ce document.

Ce document figure dans la(les) collection(s) suivante(s)

Afficher la notice abrégée