Search

In synchronization problems, the goal is to estimate elements of a group from noisy measurements of their ratios. A popular estimation method for synchronization is the spectral method. It extracts the group elements from eigenvectors of a block matrix formed from the measurements. The eigenvectors must be projected, or 'rounded', onto the group. The rounding procedures are constructed ad hoc and increasingly so when applied to synchronization problems over non-compact groups. In this paper, we develop a spectral approach to synchronization over the non-compact group |$\mathrm{SE}(3)$|⁠ , the group of rigid motions of |$\mathbb{R}^{3}$|⁠. We based our method on embedding |$\mathrm{SE}(3)$| into the algebra of dual quaternions, which has deep algebraic connections with the group |$\mathrm{SE}(3)$|⁠. These connections suggest a natural rounding procedure considerably more straightforward than the current state of the art for spectral |$\mathrm{SE}(3)$| synchronization, which uses a matrix embedding of |$\mathrm{SE}(3)$|⁠. We show by numerical experiments that our approach yields comparable results with the current state of the art in |$\mathrm{SE}(3)$| synchronization via the spectral method. Thus, our approach reaps the benefits of the dual quaternion embedding of |$\mathrm{SE}(3)$| while yielding estimators of similar quality. [ABSTRACT FROM AUTHOR]

We study super-resolution multi-reference alignment, the problem of estimating a signal from many circularly shifted, down-sampled and noisy observations. We focus on the low SNR regime, and show that a signal in |${\mathbb{R}}^M$| is uniquely determined when the number |$L$| of samples per observation is of the order of the square root of the signal's length (⁠|$L=O(\sqrt{M})$|⁠). Phrased more informally, one can square the resolution. This result holds if the number of observations is proportional to |$1/\textrm{SNR}^3$|⁠. In contrast, with fewer observations recovery is impossible even when the observations are not down-sampled (⁠|$L=M$|⁠). The analysis combines tools from statistical signal processing and invariant theory. We design an expectation-maximization algorithm and demonstrate that it can super-resolve the signal in challenging SNR regimes. [ABSTRACT FROM AUTHOR]

We study the ubiquitous super-resolution problem, in which one aims at localizing positive point sources in an image, blurred by the point spread function of the imaging device. To recover the point sources, we propose to solve a convex feasibility program, which simply finds a non-negative Borel measure that agrees with the observations collected by the imaging device. In the absence of imaging noise, we show that solving this convex program uniquely retrieves the point sources, provided that the imaging device collects enough observations. This result holds true if the point spread function of the imaging device can be decomposed into horizontal and vertical components and if the translations of these components form a Chebyshev system, i.e. a system of continuous functions that loosely behave like algebraic polynomials. Building upon the recent results for one-dimensional signals, we prove that this super-resolution algorithm is stable, in the generalized Wasserstein metric, to model mismatch (i.e. when the image is not sparse) and to additive imaging noise. In particular, the recovery error depends on the noise level and how well the image can be approximated with well-separated point sources. As an example, we verify these claims for the important case of a Gaussian point spread function. The proofs rely on the construction of novel interpolating polynomials—which are the main technical contribution of this paper—and partially resolve the question raised in Schiebinger et al. (2017, Inf. Inference, 7 , 1–30) about the extension of the standard machinery to higher dimensions. [ABSTRACT FROM AUTHOR]