New bounds for RIC in compressed sensing

DOI10.1007/S40305-013-0013-ZzbMATHOpenAlexWikidataMaRDI QIDQ457549FDO

Authors Lingchen Kong, Sheng-Long Zhou, Naihua Xiu

Publication date 29 September 2014

Published in Journal of the Operations Research Society of China (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s40305-013-0013-z

zbMATH Keywords

compressed sensingboundexact recoveryrestricted isometry constant\(l_1\)-minimization

Mathematics Subject Classification ID

Convex programming (90C25) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Recommendations

• New bounds on the restricted isometry constant \(\delta _{2k}\)
• Optimal \(D\)-RIP bounds in compressed sensing
• The restricted isometry property and its implications for compressed sensing
• Improved bounds on restricted isometry constants for Gaussian matrices
• The bounds of restricted isometry constants for low rank matrices recovery

Cites work

• A note on guaranteed sparse recovery via \(\ell_1\)-minimization
• Compressed sensing
• Compressive sensing and structured random matrices
• Decoding by Linear Programming
• Deterministic Construction of Compressed Sensing Matrices via Algebraic Curves
• From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images
• New Bounds for Restricted Isometry Constants
• New bounds on the restricted isometry constant \(\delta _{2k}\)
• Restricted Isometry Constants Where $\ell ^{p}$ Sparse Recovery Can Fail for $0≪ p \leq 1$
• Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
• Sharp RIP bound for sparse signal and low-rank matrix recovery
• Shifting Inequality and Recovery of Sparse Signals
• Simple bounds for recovering low-complexity models
• Sparsest solutions of underdetermined linear systems via \( \ell _q\)-minimization for \(0<q\leqslant 1\)
• The Dantzig selector: statistical estimation when \(p\) is much larger than \(n\). (With discussions and rejoinder).
• The restricted isometry property and its implications for compressed sensing

Cited in

(15)

• Sparse recovery with coherent frames via \(\ell_{1-2}\)-analysis
• On the null space property of \(l_q\)-minimization for \(0 < q \leq 1\) in compressed sensing
• A new bound on the block restricted isometry constant in compressed sensing
• Bounds of restricted isometry constants in extreme asymptotics: formulae for Gaussian matrices
• A sharp bound on RIC in generalized orthogonal matching pursuit
• The bounds of restricted isometry constants for low rank matrices recovery
• Optimal \(D\)-RIP bounds in compressed sensing
• New bounds on the restricted isometry constant \(\delta _{2k}\)
• Improved bounds on restricted isometry constants for Gaussian matrices
• Improved bounds for restricted isometry constants
• Sparse recovery in probability via \(l_q\)-minimization with Weibull random matrices for \(0 < q\leq 1\)
• Improved RIP-based bounds for guaranteed performance of two compressed sensing algorithms
• Deterministic bounds for restricted isometry in compressed sensing matrices
• The sparsest solution to the system of absolute value equations
• A null-space-based weightedl₁minimization approach to compressed sensing

This page was built for publication: New bounds for RIC in compressed sensing

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