Wasserstein K-Means for Clustering Tomographic Projections
Rohan Rao, Amit Moscovich, Amit Singer

TL;DR
This paper introduces a Wasserstein metric-based k-means clustering algorithm for cryo-EM images, improving robustness to angular differences with minimal computational cost.
Contribution
It develops a rotationally-invariant Wasserstein k-means method that outperforms Euclidean-based clustering in cryo-EM image analysis.
Findings
Superior clustering results on synthetic cryo-EM data
Effective handling of out-of-plane angular differences
Low computational overhead with a fast approximation
Abstract
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 () 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 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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Electron Microscopy Techniques and Applications · Advanced X-ray Imaging Techniques · Electron and X-Ray Spectroscopy Techniques
