Multilevel Optimal Transport: a Fast Approximation of Wasserstein-1 distances

09/29/2018
by   Jialin Liu, et al.
1

We propose a fast algorithm for the calculation of the Wasserstein-1 distance, which is a particular type of optimal transport distance with homogeneous of degree one ground metric. Our algorithm is built on multilevel primal-dual algorithms. Several numerical examples and complexity analysis are provided to demonstrate its computational speed. On some commonly used image examples of size 512×512, the proposed algorithm gives solutions within 0.5 seconds on a single CPU, which is much faster than the state-of-the-art algorithms.

READ FULL TEXT

page 17

page 19

page 25

page 26

page 27

research
12/22/2021

On a linear Gromov-Wasserstein distance

Gromov-Wasserstein distances are generalization of Wasserstein distances...
research
10/29/2022

Solving a Special Type of Optimal Transport Problem by a Modified Hungarian Algorithm

We observe that computing empirical Wasserstein distance in the independ...
research
11/16/2021

Ocean Mover's Distance: Using Optimal Transport for Analyzing Oceanographic Data

Modern ocean datasets are large, multi-dimensional, and inherently spati...
research
10/09/2019

Scalable Nearest Neighbor Search for Optimal Transport

The Optimal Transport (a.k.a. Wasserstein) distance is an increasingly p...
research
11/25/2020

Wasserstein k-means with sparse simplex projection

This paper presents a proposal of a faster Wasserstein k-means algorithm...
research
06/19/2019

Local Bures-Wasserstein Transport: A Practical and Fast Mapping Approximation

Optimal transport (OT)-based methods have a wide range of applications a...
research
05/30/2019

Interior-point Methods Strike Back: Solving the Wasserstein Barycenter Problem

Computing the Wasserstein barycenter of a set of probability measures un...

Please sign up or login with your details

Forgot password? Click here to reset