On the null space property of \(l_q\)-minimization for \(0 < q \leq 1\) in compressed sensing
From MaRDI portal
Publication:492558
DOI10.1155/2015/579853zbMath1366.94099WikidataQ57895504 ScholiaQ57895504MaRDI QIDQ492558
Yi Gao, Yuan Zhao, Shi-Gang Yue, Ji-Gen Peng
Publication date: 20 August 2015
Published in: Journal of Function Spaces (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2015/579853
Related Items
Robust recovery of a kind of weighted l1-minimization without noise level, Recovery of low-rank matrices based on the rank null space properties, The null space property of the weighted ℓr − ℓ1 minimization, Analysis of the equivalence relationship between \(l_{0}\)-minimization and \(l_{p}\)-minimization, A new bound on the block restricted isometry constant in compressed sensing
Cites Work
- Unnamed Item
- A mathematical introduction to compressive sensing
- Block sparse recovery via mixed \(l_2/l_1\) minimization
- Recovery of sparsest signals via \(\ell^q \)-minimization
- Perturbations of measurement matrices and dictionaries in compressed sensing
- New bounds for RIC in compressed sensing
- Compressed sensing with coherent tight frames via \(l_q\)-minimization for \(0 < q \leq 1\)
- The null space property for sparse recovery from multiple measurement vectors
- Compressed sensing with coherent and redundant dictionaries
- The Gelfand widths of \(\ell_p\)-balls for \(0 < p \leq 1\)
- New bounds on the restricted isometry constant \(\delta _{2k}\)
- A null space analysis of the \(\ell_1\)-synthesis method in dictionary-based compressed sensing
- Highly sparse representations from dictionaries are unique and independent of the sparseness measure
- The restricted isometry property and its implications for compressed sensing
- A remark on compressed sensing
- Sparse recovery by non-convex optimization - instance optimality
- The benefit of group sparsity
- Sparsest solutions of underdetermined linear systems via \( \ell _q\)-minimization for \(0<q\leqslant 1\)
- Compressed sensing of color images
- Compressed sensing and best 𝑘-term approximation
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- Decoding by Linear Programming
- Sparse representations in unions of bases
- Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
- Sparse and Redundant Representations
- Compressed Sensing and Redundant Dictionaries
- Uncertainty principles and ideal atomic decomposition
- On the Reconstruction of Block-Sparse Signals With an Optimal Number of Measurements
- Block-Sparse Signals: Uncertainty Relations and Efficient Recovery
- Shifting Inequality and Recovery of Sparse Signals
- Block-Sparse Recovery via Convex Optimization
- A generalized uncertainty principle and sparse representation in pairs of bases
- Sparse Approximate Solutions to Linear Systems
- Robust Recovery of Signals From a Structured Union of Subspaces
- Restricted Isometry Constants Where $\ell ^{p}$ Sparse Recovery Can Fail for $0≪ p \leq 1$
- Compressed sensing: a survey
- Compressed Sensing With General Frames via Optimal-Dual-Based $\ell _{1}$-Analysis
- Analysis versus synthesis in signal priors
- Compressed sensing