Distributed Sensing of Signals under a Sparse Filtering Model

We consider the task of recovering correlated vectors at a central decoder based on fixed linear measurements obtained by distributed sensors. Two different scenarios are considered: In the case of universal reconstruction, we look for a sensing and recovery mechanism that works for all possible signals, whereas in the case of almost sure reconstruction, we allow to have a small set (with measure zero) of unrecoverable signals. We provide achievability bounds on the number of samples needed for both scenarios. The bounds show that only in the almost sure setup can we effectively exploit the signal correlations to achieve effective gains in sampling efficiency. In addition, we propose an efficient and robust distributed sensing and reconstruction algorithm based on annihilating filters.

Published in:
Proceedings of the 8th International Conference on Sampling Theory and Applications (SAMPTA)
Presented at:
8th International Conference on Sampling Theory and Applications (SAMPTA), Marseille, France, May 18-22, 2009

 Record created 2009-05-27, last modified 2019-03-16

Download fulltext

Rate this document:

Rate this document:
(Not yet reviewed)