BLOOMP

swMATH6454MaRDI QIDQ18563

No author found.

Described by source

• Coherence Pattern–Guided Compressive Sensing with Unresolved Grids

Related Items (27)

Global testing against sparse alternatives in time-frequency analysis ⋮ Point source super-resolution via non-convex \(L_1\) based methods ⋮ 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 ⋮ On gridless sparse methods for multi-snapshot direction of arrival estimation ⋮ Generalized sparse recovery model and its neural dynamical optimization method for compressed sensing ⋮ Exact support recovery for sparse spikes deconvolution ⋮ Approximating sampled sinusoids and multiband signals using multiband modulated DPSS dictionaries ⋮ MUSIC for single-snapshot spectral estimation: stability and super-resolution ⋮ Atomic norm minimization for decomposition into complex exponentials and optimal transport in Fourier domain ⋮ Guaranteed sparse signal recovery with highly coherent sensing matrices ⋮ Multiple-prespecified-dictionary sparse representation for compressive sensing image reconstruction with nonconvex regularization ⋮ 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 ⋮ A super-resolution direction of arrival estimation algorithm for coprime array via sparse Bayesian learning inference ⋮ Analysis of sparse MIMO radar ⋮ Sensor calibration for off-the-grid spectral estimation ⋮ Imaging with highly incomplete and corrupted data ⋮ ℓ ₁ − αℓ ₂ 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

This page was built for software: BLOOMP