Wasserstein K-Means for Clustering Tomographic Projections

10/20/2020
by   Rohan Rao, et al.
0

Motivated by the 2D class averaging problem in single-particle cryo-electron microscopy (cryo-EM), we present a k-means algorithm based on a rotationally-invariant Wasserstein metric for images. Unlike existing methods that are based on Euclidean (L_2) distances, we prove that the Wasserstein metric better accommodates for the out-of-plane angular differences between different particle views. We demonstrate on a synthetic dataset that our method gives superior results compared to an L_2 baseline. Furthermore, there is little computational overhead, thanks to the use of a fast linear-time approximation to the Wasserstein-1 metric, also known as the Earthmover's distance.

READ FULL TEXT

page 5

page 6

research
06/01/2022

Distributional Convergence of the Sliced Wasserstein Process

Motivated by the statistical and computational challenges of computing W...
research
02/24/2020

Variational Wasserstein Barycenters for Geometric Clustering

We propose to compute Wasserstein barycenters (WBs) by solving for Monge...
research
01/27/2021

Supervised Tree-Wasserstein Distance

To measure the similarity of documents, the Wasserstein distance is a po...
research
01/08/2017

A Framework for Wasserstein-1-Type Metrics

We propose a unifying framework for generalising the Wasserstein-1 metri...
research
09/30/2022

Finding NEEMo: Geometric Fitting using Neural Estimation of the Energy Mover's Distance

A novel neural architecture was recently developed that enforces an exac...
research
05/21/2023

Alignment of Density Maps in Wasserstein Distance

In this paper we propose an algorithm for aligning three-dimensional obj...
research
10/23/2018

Approximating the Quadratic Transportation Metric in Near-Linear Time

Computing the quadratic transportation metric (also called the 2-Wassers...

Please sign up or login with your details

Forgot password? Click here to reset