Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
166 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
42 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Super-Resolution of Positive Sources on an Arbitrarily Fine Grid (2005.06756v1)

Published 14 May 2020 in cs.IT, cs.NA, math.IT, math.NA, and math.OC

Abstract: In super-resolution it is necessary to locate with high precision point sources from noisy observations of the spectrum of the signal at low frequencies capped by f_c. In the case when the point sources are positive and are located on a grid, it has been recently established that the super-resolution problem can be solved via linear programming in a stable manner and that the method is nearly optimal in the minimax sense. The quality of the reconstruction critically depends on the Rayleigh regularity of the support of the signal; that is, on the maximum number of sources that can occur within an interval of side length about 1/f_c. This work extends the earlier result and shows that the conclusion continues to hold when the locations of the point sources are arbitrary, i.e., the grid is arbitrarily fine. The proof relies on new interpolation constructions in Fourier analysis.

Citations (15)

Summary

We haven't generated a summary for this paper yet.