Compressed sensing with local structure: uniform recovery guarantees for the sparsity in levels class
From MaRDI portal
Publication:2415398
Abstract: In compressed sensing, it is often desirable to consider signals possessing additional structure beyond sparsity. One such structured signal model - which forms the focus of this paper - is the local sparsity in levels class. This class has recently found applications in problems such as compressive imaging, multi-sensor acquisition systems and sparse regularization in inverse problems. In this paper we present uniform recovery guarantees for this class when the measurement matrix corresponds to a subsampled isometry. We do this by establishing a variant of the standard restricted isometry property for sparse in levels vectors, known as the restricted isometry property in levels. Interestingly, besides the usual log factors, our uniform recovery guarantees are simpler and less stringent than existing nonuniform recovery guarantees. For the particular case of discrete Fourier sampling with Haar wavelet sparsity, a corollary of our main theorem yields a new recovery guarantee which improves over the current state-of-the-art.
Recommendations
- On oracle-type local recovery guarantees in compressed sensing
- Uniform recovery in infinite-dimensional compressed sensing and applications to structured binary sampling
- On the Absence of Uniform Recovery in Many Real-World Applications of Compressed Sensing and the Restricted Isometry Property and Nullspace Property in Levels
- Structure dependent sampling in compressed sensing: theoretical guarantees for tight frames
- On the role of total variation in compressed sensing
Cites work
- A mathematical introduction to compressive sensing
- A Probabilistic and RIPless Theory of Compressed Sensing
- Breaking the coherence barrier: a new theory for compressed sensing
- Compressed sensing and matrix completion with constant proportion of corruptions
- Compressed Sensing and Parallel Acquisition
- Compressed sensing with sparse corruptions: fault-tolerant sparse collocation approximations
- Compressed sensing with structured sparsity and structured acquisition
- Compressive Imaging Using Approximate Message Passing and a Markov-Tree Prior
- Compressive sensing and structured random matrices
- Dimensionality reduction with subgaussian matrices: a unified theory
- Exploiting Structure in Wavelet-Based Bayesian Compressive Sensing
- Fundamental Performance Limits for Ideal Decoders in High-Dimensional Linear Inverse Problems
- Generalized sampling and infinite-dimensional compressed sensing
- Interpolation via weighted \(\ell_{1}\) minimization
- Model-Based Compressive Sensing
- On the Absence of Uniform Recovery in Many Real-World Applications of Compressed Sensing and the Restricted Isometry Property and Nullspace Property in Levels
- On the Theorem of Uniform Recovery of Random Sampling Matrices
- Restricted isometry of Fourier matrices and list decodability of random linear codes
- Sparse Representation of a Polytope and Recovery of Sparse Signals and Low-Rank Matrices
- Sparsity and incoherence in compressive sampling
- Stable recovery of low-dimensional cones in Hilbert spaces: one RIP to rule them all
- Structure dependent sampling in compressed sensing: theoretical guarantees for tight frames
- Structured Compressed Sensing: From Theory to Applications
- Structured random measurements in signal processing
- The quest for optimal sampling: computationally efficient, structure-exploiting measurements for compressed sensing
- Uniform recovery from subgaussian multi-sensor measurements
Cited in
(22)- Uniform recovery in infinite-dimensional compressed sensing and applications to structured binary sampling
- Structured iterative hard thresholding with on- and off-grid applications
- Hierarchical compressed sensing
- Local recovery bounds for prior support constrained compressed sensing
- Hierarchical isometry properties of hierarchical measurements
- Uniform recovery from subgaussian multi-sensor measurements
- Structure dependent sampling in compressed sensing: theoretical guarantees for tight frames
- Non-uniform recovery guarantees for binary measurements and infinite-dimensional compressed sensing
- Do log factors matter? On optimal wavelet approximation and the foundations of compressed sensing
- Breaking the coherence barrier: a new theory for compressed sensing
- Compressed sensing with sparse corruptions: fault-tolerant sparse collocation approximations
- On oracle-type local recovery guarantees in compressed sensing
- WARPd: a linearly convergent first-order primal-dual algorithm for inverse problems with approximate sharpness conditions
- The Benefits of Acting Locally: Reconstruction Algorithms for Sparse in Levels Signals With Stable and Robust Recovery Guarantees
- On the Absence of Uniform Recovery in Many Real-World Applications of Compressed Sensing and the Restricted Isometry Property and Nullspace Property in Levels
- Compressed sensing photoacoustic tomography reduces to compressed sensing for undersampled Fourier measurements
- Improved Recovery Guarantees and Sampling Strategies for TV Minimization in Compressive Imaging
- Uniform recovery guarantees for quantized corrupted sensing using structured or generative priors
- Compressed sensing with frames and sparsity in levels class
- Sparse recovery with fusion frames and bounded orthonormal systems
- Adapted variable density subsampling for compressed sensing
- Polynomial-augmented neural networks (PANNs) with weak orthogonality constraints for enhanced function and PDE approximation
This page was built for publication: Compressed sensing with local structure: uniform recovery guarantees for the sparsity in levels class
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2415398)
