Restricted p-isometry property and its application for nonconvex compressive sensing

DOI10.1007/S10444-011-9219-YMaRDI QIDQ695638zbMATH OpenOpenAlexFDO

Authors M. C. Fu

Publication date 21 December 2012

Published in Advances in Computational Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

\(l_p\)-minimizationcompressed sensinginstance optimalitynonlinear approximationstability

Mathematics Subject Classification ID

Random matrices (probabilistic aspects) (60B20) Applications of mathematical programming (90C90) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Abstract: Compressed sensing is a new scheme which shows the ability to recover sparse signal from fewer measurements, using $l_1$ minimization. Recently, Chartrand and Staneva shown in cite{CS1} that the $l_p$ minimization with $0<p<1$ recovers sparse signals from fewer linear measurements than does the $l_1$ minimization. They proved that $l_p$ minimization with $0<p<1$ recovers $S$-sparse signals $xinRN$ from fewer Gaussian random measurements for some smaller $p$ with probability exceeding ${\displaystyle }$1 - 1 / {Nchoose S}.${\displaystyle }$ The first aim of this paper is to show that above result is right for the case of random,Gaussian measurements with probability exceeding $1-2e^{-c(p)M},$ where $M$ is the numbers of rows of random, Gaussian measurements and $c(p)$ is a positive constant that guarantees $1-2e^{-c(p)M}>1-1/NchooseS$ for $p$ smaller. The second purpose of the paper is to show that under certain weaker conditions, decoders $riangl{e}_p$ are stable in the sense that they are $(2,p)$ instance optimal for a large class of encoder for $0<p<1.$

Recommendations

• Restricted isometry properties and nonconvex compressive sensing
• Sparse recovery by non-convex optimization - instance optimality
• Restricted \(p\)-isometry properties of partially sparse signal recovery
• Stable recovery of sparse signals via \(\ell_p\)-minimization
• The restricted isometry property and its implications for compressed sensing

Cites work

• A note on the complexity of \(L _{p }\) minimization
• A simple proof of the restricted isometry property for random matrices
• Compressed sensing
• Compressed sensing and best \(k\)-term approximation
• Decoding by Linear Programming
• For most large underdetermined systems of linear equations the minimal 𝓁₁‐norm solution is also the sparsest solution
• Instance-optimality in probability with an \(\ell _1\)-minimization decoder
• Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
• Optimally sparse representation in general (nonorthogonal) dictionaries via ℓ ¹ minimization
• Restricted isometry properties and nonconvex compressive sensing
• Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
• Sparse recovery by non-convex optimization - instance optimality
• Sparse representations in unions of bases
• Sparsest solutions of underdetermined linear systems via \( \ell _q\)-minimization for \(0<q\leqslant 1\)
• Stability and instance optimality for Gaussian measurements in compressed sensing
• Stable signal recovery from incomplete and inaccurate measurements

Cited in

(19)

• Sparse recovery in probability via \(l_q\)-minimization with Weibull random matrices for \(0 < q\leq 1\)
• Restricted \(p\)-isometry properties of partially sparse signal recovery
• A new globally convergent algorithm for non-Lipschitz \(\ell_{p}-\ell_q\) minimization
• A reweighted nuclear norm minimization algorithm for low rank matrix recovery
• Stability and instance optimality for Gaussian measurements in compressed sensing
• Stable recovery of low rank matrices from nuclear norm minimization
• A new bound on the block restricted isometry constant in compressed sensing
• Stable recovery of low-rank matrix via nonconvex Schatten p-minimization
• l^p decoupling for restricted k-broadness
• Sparse reconstruction of Hardy signal and applications to time-frequency distribution
• Stability of \(l_q\)-analysis based dual frame with Weibull matrices for \(0<q\leq 1\)
• Restricted isometry properties and nonconvex compressive sensing
• The bounds of restricted isometry constants for low rank matrices recovery
• Recovery analysis for block _p-_1 minimization with prior support information
• Stable and robust $\ell_p$-constrained compressive sensing recovery via robust width property
• On the Absence of Uniform Recovery in Many Real-World Applications of Compressed Sensing and the Restricted Isometry Property and Nullspace Property in Levels
• High-order block RIP for nonconvex block-sparse compressed sensing
• The restricted isometry property and its implications for compressed sensing
• Sparse recovery by non-convex optimization - instance optimality

This page was built for publication: Restricted \(p\)-isometry property and its application for nonconvex compressive sensing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q695638)