Hierarchical compressed sensing
From MaRDI portal
Abstract: Compressed sensing is a paradigm within signal processing that provides the means for recovering structured signals from linear measurements in a highly efficient manner. Originally devised for the recovery of sparse signals, it has become clear that a similar methodology would also carry over to a wealth of other classes of structured signals. In this work, we provide an overview over the theory of compressed sensing for a particularly rich family of such signals, namely those of hierarchically structured signals. Examples of such signals are constituted by blocked vectors, with only few non-vanishing sparse blocks. We present recovery algorithms based on efficient hierarchical hard-thresholding. The algorithms are guaranteed to converge, in a stable fashion both with respect to measurement noise as well as to model mismatches, to the correct solution provided the measurement map acts isometrically restricted to the signal class. We then provide a series of results establishing the required condition for large classes of measurement ensembles. Building upon this machinery, we sketch practical applications of this framework in machine-type communications and quantum tomography.
Recommendations
Cites work
- scientific article; zbMATH DE number 5223994 (Why is no real title available?)
- A mathematical introduction to compressive sensing
- Blind Deconvolution Meets Blind Demixing: Algorithms and Performance Bounds
- Breaking the coherence barrier: a new theory for compressed sensing
- C-HiLasso: A Collaborative Hierarchical Sparse Modeling Framework
- CoSaMP: Iterative signal recovery from incomplete and inaccurate samples
- Compressed sensing with local structure: uniform recovery guarantees for the sparsity in levels class
- Decoding by Linear Programming
- Greed is Good: Algorithmic Results for Sparse Approximation
- Guarantees of Riemannian optimization for low rank matrix recovery
- Hard thresholding pursuit algorithms: number of iterations
- Hard thresholding pursuit: an algorithm for compressive sensing
- Hierarchical isometry properties of hierarchical measurements
- Iterative thresholding for sparse approximations
- Jointly low-rank and bisparse recovery: questions and partial answers
- Low-rank matrix completion by Riemannian optimization
- Model-Based Compressive Sensing
- NP-hardness and inapproximability of sparse PCA
- Painless breakups -- efficient demixing of low rank matrices
- Quantum cryptography
- Quantum tomography via compressed sensing: error bounds, sample complexity and efficient estimators
- Reliable Recovery of Hierarchically Sparse Signals for Gaussian and Kronecker Product Measurements
- Robust Recovery of Signals From a Structured Union of Subspaces
- Sparse solutions to underdetermined Kronecker product systems
- Subspace Pursuit for Compressive Sensing Signal Reconstruction
Cited in
(3)
This page was built for publication: Hierarchical compressed sensing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2106467)
