A hierarchical framework for recovery in compressive sensing
From MaRDI portal
Publication:1693135
DOI10.1016/j.dam.2017.10.004zbMath1431.94014OpenAlexW2768842775MaRDI QIDQ1693135
Violet R. Syrotiuk, Charles J. Colbourn, Daniel Horsley
Publication date: 11 January 2018
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2017.10.004
Combinatorics in computer science (68R05) Other designs, configurations (05B30) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A mathematical introduction to compressive sensing
- The restricted isometry property and its implications for compressed sensing
- A bound on the size of separating hash families
- Combinatorial sublinear-time Fourier algorithms
- Explicit constructions for perfect hash families
- Linear hash families and forbidden configurations
- Explicit construction of exponential sized families of k-independent sets
- Optimal linear perfect hash families
- Secure frameproof codes, key distribution patterns, group testing algorithms and related structures
- The Lovász local lemma and its applications to some combinatorial arrays
- Strengthening hash families and compressive sensing
- Sharp RIP bound for sparse signal and low-rank matrix recovery
- Deterministic constructions of compressed sensing matrices
- On generalized separating hash families
- Compressed sensing and best 𝑘-term approximation
- Optimal linear perfect hash families with small parameters
- On Sparse Representations in Arbitrary Redundant Bases
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- Decoding by Linear Programming
- Recovery of Exact Sparse Representations in the Presence of Bounded Noise
- Sparse representations in unions of bases
- Recovery of Short, Complex Linear Combinations Via<tex>$ell _1$</tex>Minimization
- Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
- Combinatorial Algorithms for Compressed Sensing
- Atomic Decomposition by Basis Pursuit
- Uncertainty principles and ideal atomic decomposition
- A generalized uncertainty principle and sparse representation in pairs of bases
- Efficient and Robust Compressed Sensing Using Optimized Expander Graphs
- Perfect Hash Families: Constructions and Existence
- The Computational Complexity of the Restricted Isometry Property, the Nullspace Property, and Related Concepts in Compressed Sensing
- Sparse Representation of a Polytope and Recovery of Sparse Signals and Low-Rank Matrices
- Compressed sensing
