Subspace weighted l(2,1) minimization for sparse signal recovery

作者：Zheng Chundi; Li Gang^*; Liu Yimin; Wang Xiqin

来源：Eurasip Journal on Advances in Signal Processing, 2012.

DOI：10.1186/1687-6180-2012-98

• sparse signal recovery
• weighted l(2,1) minimization
• multiple measurement vectors (MMV)
• direction-of-arrival estimation

In this article, we propose a weighted a"" (2,1) minimization algorithm for jointly-sparse signal recovery problem. The proposed algorithm exploits the relationship between the noise subspace and the overcomplete basis matrix for designing weights, i.e., large weights are appointed to the entries, whose indices are more likely to be outside of the row support of the jointly sparse signals, so that their indices are expelled from the row support in the solution, and small weights are appointed to the entries, whose indices correspond to the row support of the jointly sparse signals, so that the solution prefers to reserve their indices. Compared with the regular a"" (2,1) minimization, the proposed algorithm can not only further enhance the sparseness of the solution but also reduce the requirements on both the number of snapshots and the signal-to-noise ratio (SNR) for stable recovery. Both simulations and experiments on real data demonstrate that the proposed algorithm outperforms the a"" (1)-SVD algorithm, which exploits straightforwardly a"" (2,1) minimization, for both deterministic basis matrix and random basis matrix.

• 出版日期2012
• 单位清华大学