Alignment of Density Maps in Wasserstein Distance
Not on the map. Why?
Abstract (arXiv)
In this paper we propose an algorithm for aligning three-dimensional objects when represented as density maps, motivated by applications in cryogenic electron microscopy. The algorithm is based on minimizing the 1-Wasserstein distance between the density maps after a rigid transformation. The induced loss function enjoys a more benign landscape than its Euclidean counterpart and Bayesian optimization is employed for computation. Numerical experiments show improved accuracy and efficiency over existing algorithms on the alignment of real protein molecules. In the context of aligning heterogeneous pairs, we illustrate a potential need for new distance functions.
Key facts. Cited by 8 papers in the map (data through 14 Oct 2026). Builds on 13 of its 42 references that are in the map. First posted on arXiv 21 May 2023.
Builds on
13 of 42 references.
References · 13
- 2013Sinkhorn Distances: Lightspeed Computation of Optimal Transportation Distancescited by 2,316
- 2018A Tutorial on Bayesian Optimizationcited by 744
- 2018Gaussian Processes and Kernel Methods: A Review on Connections and Equivalencescited by 192
- 2013Manopt, a Matlab toolbox for optimization on manifoldscited by 113
- 2016Pymanopt: A Python Toolbox for Optimization on Manifolds using Automatic Differentiationcited by 94
- 2021Geometry-aware Bayesian Optimization in Robotics using Riemannian Mat'ern Kernelscited by 24
- 2022Wassmap: Wasserstein Isometric Mapping for Image Manifold Learningcited by 15
- 2020Manifold learning with arbitrary normscited by 10
- 2019Earthmover-based manifold learning for analyzing molecular conformation spacescited by 8
- 2020Centering noisy images with application to cryo-EMcited by 7
- 2022AlignOT: An optimal transport based algorithm for fast 3D alignment with applications to cryogenic electron microscopy density mapscited by 7
- 2020Wasserstein K-Means for Clustering Tomographic Projectionscited by 6
1 more
Built on by
Citing papers per year: 2023: 1; 2024: 1; 2025: 4; 2026: 2.
8 papers.
- 2024Enhancing Gaussian Process Surrogates for Optimization and Posterior Approximation via Random Explorationcited 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
- 2026On the stability of scale-space metricscited by 0
- 2026Cluster-Aware Matching via Laplacian Optimal Transportcited by 0
- 2026Cluster-Aware Matching via Laplacian Optimal Transport17 Jul 2026
- 2026On the stability of scale-space metrics25 Jun 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
- 2024Enhancing Gaussian Process Surrogates for Optimization and Posterior Approximation via Random Exploration30 Jan 2024
- 2023Robust Point Matching with Distance Profiles19 Dec 2023