Regularized Wasserstein Means Based on Variational Transportation

12/02/2018
by   Liang Mi, et al.
0

We raise the problem of regularizing Wasserstein means and propose several terms tailored to tackle different problems. Our formulation is based on variational transportation to distribute a sparse discrete measure into the target domain without mass splitting. The resulting sparse representation well captures the desired property of the domain while maintaining a small reconstruction error. We demonstrate the scalability and robustness of our method with examples of domain adaptation and skeleton layout.

READ FULL TEXT
research
06/23/2018

Variational Wasserstein Clustering

We propose a new clustering method based on optimal transportation. We s...
research
02/24/2020

Variational Wasserstein Barycenters for Geometric Clustering

We propose to compute Wasserstein barycenters (WBs) by solving for Monge...
research
10/14/2019

Wasserstein Distance Guided Cross-Domain Learning

Domain adaptation aims to generalise a high-performance learner on targe...
research
11/15/2018

Theoretical Perspective of Deep Domain Adaptation

Deep domain adaptation has recently undergone a big success. Compared wi...
research
03/09/2015

A Smoothed Dual Approach for Variational Wasserstein Problems

Variational problems that involve Wasserstein distances have been recent...
research
11/25/2020

Wasserstein k-means with sparse simplex projection

This paper presents a proposal of a faster Wasserstein k-means algorithm...
research
11/24/2020

Spatiotemporal Imaging with Diffeomorphic Optimal Transportation

We propose a variational model with diffeomorphic optimal transportation...

Please sign up or login with your details

Forgot password? Click here to reset