Computer Science – Information Theory
Scientific paper
2011-02-14
Computer Science
Information Theory
19 pages, 2 figures
Scientific paper
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, allowing a correlated ensemble of sparse signals to be jointly recovered from a collection of separately acquired compressive measurements. In this paper, we introduce an ensemble sparsity model for capturing the intra- and inter-signal correlations within a collection of sparse signals. For strictly sparse signals obeying an ensemble sparsity model, we characterize the fundamental number of noiseless measurements that each sensor must collect to ensure that the signals are jointly recoverable. Our analysis is based on a novel bipartite graph representation that links the sparse signal coefficients with the measurements obtained for each signal.
Baraniuk Richard G.
Baron Dror
Duarte Marco F.
Sarvotham Shriram
Wakin Michael B.
No associations
LandOfFree
Bounds on the Reconstruction of Sparse Signal Ensembles from Distributed Measurements does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Bounds on the Reconstruction of Sparse Signal Ensembles from Distributed Measurements, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Bounds on the Reconstruction of Sparse Signal Ensembles from Distributed Measurements will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-215092