Concentration of \(S\)-largest mutilated vectors with \(\ell_p\)-quasinorm for \(0
From MaRDI portal
Publication:2449220
DOI10.1016/j.amc.2012.07.015zbMath1288.94014OpenAlexW2069771091WikidataQ58201564 ScholiaQ58201564MaRDI QIDQ2449220
Publication date: 7 May 2014
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2012.07.015
compressive sensing\(S\)-largest mutilated vectorconcentration with \(l_p\)-quasinormexact recovery via (\(l_p\)) minimizationnull space of sensing matrixrestricted isometry constant \(\delta_S(\Phi)\)
Computing methodologies for image processing (68U10) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)
Cites Work
- The residual method for regularizing ill-posed problems
- Near-ideal model selection by \(\ell _{1}\) minimization
- The restricted isometry property and its implications for compressed sensing
- A note on guaranteed sparse recovery via \(\ell_1\)-minimization
- Sparsest solutions of underdetermined linear systems via \( \ell _q\)-minimization for \(0<q\leqslant 1\)
- Compressed sensing by inverse scale space and curvelet thresholding
- The Dantzig selector: statistical estimation when \(p\) is much larger than \(n\). (With discussions and rejoinder).
- Restricted isometry properties and nonconvex compressive sensing
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- Decoding by Linear Programming
- Recovery of Short, Complex Linear Combinations Via<tex>$ell _1$</tex>Minimization
- Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
- Shifting Inequality and Recovery of Sparse Signals
- New Bounds for Restricted Isometry Constants
- For most large underdetermined systems of linear equations the minimal 𝓁1‐norm solution is also the sparsest solution
- Stable signal recovery from incomplete and inaccurate measurements
- Compressed sensing
