Distributed compressed sensing is the extension of compressed sampling (CS) to sensor networks. The idea is to
design a CS joint decoding scheme at a central decoder (base station) that exploits the inter-sensor correlations, in
order to recover the whole observations from very few number of random measurements per node. In this paper,
we focus on modeling the correlations and on the design and analysis of efficient joint recovery algorithms.
We show, by extending earlier results of Baron et al.,1 that a simple thresholding algorithm can exploit the
full diversity offered by all channels to identify a common sparse support using a near optimal number of
measurements.
Access to the requested content is limited to institutions that have purchased or subscribe to SPIE eBooks.
You are receiving this notice because your organization may not have SPIE eBooks access.*
*Shibboleth/Open Athens users─please
sign in
to access your institution's subscriptions.
To obtain this item, you may purchase the complete book in print or electronic format on
SPIE.org.
INSTITUTIONAL Select your institution to access the SPIE Digital Library.
PERSONAL Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.