2000 character limit reached
Support detection in super-resolution
Published 16 Feb 2013 in cs.IT, math.IT, math.NA, and math.OC | (1302.3921v2)
Abstract: We study the problem of super-resolving a superposition of point sources from noisy low-pass data with a cut-off frequency f. Solving a tractable convex program is shown to locate the elements of the support with high precision as long as they are separated by 2/f and the noise level is small with respect to the amplitude of the signal.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.
