Conditions for recovery of sparse signals correlated by local transforms

This paper addresses the problem of correct recovery of multiple sparse correlated signals using distributed thresholding. We consider the scenario where multiple sensors capture the same event, but observe different signals that are correlated by local transforms of their sparse components. In this context, the signals do not necessarily have the same sparse support, but instead the support of one signal is built on local transforms of the atoms in the sparse support of another signal. We establish the sufficient condition for the correct recovery of such correlated signals using independent thresholding of the multiple signals. The condition is relevant in scenarios where low complexity processing such as thresholding is needed, for example in sensor networks. The validity of the derived recovery condition is confirmed by experimental results in noiseless and noisy scenarios.

[1]  H. Rauhut,et al.  Atoms of All Channels, Unite! Average Case Analysis of Multi-Channel Sparse Recovery Using Greedy Algorithms , 2008 .

[2]  R.G. Baraniuk,et al.  Distributed Compressed Sensing of Jointly Sparse Signals , 2005, Conference Record of the Thirty-Ninth Asilomar Conference onSignals, Systems and Computers, 2005..

[3]  Pascal Frossard,et al.  Distributed Sensing of Noisy Signals by Thresholding of Redundant Expansions , 2006, 2006 IEEE Workshop on Multimedia Signal Processing.

[4]  Pascal Frossard,et al.  Low-rate and flexible image coding with redundant representations , 2006, IEEE Transactions on Image Processing.

[5]  Morten Nielsen,et al.  Beyond sparsity: Recovering structured representations by ${\ell}^1$ minimization and greedy algorithms , 2007, Adv. Comput. Math..

[6]  Joel A. Tropp,et al.  Greed is good: algorithmic results for sparse approximation , 2004, IEEE Transactions on Information Theory.