Subspace Methods for Joint Sparse Recovery
arXiv:1004.3071 · doi:10.1109/TIT.2012.2189196
Abstract
We propose robust and efficient algorithms for the joint sparse recovery problem in compressed sensing, which simultaneously recover the supports of jointly sparse signals from their multiple measurement vectors obtained through a common sensing matrix. In a favorable situation, the unknown matrix, which consists of the jointly sparse signals, has linearly independent nonzero rows. In this case, the MUSIC (MUltiple SIgnal Classification) algorithm, originally proposed by Schmidt for the direction of arrival problem in sensor array processing and later proposed and analyzed for joint sparse recovery by Feng and Bresler, provides a guarantee with the minimum number of measurements. We focus instead on the unfavorable but practically significant case of rank-defect or ill-conditioning. This situation arises with limited number of measurement vectors, or with highly correlated signal components. In this case MUSIC fails, and in practice none of the existing methods can consistently approach the fundamental limit. We propose subspace-augmented MUSIC (SA-MUSIC), which improves on MUSIC so that the support is reliably recovered under such unfavorable conditions. Combined with subspace-based greedy algorithms also proposed and analyzed in this paper, SA-MUSIC provides a computationally efficient algorithm with a performance guarantee. The performance guarantees are given in terms of a version of restricted isometry property. In particular, we also present a non-asymptotic perturbation analysis of the signal subspace estimation that has been missing in the previous study of MUSIC.
submitted to IEEE transactions on Information Theory, revised version
References in corpus (1)
Cited by in corpus (15)
- Off-grid Direction of Arrival Estimation Using Sparse Bayesian Inference
- Efficient High-Dimensional Inference in the Multiple Measurement Vector Problem
- A Dimension Reduction-Based Joint Activity Detection and Channel Estimation Algorithm for Massive Access
- Recursive Recovery of Sparse Signal Sequences from Compressive Measurements: A Review
- Joint Design of Measurement Matrix and Sparse Support Recovery Method via Deep Auto-encoder
- Measurement Bounds for Sparse Signal Ensembles via Graphical Models
- Improving Noise Robustness in Subspace-based Joint Sparse Recovery
- Joint Sparse Recovery With Semisupervised MUSIC
- Performance Limits for Noisy Multi-Measurement Vector Problems
- Improving M-SBL for Joint Sparse Recovery using a Subspace Penalty
- Conditioning of Random Block Subdictionaries with Applications to Block-Sparse Recovery and Regression
- Performance Limits with Additive Error Metrics in Noisy Multi-Measurement Vector Problem
- Robust multifrequency imaging with MUSIC
- Multiple Support Recovery Using Very Few Measurements Per Sample
- On the strong convergence of forward-backward splitting in reconstructing jointly sparse signals