Uniform recovery from subgaussian multi-sensor measurements
From MaRDI portal
Publication:2300757
Abstract: Parallel acquisition systems are employed successfully in a variety of different sensing applications when a single sensor cannot provide enough measurements for a high-quality reconstruction. In this paper, we consider compressed sensing (CS) for parallel acquisition systems when the individual sensors use subgaussian random sampling. Our main results are a series of uniform recovery guarantees which relate the number of measurements required to the basis in which the solution is sparse and certain characteristics of the multi-sensor system, known as sensor profile matrices. In particular, we derive sufficient conditions for optimal recovery, in the sense that the number of measurements required per sensor decreases linearly with the total number of sensors, and demonstrate explicit examples of multi-sensor systems for which this holds. We establish these results by proving the so-called Asymmetric Restricted Isometry Property (ARIP) for the sensing system and use this to derive both nonuniversal and universal recovery guarantees. Compared to existing work, our results not only lead to better stability and robustness estimates but also provide simpler and sharper constants in the measurement conditions. Finally, we show how the problem of CS with block-diagonal sensing matrices can be viewed as a particular case of our multi-sensor framework. Specializing our results to this setting leads to a recovery guarantee that is at least as good as existing results.
Recommendations
- Nonuniform sparse recovery with subgaussian matrices
- Compressed sensing: how sharp is the restricted isometry property?
- An introduction to compressed sensing
- Compressed sensing with local structure: uniform recovery guarantees for the sparsity in levels class
- Uniform recovery of fusion frame structured sparse signals
Cites work
- Breaking the coherence barrier: a new theory for compressed sensing
- Compressed sensing with local structure: uniform recovery guarantees for the sparsity in levels class
- Concentration of Measure for Block Diagonal Matrices With Applications to Compressive Signal Processing
- Deterministic matrices matching the compressed sensing phase transitions of Gaussian random matrices
- Exact Feature Extraction Using Finite Rate of Innovation Principles With an Application to Image Super-Resolution
- Graph implementations for nonsmooth convex programs
- Robust multi-image processing with optimal sparse regularization
- Sparse Representation of a Polytope and Recovery of Sparse Signals and Low-Rank Matrices
- Sparsest solutions of underdetermined linear systems via \( \ell _q\)-minimization for \(0<q\leqslant 1\)
- Structured Compressed Sensing: From Theory to Applications
- Suprema of chaos processes and the restricted isometry property
- The Generic Chaining
- The restricted isometry property for random block diagonal matrices
Cited in
(4)
This page was built for publication: Uniform recovery from subgaussian multi-sensor measurements
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2300757)