Alignment of Density Maps in Wasserstein Distance
- URL: http://arxiv.org/abs/2305.12310v2
- Date: Tue, 12 Mar 2024 02:44:18 GMT
- Title: Alignment of Density Maps in Wasserstein Distance
- Authors: Amit Singer and Ruiyi Yang
- Abstract summary: 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.
- Score: 8.140400570642438
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: 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.
Related papers
- Sequential transport maps using SoS density estimation and $α$-divergences [0.5999777817331317]
Transport-based density estimation methods are receiving growing interest because of their ability to efficiently generate samples from the approximated density.
We provide a new convergence analyses of the sequential transport maps based on information geometric properties of $alpha$-divergences.
We numerically demonstrate our methods on Bayesian inference problems and unsupervised learning tasks.
arXiv Detail & Related papers (2024-02-27T23:52:58Z) - Linearized Wasserstein dimensionality reduction with approximation
guarantees [65.16758672591365]
LOT Wassmap is a computationally feasible algorithm to uncover low-dimensional structures in the Wasserstein space.
We show that LOT Wassmap attains correct embeddings and that the quality improves with increased sample size.
We also show how LOT Wassmap significantly reduces the computational cost when compared to algorithms that depend on pairwise distance computations.
arXiv Detail & Related papers (2023-02-14T22:12:16Z) - Efficient Graph Field Integrators Meet Point Clouds [59.27295475120132]
We present two new classes of algorithms for efficient field integration on graphs encoding point clouds.
The first class, SeparatorFactorization(SF), leverages the bounded genus of point cloud mesh graphs, while the second class, RFDiffusion(RFD), uses popular epsilon-nearest-neighbor graph representations for point clouds.
arXiv Detail & Related papers (2023-02-02T08:33:36Z) - A new method for determining Wasserstein 1 optimal transport maps from
Kantorovich potentials, with deep learning applications [3.867363075280544]
Wasserstein 1 optimal transport maps provide a natural correspondence between points from two probability distributions.
We present an approach towards computing Wasserstein 1 optimal transport maps that relies only on Kantorovich potentials.
arXiv Detail & Related papers (2022-11-02T01:54:09Z) - Improved Counting and Localization from Density Maps for Object
Detection in 2D and 3D Microscopy Imaging [4.746727774540763]
We propose an alternative method to count and localize objects from the density map.
Our results show improved performance in counting and localization of objects in 2D and 3D microscopy data.
arXiv Detail & Related papers (2022-03-29T15:54:19Z) - Near-optimal estimation of smooth transport maps with kernel
sums-of-squares [81.02564078640275]
Under smoothness conditions, the squared Wasserstein distance between two distributions could be efficiently computed with appealing statistical error upper bounds.
The object of interest for applications such as generative modeling is the underlying optimal transport map.
We propose the first tractable algorithm for which the statistical $L2$ error on the maps nearly matches the existing minimax lower-bounds for smooth map estimation.
arXiv Detail & Related papers (2021-12-03T13:45:36Z) - Density-Based Clustering with Kernel Diffusion [59.4179549482505]
A naive density corresponding to the indicator function of a unit $d$-dimensional Euclidean ball is commonly used in density-based clustering algorithms.
We propose a new kernel diffusion density function, which is adaptive to data of varying local distributional characteristics and smoothness.
arXiv Detail & Related papers (2021-10-11T09:00:33Z) - Partial Wasserstein Covering [10.52782170493037]
We consider a general task called partial Wasserstein covering with the goal of emulating a large dataset.
We model this problem as a discrete optimization problem with partial Wasserstein divergence as an objective function.
We show that we can efficiently make two datasets similar in terms of partial Wasserstein divergence, including driving scene datasets.
arXiv Detail & Related papers (2021-06-02T01:48:41Z) - Learning Optical Flow from a Few Matches [67.83633948984954]
We show that the dense correlation volume representation is redundant and accurate flow estimation can be achieved with only a fraction of elements in it.
Experiments show that our method can reduce computational cost and memory use significantly, while maintaining high accuracy.
arXiv Detail & Related papers (2021-04-05T21:44:00Z) - Learning High Dimensional Wasserstein Geodesics [55.086626708837635]
We propose a new formulation and learning strategy for computing the Wasserstein geodesic between two probability distributions in high dimensions.
By applying the method of Lagrange multipliers to the dynamic formulation of the optimal transport (OT) problem, we derive a minimax problem whose saddle point is the Wasserstein geodesic.
We then parametrize the functions by deep neural networks and design a sample based bidirectional learning algorithm for training.
arXiv Detail & Related papers (2021-02-05T04:25:28Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.