The restricted isometry property for random block diagonal matrices
From MaRDI portal
(Redirected from Publication:466970)
Abstract: In Compressive Sensing, the Restricted Isometry Property (RIP) ensures that robust recovery of sparse vectors is possible from noisy, undersampled measurements via computationally tractable algorithms. It is by now well-known that Gaussian (or, more generally, sub-Gaussian) random matrices satisfy the RIP under certain conditions on the number of measurements. Their use can be limited in practice, however, due to storage limitations, computational considerations, or the mismatch of such matrices with certain measurement architectures. These issues have recently motivated considerable effort towards studying the RIP for structured random matrices. In this paper, we study the RIP for block diagonal measurement matrices where each block on the main diagonal is itself a sub-Gaussian random matrix. Our main result states that such matrices can indeed satisfy the RIP but that the requisite number of measurements depends on certain properties of the basis in which the signals are sparse. In the best case, these matrices perform nearly as well as dense Gaussian random matrices, despite having many fewer nonzero entries.
Recommendations
- A strong restricted isometry property, with an application to phaseless compressed sensing
- Compressed sensing: how sharp is the restricted isometry property?
- The restricted isometry property and its implications for compressed sensing
- Compressed sensing with restricted isometry property
- Restricted isometries for partial random circulant matrices
Cites work
- scientific article; zbMATH DE number 49190 (Why is no real title available?)
- A numerical exploration of compressed sampling recovery
- Alternating direction algorithms for \(\ell_1\)-problems in compressive sensing
- Analysis of Orthogonal Matching Pursuit Using the Restricted Isometry Property
- CoSaMP: Iterative signal recovery from incomplete and inaccurate samples
- Compressed sensing with coherent and redundant dictionaries
- Compressed sensing: how sharp is the restricted isometry property?
- Compressive sampling
- Compressive sensing and structured random matrices
- Concentration of Measure for Block Diagonal Matrices With Applications to Compressive Signal Processing
- Deterministic constructions of compressed sensing matrices
- Deterministic matrices matching the compressed sensing phase transitions of Gaussian random matrices
- Fast and Efficient Compressive Sensing Using Structurally Random Matrices
- Generalized power method for sparse principal component analysis
- Improved bounds on restricted isometry constants for Gaussian matrices
- Neighborliness of randomly projected simplices in high dimensions
- New and Improved Johnson–Lindenstrauss Embeddings via the Restricted Isometry Property
- Observed universality of phase transitions in high-dimensional geometry, with implications for modern data analysis and signal processing
- On sparse reconstruction from Fourier and Gaussian measurements
- Phase transitions for greedy sparse approximation algorithms
- Recovery of sparse signals using OMP and its variants: convergence analysis based on RIP
- Restricted isometries for partial random circulant matrices
- Sparse nonnegative solution of underdetermined linear equations by linear programming
- Sparse recovery algorithms: sufficient conditions in terms of restricted isometry constants
- Stable Takens' Embeddings for Linear Dynamical Systems
- Suprema of chaos processes and the restricted isometry property
- The Generic Chaining
- The restricted isometry property and its implications for compressed sensing
- Toeplitz Compressed Sensing Matrices With Applications to Sparse Channel Estimation
Cited in
(22)- The gap between the null space property and the restricted isometry property
- Compressive sensing with redundant dictionaries and structured measurements
- Restoring definiteness via shrinking, with an application to correlation matrices with a fixed block
- Group projected subspace pursuit for block sparse signal reconstruction: convergence analysis and applications
- Robust sparse recovery with sparse Bernoulli matrices via expanders
- Signal recovery and system calibration from multiple compressive Poisson measurements
- Compressive sensing and structured random matrices
- The road to deterministic matrices with the restricted isometry property
- Restricted isometry property for matrices whose entries are random variables belonging to some Orlicz spaces \(L_U(\Omega)\)
- Compressed sensing with restricted isometry property
- The restricted isometry property of block diagonal matrices for group-sparse signal recovery
- Short-term memory capacity in networks via the restricted isometry property
- Influences of preconditioning on the mutual coherence and the restricted isometry property of Gaussian/Bernoulli measurement matrices
- The Restricted Isometry Property for Banded Random Matrices
- On the strong restricted isometry property of Bernoulli random matrices
- Optimal sampling algorithms for block matrix multiplication
- Uniform recovery from subgaussian multi-sensor measurements
- A generalization of the restricted isometry property and applications to compressed sensing
- Restricted isometry property for random matrices with heavy-tailed columns
- scientific article; zbMATH DE number 2208582 (Why is no real title available?)
- A strong restricted isometry property, with an application to phaseless compressed sensing
- Generalized notions of sparsity and restricted isometry property. II: Applications
This page was built for publication: The restricted isometry property for random block diagonal matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q466970)
