Towards a Mathematical Theory of Super‐resolution

Abstract

This paper develops a mathematical theory of super-resolution. Broadly speaking, super-resolution is the problem of recovering the fine details of an objectthe high end of its spectrum-from coarse scale information only-from samples at the low end of the spectrum. Suppose we have many point sources at unknown locations in OE0; 1 and with unknown complex-valued amplitudes. We only observe Fourier samples of this object up to a frequency cutoff f c . We show that one can super-resolve these point sources with infinite precision-i.e., recover the exact locations and amplitudes-by solving a simple convex optimization problem, which can essentially be reformulated as a semidefinite program. This holds provided that the distance between sources is at least 2=f c . This result extends to higher dimensions and other models. In one dimension, for instance, it is possible to recover a piecewise smooth function by resolving the discontinuity points with infinite precision as well. We also show that the theory and methods are robust to noise. In particular, in the discrete setting we develop some theoretical results explaining how the accuracy of the super-resolved signal is expected to degrade when both the noise level and the super-resolution factor vary.

Exact Recovery of Dirac Ensembles from the Projection Onto Spaces of Spherical Harmonics

“…We show that under an appropriate separation condition on the unknown locations of the Diracs, the ensemble can be recovered through Total Variation norm minimization. The proof of the uniqueness of the solution uses the method of 'dual' interpolating polynomials and is based on [8], where the theory was developed for trigonometric polynomials. We also show that in the special case of non-negative ensembles, a sparsity condition is sufficient for exact recovery.…”

Compressive Sensing Theory for Optical Systems Described by a Continuous Model

“…Here and below E denotes the expected value 13 The similar relationship exists in the 2D case. Let f j = ∆ j f which satisfy the linear constraint…”

Optimal switching control design for polynomial systems: an LMI approach

“…Therefore, an LMI relaxation of an optimal switching control problem with n states and m controls will be solved in O(d 9 2 (n+m+1) ) operations when solved with the general formulation of [28] and O(m 3 2 d 9 2 (n+1) ) when solved with structured formulation (10). That is a n+1 n+m+1 reduction of the polynomial rate at which the CPU time grows with relaxation orders.…”