Joint-sparse recovery from multiple measurements

Abstract

The joint-sparse recovery problem aims to recover, from sets of compressed measurements, unknown sparse matrices with nonzero entries restricted to a subset of rows. This is an extension of the single-measurement-vector (SMV) problem widely studied in compressed sensing. We analyze the recovery properties for two types of recovery algorithms. First, we show that recovery using sum-of-norm minimization cannot exceed the uniform recovery rate of sequential SMV using ${\ell }_1$ minimization, and that there are problems that can be solved with one approach but not with the other. Second, we analyze the performance of the ReMBo algorithm [M. Mishali and Y. Eldar, IEEE Trans. Sig. Proc., 56 (2008)] in combination with ${\ell }_1$ minimization, and show how recovery improves as more measurements are taken. From this analysis it follows that having more measurements than number of nonzero rows does not improve the potential theoretical recovery rate.

19 pages, 9 figures

References in corpus (1)

• Reduce and Boost: Recovering Arbitrary Sets of Jointly Sparse Vectors

Cited by in corpus (42)

• Off-grid Direction of Arrival Estimation Using Sparse Bayesian Inference
• Subspace Methods for Joint Sparse Recovery
• Efficient High-Dimensional Inference in the Multiple Measurement Vector Problem
• Block-Sparse Recovery via Convex Optimization
• Multimodal Task-Driven Dictionary Learning for Image Classification
• Structured Priors for Sparse-Representation-Based Hyperspectral Image Classification
• Permutation Meets Parallel Compressed Sensing: How to Relax Restricted Isometry Property for 2D Sparse Signals
• Various thresholds for ${\ell }_1$-optimization in compressed sensing
• Priori-Information Aided Iterative Hard Threshold: A Low-Complexity High-Accuracy Compressive Sensing Based Channel Estimation for TDS-OFDM
• Block-length dependent thresholds in block-sparse compressed sensing
• Variational properties of value functions
• Linearized 3-D Electromagnetic Contrast Source Inversion and Its Applications to Half-space Configurations
• Exact Joint Sparse Frequency Recovery via Optimization Methods
• Theoretical Analysis for Extended Target Recovery in Randomized Stepped Frequency Radars
• Compressed Sensing with Prior Information: Optimal Strategies, Geometry, and Bounds
• Measurement Bounds for Sparse Signal Ensembles via Graphical Models
• Improving Noise Robustness in Subspace-based Joint Sparse Recovery
• Performance Limits for Noisy Multi-Measurement Vector Problems
• Sparse Subspace Clustering: Algorithm, Theory, and Applications
• Compressive MUSIC: A Missing Link Between Compressive Sensing and Array Signal Processing
• Improving M-SBL for Joint Sparse Recovery using a Subspace Penalty
• Airborne Radar STAP using Sparse Recovery of Clutter Spectrum
• A Linear Model for Microwave Imaging of Highly Conductive Scatterers
• Asymptotic Analysis of Complex LASSO via Complex Approximate Message Passing (CAMP)
• Performance Limits with Additive Error Metrics in Noisy Multi-Measurement Vector Problem
• A Linear Method for Shape Reconstruction based on the Generalized Multiple Measurement Vectors Model
• Alternating Direction Method of Multipliers Based on ${\ell }_{2,0}$-norm for Multiple Measurement Vector Problem
• Sparsity Based Recovery of Galactic Binaries Gravitational Waves
• On the Support Recovery of Jointly Sparse Gaussian Sources using Sparse Bayesian Learning
• A mixed ${\ell }_1$ regularization approach for sparse simultaneous approximation of parameterized PDEs
• Sharp Sufficient Conditions for Stable Recovery of Block Sparse Signals by Block Orthogonal Matching Pursuit
• Constructing test instances for Basis Pursuit Denoising
• Enhancing Sparsity and Resolution via Reweighted Atomic Norm Minimization
• On the strong convergence of forward-backward splitting in reconstructing jointly sparse signals
• Optimality of ${\ell }_2/{\ell }_1$-optimization block-length dependent thresholds
• Compressed sensing of block-sparse positive vectors
• Orthogonal subspace based fast iterative thresholding algorithms for joint sparsity recovery
• Learning Boolean functions with concentrated spectra
• Confidence-constrained joint sparsity recovery under the Poisson noise model
• Analysis of equivalence relation in joint sparse recovery
• Extension of Sparse Randomized Kaczmarz Algorithm for Multiple Measurement Vectors
• Approximate Subspace-Sparse Recovery with Corrupted Data via Constrained ${\ell }_1$-Minimization