AlignOT: An optimal transport based algorithm for fast 3D alignment with applications to cryogenic electron microscopy density maps
Not on the map. Why?
Abstract (arXiv)
Aligning electron density maps from Cryogenic electron microscopy (cryo-EM) is a first key step for studying multiple conformations of a biomolecule. As this step remains costly and challenging, with standard alignment tools being potentially stuck in local minima, we propose here a new procedure, called AlignOT, which relies on the use of computational optimal transport (OT) to align EM maps in 3D space. By embedding a fast estimation of OT maps within a stochastic gradient descent algorithm, our method searches for a rotation that minimizes the Wasserstein distance between two maps, represented as point clouds. We quantify the impact of various parameters on the precision and accuracy of the alignment, and show that AlignOT can outperform the standard local alignment methods, with an increased range of rotation angles leading to proper alignment. We further benchmark AlignOT on various pairs of experimental maps, which account for different types of conformational heterogeneities and geometric properties. As our experiments show good performance, we anticipate that our method can be broadly applied to align 3D EM maps.
Key facts. Cited by 7 papers in the map (data through 7 Oct 2026). First posted on arXiv 17 Oct 2022.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2023: 2; 2024: 0; 2025: 4; 2026: 1.
7 papers.
- 2023Alignment of Density Maps in Wasserstein Distancecited by 8
- 2025Fast rigid alignment of heterogeneous images in sliced Wasserstein distancecited by 4
- 2023Robust Point Matching with Distance Profilescited by 1
- 2025Quantization-based Bounds on the Wasserstein Metriccited by 0
- 2025Quantifying the noise sensitivity of the Wasserstein metric for imagescited by 0
- 2025The Joint Gromov Wasserstein Objective for Multiple Object Matchingcited by 0
- 2026Cluster-Aware Matching via Laplacian Optimal Transportcited by 0
- 2026Cluster-Aware Matching via Laplacian Optimal Transport17 Jul 2026
- 2025The Joint Gromov Wasserstein Objective for Multiple Object Matching21 Nov 2025
- 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
- 2023Robust Point Matching with Distance Profiles19 Dec 2023
- 2023Alignment of Density Maps in Wasserstein Distance21 May 2023