International audienceThis article defines a new way to perform intuitive and geometrically faithful regressions on histogram-valued data. It leverages the theory of optimal transport, and in particular the definition of Wasserstein barycenters, to introduce for the first time the notion of barycentric coordinates for histograms. These coordinates take into account the underlying geometry of the ground space on which the histograms are defined, and are thus particularly meaningful for applications in graphics to shapes, color or material modification. Beside this abstract construction, we propose a fast numerical optimization scheme to solve this backward problem (finding the barycentric coordinates of a given histogram) with a low computat...
This paper is concerned by statistical inference problems from a data set whose elements may be mode...
International audienceThis article details two approaches to compute barycenters of measures using 1...
This paper introduces a new class of algorithms for optimization problems involving optimal transpor...
International audienceThis article defines a new way to perform intuitive and geometrically faithful...
We present new algorithms to compute the mean of a set of empirical probability measures under the o...
We consider in this talk the inverse problem behind Wasserstein barycenters. Given a family of measu...
AMS subject classifications. 33F05, 49M99, 65D99, 90C08International audienceThis article introduces...
We present new algorithms to compute the mean of a set of N empirical probability measures under the...
This paper presents a family of generative Linear Programming models that permit to compute the exac...
18 pages, 16 figures, submitted to the Machine Learning journal (Springer)International audienceOpti...
We study the complexity of approximating Wassertein barycenter of discrete measures, or histograms b...
International audienceThis paper introduces a new class of algorithms for optimization problems invo...
As interest in graph data has grown in recent years, the computation of various geometric tools has ...
This paper is concerned by the statistical analysis of data sets whose elements are random histogram...
This article introduces a generalization of the discrete optimal transport, with applications to col...
This paper is concerned by statistical inference problems from a data set whose elements may be mode...
International audienceThis article details two approaches to compute barycenters of measures using 1...
This paper introduces a new class of algorithms for optimization problems involving optimal transpor...
International audienceThis article defines a new way to perform intuitive and geometrically faithful...
We present new algorithms to compute the mean of a set of empirical probability measures under the o...
We consider in this talk the inverse problem behind Wasserstein barycenters. Given a family of measu...
AMS subject classifications. 33F05, 49M99, 65D99, 90C08International audienceThis article introduces...
We present new algorithms to compute the mean of a set of N empirical probability measures under the...
This paper presents a family of generative Linear Programming models that permit to compute the exac...
18 pages, 16 figures, submitted to the Machine Learning journal (Springer)International audienceOpti...
We study the complexity of approximating Wassertein barycenter of discrete measures, or histograms b...
International audienceThis paper introduces a new class of algorithms for optimization problems invo...
As interest in graph data has grown in recent years, the computation of various geometric tools has ...
This paper is concerned by the statistical analysis of data sets whose elements are random histogram...
This article introduces a generalization of the discrete optimal transport, with applications to col...
This paper is concerned by statistical inference problems from a data set whose elements may be mode...
International audienceThis article details two approaches to compute barycenters of measures using 1...
This paper introduces a new class of algorithms for optimization problems involving optimal transpor...