On the null space property of l_q-minimization for 0 < q 1 in compressed sensing
Summary: The paper discusses the relationship between the null space property (NSP) and the \(l_q\)-minimization in compressed sensing. Several versions of the null space property, that is, the \(l_q\) stable NSP, the \(l_q\) robust NSP, and the \(l_{q,p}\) robust NSP for \(0<p\leq q<1\) based on the standard \(l_q\) NSP, are proposed, and their equivalent forms are derived. Consequently, reconstruction results for the \(l_q\)-minimization can be derived easily under the NSP condition and its equivalent form. Finally, the \(l_q\) NSP is extended to the \(l_q\)-synthesis modeling and the mixed \(l_2/l_q\)-minimization, which deals with the dictionary-based sparse signals and the block sparse signals, respectively.
- The null space property for sparse recovery from multiple measurement vectors
- The gap between the null space property and the restricted isometry property
- Perturbations of measurement matrices and dictionaries in compressed sensing
- An improved condition of sparse signal reconstruction via \({l_1}\)-\({l_2}\) norm minimization
- Recovery analysis for weighted mixed \(\ell_2 / \ell_p\) minimization with \(0 < p \leq 1\)
- A generalized uncertainty principle and sparse representation in pairs of bases
- A mathematical introduction to compressive sensing
- A null space analysis of the _1-synthesis method in dictionary-based compressed sensing
- A remark on compressed sensing
- Analysis versus synthesis in signal priors
- Block sparse recovery via mixed l₂/l₁ minimization
- Block-Sparse Recovery via Convex Optimization
- Block-Sparse Signals: Uncertainty Relations and Efficient Recovery
- Compressed sensing
- Compressed sensing and best \(k\)-term approximation
- Compressed Sensing and Redundant Dictionaries
- Compressed sensing of color images
- Compressed sensing with coherent and redundant dictionaries
- Compressed sensing with coherent tight frames via \(l_q\)-minimization for \(0 < q \leq 1\)
- Compressed Sensing With General Frames via Optimal-Dual-Based $\ell _{1}$-Analysis
- Compressed sensing: a survey
- Decoding by Linear Programming
- Highly sparse representations from dictionaries are unique and independent of the sparseness measure
- scientific article; zbMATH DE number 42054 (Why is no real title available?)
- Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
- New bounds for RIC in compressed sensing
- New bounds on the restricted isometry constant \(\delta _{2k}\)
- On the Reconstruction of Block-Sparse Signals With an Optimal Number of Measurements
- Perturbations of measurement matrices and dictionaries in compressed sensing
- Recovery of sparsest signals via \(\ell^q \)-minimization
- Restricted Isometry Constants Where $\ell ^{p}$ Sparse Recovery Can Fail for $0≪ p \leq 1$
- Robust Recovery of Signals From a Structured Union of Subspaces
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- Shifting Inequality and Recovery of Sparse Signals
- Sparse and redundant representations. From theory to applications in signal and image processing.
- Sparse Approximate Solutions to Linear Systems
- Sparse recovery by non-convex optimization - instance optimality
- Sparse representations in unions of bases
- Sparsest solutions of underdetermined linear systems via \( \ell _q\)-minimization for \(0<q\leqslant 1\)
- The benefit of group sparsity
- The Gelfand widths of \(\ell_p\)-balls for \(0 < p \leq 1\)
- The null space property for sparse recovery from multiple measurement vectors
- The restricted isometry property and its implications for compressed sensing
- Uncertainty principles and ideal atomic decomposition
- 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
- The gap between the null space property and the restricted isometry property
- A null-space-based weightedl1minimization approach to compressed sensing
- 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
- Null space property for compressed sensing with frames via \(l_q\) (\(0< q \le 1\)) synthesis
- A wonderful triangle in compressed sensing
- High-order block RIP for nonconvex block-sparse compressed sensing
This page was built for publication: On the null space property of \(l_q\)-minimization for \(0 < q \leq 1\) in compressed sensing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q492558)
