Learning to Generate Wasserstein Barycenters - Archive ouverte HAL Access content directly
Journal Articles Journal of Mathematical Imaging and Vision Year : 2022

Learning to Generate Wasserstein Barycenters

Julien Lacombe
Julie Digne
Nicolas Bonneel


Optimal transport is a notoriously difficult problem to solve numerically, with current approaches often remaining intractable for very large scale applications such as those encountered in machine learning. Wasserstein barycenters -- the problem of finding measures in-between given input measures in the optimal transport sense -- is even more computationally demanding as it requires to solve an optimization problem involving optimal transport distances. By training a deep convolutional neural network, we improve by a factor of 60 the computational speed of Wasserstein barycenters over the fastest state-of-the-art approach on the GPU, resulting in milliseconds computational times on $512\times512$ regular grids. We show that our network, trained on Wasserstein barycenters of pairs of measures, generalizes well to the problem of finding Wasserstein barycenters of more than two measures. We demonstrate the efficiency of our approach for computing barycenters of sketches and transferring colors between multiple images.
Fichier principal
Vignette du fichier
2102.12178.pdf (20.86 Mo) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-03374452 , version 1 (12-10-2021)



Julien Lacombe, Julie Digne, Nicolas Courty, Nicolas Bonneel. Learning to Generate Wasserstein Barycenters. Journal of Mathematical Imaging and Vision, 2022, 65, pp.354-370. ⟨10.1007/s10851-022-01121-y⟩. ⟨hal-03374452⟩
97 View
44 Download



Gmail Facebook Twitter LinkedIn More