Stable Recovery of Sparse Signals and an Oracle Inequality

From MaRDI portal
Publication:5281418

DOI10.1109/TIT.2010.2048506zbMath1366.94085OpenAlexW2098704159WikidataQ105584800 ScholiaQ105584800MaRDI QIDQ5281418

T. Tony Cai, Lie Wang, Guangwu Xu

Publication date: 27 July 2017

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tit.2010.2048506



Related Items

Unconstrained \(\ell_1\)-\(\ell_2\) minimization for sparse recovery via mutual coherence, Compressed data separation via unconstrained l1-split analysis, Signal recovery under cumulative coherence, Regularized sparse representation for image deconvolution, Variational multiscale nonparametric regression: smooth functions, Recovery of high-dimensional sparse signals via \(\ell_1\)-minimization, \(\ell_{1}\)-penalization for mixture regression models, Interior reconstruction in tomography via prior support constrained compressed sensing, A gradient enhanced \(\ell_{1}\)-minimization for sparse approximation of polynomial chaos expansions, Phase transition in limiting distributions of coherence of high-dimensional random matrices, On sparse recovery algorithms in unions of orthonormal bases, Limiting laws of coherence of random matrices with applications to testing covariance structure and construction of compressed sensing matrices, On the conditions used to prove oracle results for the Lasso, Robust recovery of signals with partially known support information using weighted BPDN, Necessary and sufficient conditions for the asymptotic distributions of coherence of ultra-high dimensional random matrices, Robustness of orthogonal matching pursuit under restricted isometry property, Signal recovery under mutual incoherence property and oracle inequalities, Bayesian signal detection with compressed measurements, A Gradient-Enhanced L1 Approach for the Recovery of Sparse Trigonometric Polynomials, Consistent parameter estimation for Lasso and approximate message passing, Sharp RIP bound for sparse signal and low-rank matrix recovery, Stable restoration and separation of approximately sparse signals, A sharp RIP condition for orthogonal matching pursuit, Sparse recovery via differential inclusions, On the \(\ell_1\)-norm invariant convex \(k\)-sparse decomposition of signals, Frames for compressed sensing using coherence, Structured iterative hard thresholding with on- and off-grid applications, Binary sparse signal recovery with binary matching pursuit *, Perturbation analysis of \(L_{1-2}\) method for robust sparse recovery, Local recovery bounds for prior support constrained compressed sensing