Improved RIP conditions for compressed sensing with coherent tight frames
From MaRDI portal
Publication:2403862
DOI10.1155/2017/4372080zbMath1412.94102OpenAlexW2615170379WikidataQ57829560 ScholiaQ57829560MaRDI QIDQ2403862
Publication date: 12 September 2017
Published in: Discrete Dynamics in Nature and Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2017/4372080
Cites Work
- Recovery of sparsest signals via \(\ell^q \)-minimization
- Compressed sensing with coherent tight frames via \(l_q\)-minimization for \(0 < q \leq 1\)
- Compressed sensing with coherent and redundant dictionaries
- Non-convex sparse regularisation
- A simple proof of the restricted isometry property for random matrices
- Sharp RIP bound for sparse signal and low-rank matrix recovery
- Sparse recovery with coherent tight frames via analysis Dantzig selector and analysis LASSO
- Optimal \(D\)-RIP bounds in compressed sensing
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- Decoding by Linear Programming
- Stable recovery of sparse overcomplete representations in the presence of noise
- Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
- Compressed Sensing and Redundant Dictionaries
- New Bounds for Restricted Isometry Constants With Coherent Tight Frames
- Compressed Sensing and Affine Rank Minimization Under Restricted Isometry
- Sparse Approximate Solutions to Linear Systems
- 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
- Analysis versus synthesis in signal priors
- Compressed sensing
This page was built for publication: Improved RIP conditions for compressed sensing with coherent tight frames
