Xingyi Chen, Yujie Zhang, Rui Qi, Journal of Information Processing Systems Vol. 15, No. 2, pp. 410-421, Apr. 2019  

10.3745/JIPS.04.0111
Keywords: Block Sparse Signals, Compressed Sensing, Distributed Compressed Sensing, Iteration Algorithm
Fulltext: PDF Full Text PubReader

Abstract

Distributed compressed sensing (DCS) states that we can recover the sparse signals from very few linear measurements. Various studies about DCS have been carried out recently. In many practical applications, there is no prior information except for standard sparsity on signals. The typical example is the sparse signals have block-sparse structures whose non-zero coefficients occurring in clusters, while the cluster pattern is usually unavailable as the prior information. To discuss this issue, a new algorithm, called backtracking-based adaptive orthogonal matching pursuit for block distributed compressed sensing (DCSBBAOMP), is proposed. In contrast to existing block methods which consider the single-channel signal reconstruction, the DCSBBAOMP resorts to the multi-channel signals reconstruction. Moreover, this algorithm is an iterative approach, which consists of forward selection and backward removal stages in each iteration. An advantage of this method is that perfect reconstruction performance can be achieved without prior information on the block-sparsity structure. Numerical experiments are provided to illustrate the desirable performance of the proposed method.

Statistics
Cite this article