Towards a Mathematical Theory of Super-Resolution
Emmanuel Candes, Carlos Fernandez-Granda

TL;DR
This paper establishes a mathematical framework for super-resolution, demonstrating that exact recovery of point sources from low-frequency Fourier samples is possible via convex optimization, with robustness to noise and extensions to higher dimensions.
Contribution
It introduces a convex optimization approach for super-resolution that guarantees exact recovery under certain conditions, extending previous results and analyzing noise robustness.
Findings
Exact super-resolution is achievable with infinite precision when sources are sufficiently separated.
Recovery can be formulated as a semidefinite program, enabling practical computation.
The method is robust to noise and applicable in higher dimensions.
Abstract
This paper develops a mathematical theory of super-resolution. Broadly speaking, super-resolution is the problem of recovering the fine details of an object---the 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 and with unknown complex-valued amplitudes. We only observe Fourier samples of this object up until a frequency cut-off . 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 . This result extends to higher dimensions and other models. In one dimension for instance, it is possible to…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
