Subspace Methods for Joint Sparse Recovery
From MaRDI portal
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.
Cited in
(26)- Typical reconstruction performance for distributed compressed sensing based on \(\ell_{2,1} \)-norm regularized least square and Bayesian optimal reconstruction: influences of noise
- Reconstruction of jointly sparse vectors via manifold optimization
- Late Fusion via Subspace Search With Consistency Preservation
- Greedy subspace pursuit for joint sparse recovery
- Reducing effects of bad data using variance based joint sparsity recovery
- [HDDA] sparse subspace constrained partial least squares
- High-order evaluation complexity for convexly-constrained optimization with non-Lipschitzian group sparsity terms
- Robust Subspace Discovery via Relaxed Rank Minimization
- Stochastic greedy algorithms for multiple measurement vectors
- Solution sets of three sparse optimization problems for multivariate regression
- Off-grid DOA estimation via real-valued sparse Bayesian method in compressed sensing
- A general theory for subspace-sparse recovery
- A sparsity-constrained sampling method with applications to communications and inverse scattering
- Distributed Robust Subspace Recovery
- Split Bregman algorithms for multiple measurement vector problem
- On rank awareness, thresholding, and MUSIC for joint sparse recovery
- Enhanced joint sparsity via iterative support detection
- On the strong convergence of forward-backward splitting in reconstructing jointly sparse signals
- Spectrum blind reconstruction and direction of arrival estimation of multi-band signals at sub-Nyquist sampling rates
- Recovery Algorithms for Vector-Valued Data with Joint Sparsity Constraints
- Robust multifrequency imaging with MUSIC
- Subspace Recovery From Structured Union of Subspaces
- Distributed compressed sensing based joint detection and tracking for multistatic radar system
- Group Sparse Optimization for Images Recovery Using Capped Folded Concave Functions
- Typical reconstruction limits for distributed compressed sensing based on \(\ell_{2,1} \)-norm minimization and Bayesian optimal reconstruction
- The analysis of block joint sparse recovery using block signal space matching pursuit
This page was built for publication: Subspace Methods for Joint Sparse Recovery
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5271895)
