Deterministic sensing matrices are useful, because in practice, the sampler has to be a deterministic matrix. It is quite challenging to design a deterministic sensingmatrix with low coherence. In this paper, we cons...
详细信息
Deterministic sensing matrices are useful, because in practice, the sampler has to be a deterministic matrix. It is quite challenging to design a deterministic sensingmatrix with low coherence. In this paper, we consider a more general condition, when the deterministic sensingmatrix has high coherence and does not satisfy the restricted isometry property (RIP). A novel algorithm, called the similarsensingmatrixpursuit (SSMP), is proposed to reconstruct a K-sparse signal, based on the original deterministic sensingmatrix. The proposed algorithm consists of off-line and online processing. The goal of the off-line processing is to construct a similar compact sensingmatrix containing as much information as possible from the original sensingmatrix. The similar compact sensingmatrix has low coherence, which guarantees a perfect reconstruction of the sparse vector with high probability. The online processing begins when measurements arrive, and consists of rough and refined estimation processes. Results from our simulation show that the proposed algorithm obtains much better performance while coping with a deterministic sensingmatrix with high coherence compared with the subspace pursuit (SP) and basis pursuit (BP) algorithms. (C) 2013 Elsevier B.V. All rights reserved.
暂无评论