Theoretical performance limits for jointly sparse signals via graphical models

The compressed sensing (CS) framework has been proposed for efficient acquisition of sparse and compressible signals through incoherent measurements. In our recent work, we introduced a new concept of joint sparsity of a signal ensemble. For several specific joint sparsity models, we demonstrated distributed CS schemes. This paper considers joint sparsity via graphical models that link the sparse underlying coefficient vector, signal entries, and measurements. Our converse and achievable bounds establish that the number of measurements required in the noiseless measurement setting is closely related to the dimensionality of the sparse coefficient vector. Single signal and joint (single-encoder) CS are special cases of joint sparsity, and their performance limits fit into our graphical model framework for distributed (multi-encoder) CS.

[1]  Kannan Ramchandran,et al.  Distributed Sparse Random Projections for Refinable Approximation , 2007, 2007 6th International Symposium on Information Processing in Sensor Networks.

[2]  E.J. Candes Compressive Sampling , 2022 .

[3]  David L Donoho,et al.  Compressed sensing , 2006, IEEE Transactions on Information Theory.

[4]  Richard G. Baraniuk,et al.  Distributed Compressed Sensing Dror , 2005 .

[5]  Robert D. Nowak,et al.  Joint Source–Channel Communication for Distributed Estimation in Sensor Networks , 2007, IEEE Transactions on Information Theory.

[6]  D. West Introduction to Graph Theory , 1995 .