A new bound on the block restricted isometry constant in compressed sensing
From MaRDI portal
Publication:2400748
Recommendations
- Deterministic bounds for restricted isometry in compressed sensing matrices
- A generalization of the restricted isometry property and applications to compressed sensing
- The restricted isometry property and its implications for compressed sensing
- Restricted isometry properties and nonconvex compressive sensing
- New Bounds for Restricted Isometry Constants
- Estimation of block sparsity in compressive sensing
- A strong restricted isometry property, with an application to phaseless compressed sensing
- New bounds for RIC in compressed sensing
- The Computational Complexity of the Restricted Isometry Property, the Nullspace Property, and Related Concepts in Compressed Sensing
- Restricted \(p\)-isometry property and its application for nonconvex compressive sensing
Cites work
- A generalized uncertainty principle and sparse representation in pairs of bases
- A mathematical introduction to compressive sensing
- A simple proof of the restricted isometry property for random matrices
- 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 of color images
- Decoding by Linear Programming
- scientific article; zbMATH DE number 42054 (Why is no real title available?)
- Input selection and shrinkage in multiresponse linear regression
- Model-Based Compressive Sensing
- Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
- New Bounds for Restricted Isometry Constants With Coherent Tight Frames
- New bounds on the restricted isometry constant \(\delta _{2k}\)
- On the null space property of \(l_q\)-minimization for \(0 < q \leq 1\) in compressed sensing
- On the Reconstruction of Block-Sparse Signals With an Optimal Number of Measurements
- Robust Recovery of Signals From a Structured Union of Subspaces
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- Sharp sufficient conditions for stable recovery of block sparse signals by block orthogonal matching pursuit
- Sparse Approximate Solutions to Linear Systems
- Sparse representations in unions of bases
- The restricted isometry property and its implications for compressed sensing
- Uncertainty principles and ideal atomic decomposition
Cited in
(13)- Analysis of the equivalence relationship between \(l_{0}\)-minimization and \(l_{p}\)-minimization
- The restricted isometry property of block diagonal matrices for group-sparse signal recovery
- Group sparse recovery in impulsive noise via alternating direction method of multipliers
- Convergence and stability analysis of iteratively reweighted least squares for noisy block sparse recovery
- An Analysis of Block Sampling Strategies in Compressed Sensing
- Block sparse recovery via mixed l₂/l₁ minimization
- Block-sparse compressed sensing with redundant tight frames via \({\ell_2}/{\ell_1}\)-minimization
- Weighted \(l_p- l_1\) minimization methods for block sparse recovery and rank minimization
- Block-sparse recovery and rank minimization using a weighted \(l_p-l_q\) model
- New bounds on the restricted isometry constant \(\delta _{2k}\)
- High-order block RIP for nonconvex block-sparse compressed sensing
- Iteratively reweighted least squares for block sparse signal recovery with unconstrained \(l_{2,p}\) minimization
- A new recovery analysis of block orthogonal greedy algorithm
This page was built for publication: A new bound on the block restricted isometry constant in compressed sensing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2400748)
