Compressed sensing with coherent tight frames via \(l_q\)-minimization for \(0 < q \leq 1\)
From MaRDI portal
Publication:479885
DOI10.3934/ipi.2014.8.761zbMath1366.94114arXiv1105.3299MaRDI QIDQ479885
Publication date: 5 December 2014
Published in: Inverse Problems and Imaging (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1105.3299
coherence; tight frames; sparse recovery; compressed sensing; \(D\)-restricted isometry property; \(l_q\)-minimization
94A12: Signal theory (characterization, reconstruction, filtering, etc.)
42C15: General harmonic expansions, frames
Related Items
Performance analysis for unconstrained analysis based approaches*, Recovery analysis for block ℓp − ℓ1 minimization with prior support information, Stable recovery of sparse signals with coherent tight frames via lp-analysis approach, Compressed data separation via unconstrained l1-split analysis, On the null space property of \(l_q\)-minimization for \(0 < q \leq 1\) in compressed sensing, Sparse recovery with coherent tight frames via analysis Dantzig selector and analysis LASSO, Iterative re-weighted least squares algorithm for \(l_p\)-minimization with tight frame and \(0 < p \leq 1\), Optimal RIP bounds for sparse signals recovery via \(\ell_p\) minimization, Optimal \(D\)-RIP bounds in compressed sensing, Improved RIP conditions for compressed sensing with coherent tight frames
Uses Software
Cites Work
- Recovery of sparsest signals via \(\ell^q \)-minimization
- Compressed sensing with coherent and redundant dictionaries
- New bounds on the restricted isometry constant \(\delta _{2k}\)
- A note on the complexity of \(L _{p }\) minimization
- The restricted isometry property and its implications for compressed sensing
- CoSaMP: Iterative signal recovery from incomplete and inaccurate samples
- 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
- Restricted isometry properties and nonconvex compressive sensing
- On sparse reconstruction from Fourier and Gaussian measurements
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- Decoding by Linear Programming
- Greed is Good: Algorithmic Results for Sparse Approximation
- Compressed Sensing and Redundant Dictionaries
- Iteratively reweighted least squares minimization for sparse recovery
- Shifting Inequality and Recovery of Sparse Signals
- Sparse Approximate Solutions to Linear Systems
- Matching pursuits with time-frequency dictionaries
- Restricted Isometry Constants Where $\ell ^{p}$ Sparse Recovery Can Fail for $0≪ p \leq 1$
- New Bounds for Restricted Isometry Constants
- Stable signal recovery from incomplete and inaccurate measurements
- Compressed sensing
