Compressed Sensing and Parallel Acquisition

Abstract

Parallel acquisition systems arise in various applications in order to moderate problems caused by insufficient measurements in single-sensor systems. These systems allow simultaneous data acquisition in multiple sensors, thus alleviating such problems by providing more overall measurements. In this work we consider the combination of compressed sensing with parallel acquisition. We establish the theoretical improvements of such systems by providing recovery guarantees for which, subject to appropriate conditions, the number of measurements required per sensor decreases linearly with the total number of sensors. Throughout, we consider two different sampling scenarios -- distinct (corresponding to independent sampling in each sensor) and identical (corresponding to dependent sampling between sensors) -- and a general mathematical framework that allows for a wide range of sensing matrices (e.g., subgaussian random matrices, subsampled isometries, random convolutions and random Toeplitz matrices). We also consider not just the standard sparse signal model, but also the so-called sparse in levels signal model. This model includes both sparse and distributed signals and clustered sparse signals. As our results show, optimal recovery guarantees for both distinct and identical sampling are possible under much broader conditions on the so-called sensor profile matrices (which characterize environmental conditions between a source and the sensors) for the sparse in levels model than for the sparse model. To verify our recovery guarantees we provide numerical results showing phase transitions for a number of different multi-sensor environments.

43 pages, 4 figures

References in corpus (4)

• Sparsity and Incoherence in Compressive Sampling
• Structured Compressed Sensing: From Theory to Applications
• Optimal Sparse Recovery for Multi-Sensor Measurements
• Sparsity and Parallel Acquisition: Optimal Uniform and Nonuniform Recovery Guarantees

Cited by in corpus (14)

• Deep BCD-Net Using Identical Encoding-Decoding CNN Structures for Iterative Image Recovery
• Compressed sensing with sparse corruptions: Fault-tolerant sparse collocation approximations
• Convolutional Analysis Operator Learning: Acceleration and Convergence
• The benefits of acting locally: Reconstruction algorithms for sparse in levels signals with stable and robust recovery guarantees
• On oracle-type local recovery guarantees in compressed sensing
• Generalized sparse Bayesian learning and application to image reconstruction
• Momentum-Net: Fast and convergent iterative neural network for inverse problems
• Uniform Recovery from Subgaussian Multi-Sensor Measurements
• Optimal Sparse Recovery for Multi-Sensor Measurements
• Compressed sensing with local structure: uniform recovery guarantees for the sparsity in levels class
• Sparsity and Parallel Acquisition: Optimal Uniform and Nonuniform Recovery Guarantees
• Local sparsity and recovery of fusion frames structured signals
• Compressive Hermite interpolation: sparse, high-dimensional approximation from gradient-augmented measurements
• Exclusive Group Lasso for Structured Variable Selection