Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
175 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

Two-Dimensional Super-Resolution via Convex Relaxation (1711.08239v1)

Published 22 Nov 2017 in cs.IT and math.IT

Abstract: In this paper, we address the problem of recovering point sources from two dimensional low-pass measurements, which is known as super-resolution problem. This is the fundamental concern of many applications such as electronic imaging, optics, microscopy, and line spectral estimation. We assume that the point sources are located in the square $[0,1]2$ with unknown locations and complex amplitudes. The only available information is low-pass Fourier measurements band-limited to integer square $[-f_c,f_c]2$. The signal is estimated by minimizing Total Variation $(\mathrm{TV})$ norm, which leads to a convex optimization problem. It is shown that if the sources are separated by at least $1.68/f_c$, there exist a dual certificate that is sufficient for exact recovery.

Citations (14)

Summary

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