DocumentCode :
21548
Title :
Measurement Bounds for Sparse Signal Ensembles via Graphical Models
Author :
Duarte, Marco F. ; Wakin, Michael B. ; Baron, Dror ; Sarvotham, S. ; Baraniuk, R.G.
Author_Institution :
Dept. of Electr. & Comput. Eng., Univ. of Massachusetts, Amherst, MA, USA
Volume :
59
Issue :
7
fYear :
2013
fDate :
Jul-13
Firstpage :
4280
Lastpage :
4289
Abstract :
In compressive sensing, a small collection of linear projections of a sparse signal contains enough information to permit signal recovery. Distributed compressive sensing 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 intersignal dependences 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.
Keywords :
compressed sensing; graph theory; noise measurement; bipartite graph representation; compressive measurement; distributed compressive sensing; ensemble sparsity model; graphical model; intersignal dependences; intrasignal dependences; linear projection; measurement bounds; noiseless measurement; signal measurement; signal recovery; sparse signal coefficient; sparse signal ensembles; Bipartite graph; Compressed sensing; Decoding; Educational institutions; Sparse matrices; Technological innovation; Vectors; Compressive sensing (CS); random projections; signal ensembles; sparsity;
fLanguage :
English
Journal_Title :
Information Theory, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9448
Type :
jour
DOI :
10.1109/TIT.2013.2252051
Filename :
6502243
Link To Document :
بازگشت