Coherence Pattern–Guided Compressive Sensing with Unresolved Grids

DOI10.1137/110838509zbMath1250.65035arXiv1106.5177OpenAlexW2169892604MaRDI QIDQ2912267

Publication date: 14 September 2012

Published in: SIAM Journal on Imaging Sciences (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1106.5177

zbMATH Keywords

algorithm regularization resolution local optimization sparsity Lasso compressed sensing iterative hard thresholding orthogonal matching pursuit noise stability dynamic range basis pursuit subspace pursuit model mismatch band exclusion coherence band exclusion continuum imaging problem gridding error radar and medical imaging

Mathematics Subject Classification ID

Computing methodologies for image processing (68U10) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Related Items

Global testing against sparse alternatives in time-frequency analysis ⋮ Coherent Imaging without Phases ⋮ Point source super-resolution via non-convex $L_1$ based methods ⋮ The Noise Collector for sparse recovery in high dimensions ⋮ Stable super-resolution limit and smallest singular value of restricted Fourier matrices ⋮ Approximate super-resolution of positive measures in all dimensions ⋮ A novel regularization based on the error function for sparse recovery ⋮ Generalized sparse recovery model and its neural dynamical optimization method for compressed sensing ⋮ Exact support recovery for sparse spikes deconvolution ⋮ Adventures in Compressive Sensing Based MIMO Radar ⋮ A note on spike localization for line spectrum estimation ⋮ Study on $L_1$ over $L_2$ Minimization for nonnegative signal recovery ⋮ Approximating sampled sinusoids and multiband signals using multiband modulated DPSS dictionaries ⋮ Sorted $L_1/L_2$ minimization for sparse signal recovery ⋮ Computational Aspects of Constrained L 1-L 2 Minimization for Compressive Sensing ⋮ MUSIC for single-snapshot spectral estimation: stability and super-resolution ⋮ Atomic norm minimization for decomposition into complex exponentials and optimal transport in Fourier domain ⋮ Super-resolution from noisy data ⋮ Computing sparse representation in a highly coherent dictionary based on difference of $L_1$ and $L_2$ ⋮ Fast L1-L2 minimization via a proximal operator ⋮ Minimization of transformed $L_1$ penalty: theory, difference of convex function algorithm, and robust application in compressed sensing ⋮ Generalized sampling and infinite-dimensional compressed sensing ⋮ IDENT: identifying differential equations with numerical time evolution ⋮ Spectral compressive sensing ⋮ Towards a Mathematical Theory of Super‐resolution ⋮ A super-resolution direction of arrival estimation algorithm for coprime array via sparse Bayesian learning inference ⋮ Resolution Analysis of Imaging with $\ell_1$ Optimization ⋮ Synthetic Aperture Imaging of Direction- and Frequency-Dependent Reflectivities ⋮ A Scale-Invariant Approach for Sparse Signal Recovery ⋮ Analysis of sparse MIMO radar ⋮ Sensor calibration for off-the-grid spectral estimation ⋮ Imaging with highly incomplete and corrupted data ⋮ BLOOMP ⋮ ℓ ₁ − αℓ ₂ minimization methods for signal and image reconstruction with impulsive noise removal ⋮ A Three-Operator Splitting Algorithm for Nonconvex Sparsity Regularization ⋮ Minimization of $\ell_{1-2}$ for Compressed Sensing ⋮ Truncated $l_{1-2}$ Models for Sparse Recovery and Rank Minimization ⋮ The Dantzig selector: recovery of signal via ℓ ₁ − αℓ ₂ minimization ⋮ Greedy signal space methods for incoherence and beyond

Uses Software

CoSaMP