On the block-sparsity of multiple-measurement vectors

Based on the compressive sensing (CS) theory, it is possible to recover signals, which are either compressible or sparse under some suitable basis, via a small number of non-adaptive linear measurements. In this paper, we investigate recovering of block-sparse signals via multiple measurement vectors (MMVs) in the presence of noise. In this case, we consider one of the existing algorithms which provides a satisfactory estimate in terms of minimum meansquared error but a non-sparse solution. Here, the algorithm is first modified to result in sparse solutions. Then, further modification is performed to account for the unknown block sparsity structure in the solution, as well. The performance of the proposed algorithm is demonstrated by experimental simulations and comparisons with some other algorithms for the sparse recovery problem.

[1]  Xiao-Ping Zhang,et al.  Direction-of-arrival estimation using sparse variable projection optimization , 2012, 2012 IEEE International Symposium on Circuits and Systems.

[2]  IEEE Signal Processing and Signal Processing Education Workshop, SP/SPE 2015, Salt Lake City, UT, USA, August 9-12, 2015 , 2015, SP/SPE.

[3]  D. Donoho,et al.  Basis pursuit , 1994, Proceedings of 1994 28th Asilomar Conference on Signals, Systems and Computers.

[4]  Todd K. Moon,et al.  Hierarchical Bayesian approach for jointly-sparse solution of multiple-measurement vectors , 2014, 2014 48th Asilomar Conference on Signals, Systems and Computers.

[5]  Yonina C. Eldar,et al.  Xampling: Signal Acquisition and Processing in Union of Subspaces , 2009, IEEE Transactions on Signal Processing.

[6]  Todd K. Moon,et al.  Detection of Amorphously Shaped Objects Using Spatial Information Detection Enhancement (SIDE) , 2012, IEEE Journal of Selected Topics in Applied Earth Observations and Remote Sensing.

[7]  Bhaskar D. Rao,et al.  Sparse solutions to linear inverse problems with multiple measurement vectors , 2005, IEEE Transactions on Signal Processing.

[8]  Bhaskar D. Rao,et al.  An Empirical Bayesian Strategy for Solving the Simultaneous Sparse Approximation Problem , 2007, IEEE Transactions on Signal Processing.

[9]  Bhaskar D. Rao,et al.  Sparse Bayesian learning for basis selection , 2004, IEEE Transactions on Signal Processing.

[10]  Albert Wang,et al.  The In-Crowd Algorithm for Fast Basis Pursuit Denoising , 2011, IEEE Transactions on Signal Processing.

[11]  Yonina C. Eldar,et al.  Reduce and Boost: Recovering Arbitrary Sets of Jointly Sparse Vectors , 2008, IEEE Transactions on Signal Processing.

[12]  Michael Elad,et al.  A Plurality of Sparse Representations Is Better Than the Sparsest One Alone , 2009, IEEE Transactions on Information Theory.

[13]  Richard G. Baraniuk,et al.  Bayesian Compressive Sensing Via Belief Propagation , 2008, IEEE Transactions on Signal Processing.

[14]  Yonina C. Eldar,et al.  Blind Compressed Sensing , 2010, IEEE Transactions on Information Theory.

[15]  Emmanuel J. Candès,et al.  Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information , 2004, IEEE Transactions on Information Theory.

[16]  Michael Elad,et al.  Sparse and Redundant Representations - From Theory to Applications in Signal and Image Processing , 2010 .

[17]  Bhaskar D. Rao,et al.  Recovery of block sparse signals using the framework of block sparse Bayesian learning , 2012, 2012 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP).

[18]  Bhaskar D. Rao,et al.  On the benefits of the block-sparsity structure in sparse signal recovery , 2012, 2012 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP).

[19]  E.J. Candes,et al.  An Introduction To Compressive Sampling , 2008, IEEE Signal Processing Magazine.

[20]  S. Frick,et al.  Compressed Sensing , 2014, Computer Vision, A Reference Guide.