Wasserstein K-Means for Clustering Tomographic Projections
Not on the map. Why?
Abstract (arXiv)
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 (L2) 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 L2 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.
Key facts. Cited by 6 papers in the map (data through 7 Oct 2026). First posted on arXiv 20 Oct 2020.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2022: 1; 2023: 1; 2024: 0; 2025: 3; 2026: 1.
6 papers.
- 2023Alignment of Density Maps in Wasserstein Distancecited by 8
- 2022Asymptotic Theory of Geometric and Adaptive k-Means Clusteringcited by 4
- 2025Fast rigid alignment of heterogeneous images in sliced Wasserstein distancecited by 4
- 2025Quantization-based Bounds on the Wasserstein Metriccited by 0
- 2025Quantifying the noise sensitivity of the Wasserstein metric for imagescited by 0
- 2026On the stability of scale-space metricscited by 0
- 2026On the stability of scale-space metrics25 Jun 2026
- 2025Quantifying the noise sensitivity of the Wasserstein metric for images1 Oct 2025
- 2025Quantization-based Bounds on the Wasserstein Metric1 Jun 2025
- 2025Fast rigid alignment of heterogeneous images in sliced Wasserstein distance17 Mar 2025
- 2023Alignment of Density Maps in Wasserstein Distance21 May 2023
- 2022Asymptotic Theory of Geometric and Adaptive k-Means Clustering27 Feb 2022