International audienceThis article details two approaches to compute barycenters of measures using 1-D Wasserstein distances along radial projections of the input measures. The first me- thod makes use of the Radon transform of the measures, and the second is the solution of a convex optimization problem over the space of measures. We show several properties of these barycenters and explain their relationship. We show numerical approximation schemes based on a discrete Radon transform and on the resolution of a non-convex optimization problem. We explore the respective merits and drawbacks of each approach on applications to two image processing problems: color transfer and texture mixing
The concept of barycenter in the Wasserstein space corresponds to define a notion of Fréchet mean of...
In this paper numerical methods of computing distances between two Radon mea-sures on R are discusse...
Many variants of the Wasserstein distance have been introduced to reduce its original computational ...
International audienceThis article details two approaches to compute barycenters of measures using 1...
the date of receipt and acceptance should be inserted later Abstract This article details two approa...
This paper proposes a new definition of the averaging of discrete probability distributions as a bar...
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...
We present new algorithms to compute the mean of a set of N empirical probability measures under the...
This paper deals with the reconstruction of a discrete measure γ Z on R d from the knowledge of its ...
The Sliced Wasserstein (SW) distance has become a popular alternative to the Wasserstein distance fo...
This paper presents primal heuristics for the computation of Wasserstein Barycenters of a given set ...
Sliced Wasserstein (SW) distance has been widely used in different application scenarios since it ca...
This paper presents a family of generative Linear Programming models that permit to compute the exac...
The concept of barycenter in the Wasserstein space corresponds to define a notion of Fréchet mean of...
In this paper numerical methods of computing distances between two Radon mea-sures on R are discusse...
Many variants of the Wasserstein distance have been introduced to reduce its original computational ...
International audienceThis article details two approaches to compute barycenters of measures using 1...
the date of receipt and acceptance should be inserted later Abstract This article details two approa...
This paper proposes a new definition of the averaging of discrete probability distributions as a bar...
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...
We present new algorithms to compute the mean of a set of N empirical probability measures under the...
This paper deals with the reconstruction of a discrete measure γ Z on R d from the knowledge of its ...
The Sliced Wasserstein (SW) distance has become a popular alternative to the Wasserstein distance fo...
This paper presents primal heuristics for the computation of Wasserstein Barycenters of a given set ...
Sliced Wasserstein (SW) distance has been widely used in different application scenarios since it ca...
This paper presents a family of generative Linear Programming models that permit to compute the exac...
The concept of barycenter in the Wasserstein space corresponds to define a notion of Fréchet mean of...
In this paper numerical methods of computing distances between two Radon mea-sures on R are discusse...
Many variants of the Wasserstein distance have been introduced to reduce its original computational ...