Compressed Sensing Off the Grid
From MaRDI portal
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.
Cited in
(91)- Approximating sampled sinusoids and multiband signals using multiband modulated DPSS dictionaries
- A study on off-grid issue in DOA and frequency estimations
- A theory of super-resolution from short-time Fourier transform measurements
- Robust sparse signal reconstructions against basis mismatch and their applications
- Norm-minimized scattering data from intensity spectra
- Exact matrix completion based on low rank Hankel structure in the Fourier domain
- Stable separation and super-resolution of mixture models
- Fixed-point algorithms for frequency estimation and structured low rank approximation
- Fast and provable algorithms for spectrally sparse signal reconstruction via low-rank Hankel matrix completion
- Super-resolution of positive sources on an arbitrarily fine grid
- Line spectrum representation for vector processes with application to frequency estimation
- A penalized method of alternating projections for weighted low-rank Hankel matrix optimization
- Angular scattering function estimation using deep neural networks
- Coarray interpolation for joint DOD and DOA estimation in bistatic coprime MIMO radar via decoupled atomic norm minimization
- Noisy tensor completion via the sum-of-squares hierarchy
- Sparse optimization on measures with over-parameterized gradient descent
- Blind three dimensional deconvolution via convex optimization
- Atomic norm minimization for decomposition into complex exponentials and optimal transport in Fourier domain
- Gridless DOA estimation for minimum-redundancy linear array in nonuniform noise
- On the linear convergence rates of exchange and continuous methods for total variation minimization
- Gridless super-resolution sparse recovery for non-sidelooking STAP using reweighted atomic norm minimization
- Spectral compressive sensing
- Super-resolution by means of Beurling minimal extrapolation
- Testing Gaussian process with applications to super-resolution
- Parameter estimation of discrete-time sinusoidal signals: a nonlinear control approach
- Multi-kernel unmixing and super-resolution using the modified matrix pencil method
- Superresolution 2D DOA estimation for a rectangular array via reweighted decoupled atomic norm minimization
- Sensor calibration for off-the-grid spectral estimation
- Approximate support recovery of atomic line spectral estimation: a tale of resolution and precision
- Sparse continuous-field and super-resolution method for direction-of-arrival estimation
- High-dimensional change-point estimation: combining filtering with convex optimization
- On gridless sparse methods for multi-snapshot direction of arrival estimation
- Generalized notions of sparsity and restricted isometry property. II: Applications
- Sparse non-negative super-resolution -- simplified and stabilised
- When does OMP achieve exact recovery with continuous dictionaries?
- The geometry of off-the-grid compressed sensing
- Super-resolution of positive sources: the discrete setup
- Robust recovery of stream of pulses using convex optimization
- Adventures in compressive sensing based MIMO radar
- A class of deterministic sensing matrices and their application in harmonic detection
- An introduction to compressed sensing
- Compressed sensing, sparse inversion, and model mismatch
- Multicompartment magnetic resonance fingerprinting
- Sampling the Fourier transform along radial lines
- Projected nonlinear least squares for exponential fitting
- Adapting to unknown noise level in sparse deconvolution
- Super-resolution of point sources via convex programming
- Super-resolution radar
- Spectral Compressed Sensing via Projected Gradient Descent
- Super-resolution from noisy data
- Semidefinite representations of gauge functions for structured low-rank matrix decomposition
- The basins of attraction of the global minimizers of the non-convex sparse spike estimation problem
- A sampling theorem for deconvolution in two dimensions
- A fast homotopy algorithm for gridless sparse recovery
- Generalized sampling and infinite-dimensional compressed sensing
- Non-convex matrix completion and related problems via strong duality
- On representer theorems and convex regularization
- Sparse inverse problems over measures: equivalence of the conditional gradient and exchange methods
- A Convex Approach to Superresolution and Regularization of Lines in Images
- On the role of total variation in compressed sensing
- The alternating descent conditional gradient method for sparse inverse problems
- One-bit gridless DOA estimation with multiple measurements exploiting accelerated proximal gradient algorithm
- Manifold separation-based DOA estimation for nonlinear arrays via compressed super-resolution of positive sources
- A note on spike localization for line spectrum estimation
- Structured Gradient Descent for Fast Robust Low-Rank Hankel Matrix Completion
- Convex and Nonconvex Optimization Are Both Minimax-Optimal for Noisy Blind Deconvolution Under Random Designs
- On strong basins of attractions for non-convex sparse spike estimation: upper and lower bounds
- Separation-free spectral super-resolution via convex optimization
- Reweighted covariance fitting based on nonconvex Schatten-p minimization for gridless direction of arrival estimation
- A super-resolution DOA estimation method for fast-moving targets in MIMO radar
- Effectiveness of the tail-atomic norm in gridless spectrum estimation
- Off-the-grid prediction and testing for linear combination of translated features
- New low-rank optimization model and algorithms for spectral compressed sensing
- Multichannel frequency estimation with constant amplitude via convex structured low-rank approximation
- Localization of point scatterers via sparse optimization on measures
- A mathematical theory of super-resolution and two-point resolution
- Improved resolution estimate for the two-dimensional super-resolution and a new algorithm for direction of arrival estimation with uniform rectangular array
- A sparse reconstruction algorithm based on constrained inhomogeneous grid optimization
- Robust adaptive beamforming via virtual interpolation-based atomic norm minimization
- Mathematical foundation of sparsity-based multi-snapshot spectral estimation
- SCAN-MUSIC: an efficient super-resolution algorithm for large-scale single snapshot line spectral estimation
- Line spectral analysis using the G-filter: an atomic norm minimization approach
- Super-resolved Lasso
- Grid is good. Adaptive refinement algorithms for off-the-grid total variation minimization
- Optimal regularization for a data source
- Letter to the editor. The general tail-atomic norm for gridless spectral estimations-II
- Effective regions and kernels in continuous sparse regularization, with application to sketched mixtures
- Optimality of gradient-MUSIC for spectral estimation
- Off-Grid Point-Scatterer Localization from Sparse Limited-Aperture Data via Hankel Completion
- Robust recovery of complex exponential signals from random Gaussian projections via low rank Hankel matrix reconstruction
- MUSIC for single-snapshot spectral estimation: stability and super-resolution
This page was built for publication: Compressed Sensing Off the Grid
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5346266)
