Hierarchical compressed sensing
From MaRDI portal
Publication:2106467
DOI10.1007/978-3-031-09745-4_1zbMATH Open1504.94035arXiv2104.02721OpenAlexW3147979839MaRDI QIDQ2106467FDOQ2106467
Authors: Jens Eisert, Axel Flinth, Ingo Roth, Gerhard Wunder, Benedict H. Gross 
Publication date: 14 December 2022
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.
Full work available at URL: https://arxiv.org/abs/2104.02721
Recommendations
Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Biomedical imaging and signal processing (92C55)
Cites Work
- C-HiLasso: A Collaborative Hierarchical Sparse Modeling Framework
- Title not available (Why is that?)
- Decoding by Linear Programming
- CoSaMP: Iterative signal recovery from incomplete and inaccurate samples
- A mathematical introduction to compressive sensing
- Greed is Good: Algorithmic Results for Sparse Approximation
- Quantum cryptography
- Iterative thresholding for sparse approximations
- Low-rank matrix completion by Riemannian optimization
- Subspace Pursuit for Compressive Sensing Signal Reconstruction
- Quantum tomography via compressed sensing: error bounds, sample complexity and efficient estimators
- Model-Based Compressive Sensing
- Hard thresholding pursuit: an algorithm for compressive sensing
- Robust Recovery of Signals From a Structured Union of Subspaces
- Breaking the coherence barrier: a new theory for compressed sensing
- Hierarchical isometry properties of hierarchical measurements
- Hard thresholding pursuit algorithms: number of iterations
- Guarantees of Riemannian optimization for low rank matrix recovery
- Sparse solutions to underdetermined Kronecker product systems
- Blind Deconvolution Meets Blind Demixing: Algorithms and Performance Bounds
- Painless breakups -- efficient demixing of low rank matrices
- Compressed sensing with local structure: uniform recovery guarantees for the sparsity in levels class
- NP-hardness and inapproximability of sparse PCA
- Reliable Recovery of Hierarchically Sparse Signals for Gaussian and Kronecker Product Measurements
- Jointly low-rank and bisparse recovery: questions and partial answers
Cited In (3)
Uses Software
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)
