Compressed Sensing off the Grid
arXiv:1207.6053
Abstract
We consider the problem of estimating the frequency components of a mixture of s complex sinusoids from a random subset of n regularly spaced samples. Unlike previous work in compressed sensing, the frequencies are not assumed to lie on a grid, but can assume any values in the normalized frequency domain [0,1]. We propose an atomic norm minimization approach to exactly recover the unobserved samples. We reformulate this atomic norm minimization as an exact semidefinite program. Even with this continuous dictionary, we show that most sampling sets of size O(s log s log n) are sufficient to guarantee the exact frequency estimation with high probability, provided the frequencies are well separated. Numerical experiments are performed to illustrate the effectiveness of the proposed method.
47 pages, 16 figures. Modified Section 2.2 on frequency localization via convex programming duality. Minor typos corrected
References in corpus (1)
Cited by in corpus (13)
- Joint Sparse Recovery Method for Compressed Sensing with Structured Dictionary Mismatches
- Super-Resolution Compressed Sensing: An Iterative Reweighted Algorithm for Joint Parameter Learning and Sparse Signal Recovery
- Compressive parameter estimation in AWGN
- Near Minimax Line Spectral Estimation
- Super-resolution, Extremal Functions and the Condition Number of Vandermonde Matrices
- Precise Semidefinite Programming Formulation of Atomic Norm Minimization for Recovering d-Dimensional () Off-the-Grid Frequencies
- Super-Resolution from Short-Time Fourier Transform Measurements
- Off-The-Grid Spectral Compressed Sensing With Prior Information
- An Inexact Proximal Path-Following Algorithm for Constrained Convex Minimization
- Spectral Compressive Sensing with Model Selection
- An Algorithm for Exact Super-resolution and Phase Retrieval
- Joint Sparsity Recovery for Spectral Compressed Sensing
- Sparse regularization for fiber ODF reconstruction: from the suboptimality of and priors to