# Sample complexity of the boolean multireference alignment problem

@article{Abbe2017SampleCO,
title={Sample complexity of the boolean multireference alignment problem},
author={Emmanuel Abbe and Jo{\~a}o M. Pereira and Amit Singer},
journal={2017 IEEE International Symposium on Information Theory (ISIT)},
year={2017},
pages={1316-1320}
}
• Published 26 January 2017
• Computer Science
• 2017 IEEE International Symposium on Information Theory (ISIT)
The Boolean multireference alignment problem consists in recovering a Boolean signal from multiple shifted and noisy observations. In this paper we obtain an expression for the error exponent of the maximum A posteriori decoder. This expression is used to characterize the number of measurements needed for signal recovery in the low SNR regime, in terms of higher order autocorrelations of the signal. The characterization is explicit for various signal dimensions, such as prime and even…

### Multireference Alignment Is Easier With an Aperiodic Translation Distribution

• 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>.

### Heterogeneous multireference alignment: A single pass approach

• Computer Science
2018 52nd Annual Conference on Information Sciences and Systems (CISS)
• 2018
This paper proposes an algorithm which estimates the K signals without estimating either the shifts or the classes of the observations, and designs a smooth, non-convex optimization problem to compute a set of signals which are consistent with the estimated averaged features.

### The sample complexity of multi-reference alignment

• Computer Science
SIAM J. Math. Data Sci.
• 2019

### Multireference alignment using semidefinite programming

• 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.

### Fundamental Limits in Multi-Image Alignment

• Computer Science
IEEE Transactions on Signal Processing
• 2016
This work derives and analyzes the Cramér-Rao and Ziv-Zakai lower bounds under different statistical models for the underlying image, and shows the existence of different behavior zones depending on the difficulty level of the problem, given by the SNR conditions of the input images.

### Shift- and rotation-invariant object reconstruction using the bispectrum

• Computer Science
• 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.

### Shift And Rotation Invariant Object Reconstruction Using The Bispectrum

Triple correlations and their Fourier transforms, called bispectra, have properties desirable for image sequence analysis. Specifically, the triple correlation of a 2-d sequence is shift -invariant,

### Elements of Information Theory

• Computer Science
• 1991
The author examines the role of entropy, inequality, and randomness in the design of codes and the construction of codes in the rapidly changing environment.

### Lectures in Abstract Algebra : vol. III, Theory of Fields and Galois Theory. By N. Jacobson. Pp. xi, 323. 76s. (Van Nostrand)

This is an attractively written and truly elementary introduction to the theory of groups. In the first few chapters the reader is gently guided towards the group concept and, although the pace

### The Bispectrum as a Source of Phase-Sensitive Invariants for Fourier Descriptors: A Group-Theoretic Approach

• R. Kakarala
• Mathematics
Journal of Mathematical Imaging and Vision
• 2012
The main theoretical result shows that the bispectrum serves as a complete source of invariants for homogeneous spaces of compact groups, including such important domains as the sphere S2.

### Orthogonal Polynomials

In this survey, different aspects of the theory of orthogonal polynomials of one (real or complex) variable are reviewed. Orthogonal polynomials on the unit circle are not discussed.