Alignment of Density Maps in Wasserstein Distance

05/21/2023
by   Amit Singer, et al.
0

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.

READ FULL TEXT
research
03/02/2021

Wasserstein GANs Work Because They Fail (to Approximate the Wasserstein Distance)

Wasserstein GANs are based on the idea of minimising the Wasserstein dis...
research
09/17/2023

CryoAlign: feature-based method for global and local 3D alignment of EM density maps

Advances on cryo-electron imaging technologies have led to a rapidly inc...
research
07/04/2023

Stability Analysis Framework for Particle-based Distance GANs with Wasserstein Gradient Flow

In this paper, we investigate the training process of generative network...
research
06/01/2023

Hinge-Wasserstein: Mitigating Overconfidence in Regression by Classification

Modern deep neural networks are prone to being overconfident despite the...
research
10/20/2020

Wasserstein K-Means for Clustering Tomographic Projections

Motivated by the 2D class averaging problem in single-particle cryo-elec...
research
07/31/2021

Two-sample goodness-of-fit tests on the flat torus based on Wasserstein distance and their relevance to structural biology

This work is motivated by the study of local protein structure, which is...

Please sign up or login with your details

Forgot password? Click here to reset