Restricted \(p\)-isometry properties of partially sparse signal recovery
From MaRDI portal
Publication:1956098
DOI10.1155/2013/692169zbMath1264.94040WikidataQ58921740 ScholiaQ58921740MaRDI QIDQ1956098
Lingchen Kong, Haini Bi, Nai-Hua Xiu
Publication date: 13 June 2013
Published in: Discrete Dynamics in Nature and Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2013/692169
94A12: Signal theory (characterization, reconstruction, filtering, etc.)
Cites Work
- A note on the complexity of \(L _{p }\) minimization
- Restricted \(p\)-isometry property and its application for nonconvex compressive sensing
- Computation of sparse low degree interpolating polynomials and their application to derivative-free optimization
- Sparse recovery by non-convex optimization - instance optimality
- Sparsest solutions of underdetermined linear systems via \( \ell _q\)-minimization for \(0<q\leqslant 1\)
- Extensions of compressed sensing
- A short note on compressed sensing with partially known signal support
- Lower Bound Theory of Nonzero Entries in Solutions of $\ell_2$-$\ell_p$ Minimization
- Restricted isometry properties and nonconvex compressive sensing
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- Decoding by Linear Programming
- Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
- From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images
- Modified-CS: Modifying Compressive Sensing for Problems With Partially Known Support
- Restricted Isometry Constants Where $\ell ^{p}$ Sparse Recovery Can Fail for $0≪ p \leq 1$
- On the Performance of Sparse Recovery Via $\ell_p$-Minimization $(0 \leq p \leq 1)$