Optimal \(D\)-RIP bounds in compressed sensing

DOI10.1007/s10114-015-4234-4zbMath1366.94136OpenAlexW2022098235MaRDI QIDQ2353238

Song Li, Rui Zhang

Publication date: 8 July 2015

Published in: Acta Mathematica Sinica. English Series (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10114-015-4234-4

zbMATH Keywords

tight framescoherentcompressed sensing\(D\)-restricted isometry property

Mathematics Subject Classification ID

Signal theory (characterization, reconstruction, filtering, etc.) (94A12) General harmonic expansions, frames (42C15)

Related Items (6)

Sparse phase retrieval via ℓp (0 < p ≤ 1) minimization ⋮ Improved RIP conditions for compressed sensing with coherent tight frames ⋮ Performance analysis for unconstrained analysis based approaches* ⋮ Compressed data separation via dual frames based split-analysis with Weibull matrices ⋮ Optimal RIP bounds for sparse signals recovery via \(\ell_p\) minimization ⋮ Stable recovery of sparse signals with coherent tight frames via lp-analysis approach

Cites Work

• Perturbations of measurement matrices and dictionaries in compressed sensing
• Compressed sensing with coherent tight frames via \(l_q\)-minimization for \(0 < q \leq 1\)
• Compressed sensing with coherent and redundant dictionaries
• New bounds on the restricted isometry constant \(\delta _{2k}\)
• The restricted isometry property and its implications for compressed sensing
• Sparse recovery by non-convex optimization - instance optimality
• Sparsest solutions of underdetermined linear systems via \( \ell _q\)-minimization for \(0<q\leqslant 1\)
• A simple proof of the restricted isometry property for random matrices
• Sharp RIP bound for sparse signal and low-rank matrix recovery
• The Dantzig selector: statistical estimation when \(p\) is much larger than \(n\). (With discussions and rejoinder).
• Compressed Sensing: How Sharp Is the Restricted Isometry Property?
• Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
• Decoding by Linear Programming
• Compressed Sensing and Redundant Dictionaries
• Shifting Inequality and Recovery of Sparse Signals
• New Bounds for Restricted Isometry Constants With Coherent Tight Frames
• Restricted Isometry Constants Where $\ell ^{p}$ Sparse Recovery Can Fail for $0≪ p \leq 1$
• On Recovery of Sparse Signals Via $\ell _{1}$ Minimization
• Compressed Sensing With General Frames via Optimal-Dual-Based $\ell _{1}$-Analysis
• New Bounds for Restricted Isometry Constants
• Sparse Representation of a Polytope and Recovery of Sparse Signals and Low-Rank Matrices
• For most large underdetermined systems of linear equations the minimal 𝓁₁‐norm solution is also the sparsest solution
• Compressed sensing

This page was built for publication: Optimal \(D\)-RIP bounds in compressed sensing