Multireference Alignment Is Easier With an Aperiodic Translation Distribution

DOI10.1109/TIT.2018.2889674MaRDI QIDQ5224017zbMATH OpenOpenAlexWikidataFDO

Authors Emmanuel Abbe, Tamir Bendory, William Leeb, João M. Pereira, Nir Sharon, A. Singer

Publication date 19 July 2019

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1710.02793

zbMATH Keywords

recovering of signal's orbitsample complexitysignal observation by action of random circular translation and addition of Gaussian noisesignal-to-noise ratio

Mathematics Subject Classification ID

Estimation in multivariate analysis (62H12) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Abstract: In the multireference alignment model, a signal is observed by the action of a random circular translation and the addition of Gaussian noise. The goal is to recover the signal's orbit by accessing multiple independent observations. Of particular interest is the sample complexity, i.e., the number of observations/samples needed in terms of the signal-to-noise ratio (the signal energy divided by the noise variance) in order to drive the mean-square error (MSE) to zero. Previous work showed that if the translations are drawn from the uniform distribution, then, in the low SNR regime, the sample complexity of the problem scales as $omega(1/ext{SNR}^3)$. In this work, using a generalization of the Chapman--Robbins bound for orbits and expansions of the $ch{i}^2$ divergence at low SNR, we show that in the same regime the sample complexity for any aperiodic translation distribution scales as $omega(1/ext{SNR}^2)$. This rate is achieved by a simple spectral algorithm. We propose two additional algorithms based on non-convex optimization and expectation-maximization. We also draw a connection between the multireference alignment problem and the spiked covariance model.

Cited in

(19)

• Rank-one multi-reference factor analysis
• Iterative algorithm for discrete structure recovery
• Optimal rates of estimation for multi-reference alignment
• Signal recovery from a few linear measurements of its high-order spectra
• Multi-target detection with rotations
• Multi-reference alignment in high dimensions: sample complexity and phase transition
• Method of moments for 3D single particle \textit{ab initio} modeling with non-uniform distribution of viewing angles
• The sample complexity of multireference alignment
• Multi-target detection with application to cryo-electron microscopy
• Likelihood landscape and maximum likelihood estimation for the discrete orbit recovery model
• Sparse multi-reference alignment: phase retrieval, uniform uncertainty principles and the beltway problem
• Toward Single Particle Reconstruction without Particle Picking: Breaking the Detection Limit
• Maximum likelihood for high-noise group orbit estimation and single-particle cryo-EM
• Power spectrum unbiasing for dilation-invariant multi-reference alignment
• Rates of estimation for high-dimensional multireference alignment
• Deep neural-network prior for orbit recovery from method of moments
• Orbit recovery for band-limited functions
• Subspace method of moments for \textit{ab initio} 3-D single particle cryo-EM reconstruction
• The reflection-invariant bispectrum: signal recovery in the dihedral model

This page was built for publication: Multireference Alignment Is Easier With an Aperiodic Translation Distribution

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5224017)