Measurement Bounds for Sparse Signal Ensembles via Graphical Models

Abstract

In compressive sensing, a small collection of linear projections of a sparse signal contains enough information to permit signal recovery. Distributed compressive sensing (DCS) extends this framework by defining ensemble sparsity models, allowing a correlated ensemble of sparse signals to be jointly recovered from a collection of separately acquired compressive measurements. In this paper, we introduce a framework for modeling sparse signal ensembles that quantifies the intra- and inter-signal dependencies within and among the signals. This framework is based on a novel bipartite graph representation that links the sparse signal coefficients with the measurements obtained for each signal. Using our framework, we provide fundamental bounds on the number of noiseless measurements that each sensor must collect to ensure that the signals are jointly recoverable.

11 pages, 2 figures

References in corpus (1)

• Reduce and Boost: Recovering Arbitrary Sets of Jointly Sparse Vectors

Cited by in corpus (8)

• OMP Based Joint Sparsity Pattern Recovery Under Communication Constraints
• Classification and Reconstruction of High-Dimensional Signals from Low-Dimensional Features in the Presence of Side Information
• Performance Limits for Noisy Multi-Measurement Vector Problems
• Operational Rate-Distortion Performance of Single-source and Distributed Compressed Sensing
• Conditioning of Random Block Subdictionaries with Applications to Block-Sparse Recovery and Regression
• Performance Limits with Additive Error Metrics in Noisy Multi-Measurement Vector Problem
• Joint recovery algorithms using difference of innovations for distributed compressed sensing
• Distributed Coding of Quantized Random Projections