Corpus ID: 235731736

# Unbiasing Procedures for Scale-invariant Multi-reference Alignment

@article{Hirn2021UnbiasingPF,
title={Unbiasing Procedures for Scale-invariant Multi-reference Alignment},
author={Matthew J. Hirn and Anna V. Little},
journal={ArXiv},
year={2021},
volume={abs/2107.01274}
}
• Published 2021
• Computer Science, Engineering, Mathematics
• ArXiv
This article discusses a generalization of the 1dimensional multi-reference alignment problem. The goal is to recover a hidden signal from many noisy observations, where each noisy observation includes a random translation and random dilation of the hidden signal, as well as high additive noise. We propose a method that recovers the power spectrum of the hidden signal by applying a data-driven, nonlinear unbiasing procedure, and thus the hidden signal is obtained up to an unknown phase. An… Expand

#### References

SHOWING 1-10 OF 37 REFERENCES
Multireference Alignment Is Easier With an Aperiodic Translation Distribution
• Mathematics, Computer Science
• IEEE Transactions on Information Theory
• 2019
It is shown that in the low SNR regime, in the same regime the sample complexity for any aperiodic translation distribution scales as <inline-formula> <tex-math notation="LaTeX">$\omega (1/ \mathrm {SNR}^{2})$ </tex-Math></inline- formula>. Expand
Bispectrum Inversion With Application to Multireference Alignment
• Computer Science, Medicine
• IEEE Transactions on Signal Processing
• 2018
This work considers the problem of estimating a signal from noisy circularly translated versions of itself, called multireference alignment, and proposes and analyzes a method based on estimating the signal directly, using features of the signal that are invariant under translations. Expand
Optimal rates of estimation for multi-reference alignment
• Mathematics, Computer Science
• 2017
In this paper, we establish optimal rates of adaptive estimation of a vector in the multi-reference alignment model, a problem with important applications in fields such as signal processing, imageExpand
Shift- and rotation-invariant object reconstruction using the bispectrum
• Computer Science, Physics
• 1992
Recursive and least-squares fast-Fourier-transform-based algorithms for reconstructing a two-dimensional discrete Fourier transform from the bispectrum are reviewed in detail and results presented include application of the method to a sequence of infrared images. Expand
Angular Synchronization by Eigenvectors and Semidefinite Programming.
• A. Singer
• Mathematics, Medicine
• Applied and computational harmonic analysis
• 2011
An efficient recovery algorithm for the unknown angles from the top eigenvector of a specially designed Hermitian matrix is introduced and extensions of the eigen vector method are presented to other synchronization problems that involve different group structures and their applications, such as the time synchronization problem in distributed networks. Expand
Multireference alignment using semidefinite programming
• Mathematics, Computer Science
• ITCS
• 2014
This work provides a semidefinite program (SDP) based relaxation which approximates the maximum likelihood estimator (MLE) for the multireference alignment problem and shows that if certain positivity constraints in the relaxation are dropped, its solution becomes equivalent to performing phase correlation. Expand
Message-passing algorithms for synchronization problems over compact groups
• Computer Science, Mathematics
• ArXiv
• 2016
This work presents an efficient iterative algorithm to solve a large class of synchronization problems over compact groups, allowing for any compact group, with measurements on multiple 'frequency channels' (Fourier modes, or more generally, irreducible representations of the group). Expand
Translation, rotation and scaling invariant object and texture classification using polyspectra
• Mathematics
• 1990
The problem addressed in this paper is the detection and classification of deterministic objects and random textures in a noisy scene. An energy detector is developed in the cumulant domain, byExpand
Nonconvex Phase Synchronization
Under similar but more restrictive conditions, it is shown that a modified version of the power method converges to the global optimum, which is simpler and faster than convex approaches. Expand
The Projected Power Method: An Efficient Algorithm for Joint Alignment from Pairwise Differences
• Mathematics, Computer Science
• ArXiv
• 2016
It is proved that for a broad class of statistical models, the proposed projected power method makes no error---and hence converges to the maximum likelihood estimate---in a suitable regime. Expand