Average Case Analysis of Multichannel Sparse Recovery Using Convex Relaxation
From MaRDI portal
Abstract: In this paper, we consider recovery of jointly sparse multichannel signals from incomplete measurements. Several approaches have been developed to recover the unknown sparse vectors from the given observations, including thresholding, simultaneous orthogonal matching pursuit (SOMP), and convex relaxation based on a mixed matrix norm. Typically, worst-case analysis is carried out in order to analyze conditions under which the algorithms are able to recover any jointly sparse set of vectors. However, such an approach is not able to provide insights into why joint sparse recovery is superior to applying standard sparse reconstruction methods to each channel individually. Previous work considered an average case analysis of thresholding and SOMP by imposing a probability model on the measured signals. In this paper, our main focus is on analysis of convex relaxation techniques. In particular, we focus on the mixed l_2,1 approach to multichannel recovery. We show that under a very mild condition on the sparsity and on the dictionary characteristics, measured for example by the coherence, the probability of recovery failure decays exponentially in the number of channels. This demonstrates that most of the time, multichannel sparse recovery is indeed superior to single channel methods. Our probability bounds are valid and meaningful even for a small number of signals. Using the tools we develop to analyze the convex relaxation method, we also tighten the previous bounds for thresholding and SOMP.
Cited in
(25)- Learning and sparse control of multiagent systems
- Recovery analysis for weighted mixed \(\ell_2 / \ell_p\) minimization with \(0 < p \leq 1\)
- Greedy subspace pursuit for joint sparse recovery
- Reducing effects of bad data using variance based joint sparsity recovery
- Analysis of sparse recovery algorithms via the replica method
- Active channel sparsification: realizing frequency-division duplexing massive MIMO with minimal overhead
- On rank awareness, thresholding, and MUSIC for joint sparse recovery
- On the strong convergence of forward-backward splitting in reconstructing jointly sparse signals
- Synthetic aperture imaging of direction- and frequency-dependent reflectivities
- Illumination strategies for intensity-only imaging
- Typical reconstruction performance for distributed compressed sensing based on \(\ell_{2,1} \)-norm regularized least square and Bayesian optimal reconstruction: influences of noise
- Sparsity constrained estimation in image processing and computer vision
- Joint sparse recovery based on variances
- Sparse regression and support recovery with \(\mathbb{L}_2\)-boosting algorithms
- Sparse stabilization and control of alignment models
- A mixed ℓ1 regularization approach for sparse simultaneous approximation of parameterized PDEs
- Nonuniform recovery of fusion frame structured sparse signals
- Performance Bounds for Cosparse Multichannel Signal Recovery via Collaborative-TV
- A randomized sparse Kaczmarz solver for sparse signal recovery via minimax-concave penalty
- Joint sparse optimization: lower-order regularization method and application in cell fate conversion
- Auto-calibration and biconvex compressive sensing with applications to parallel MRI
- Atoms of all channels, unite! Average case analysis of multi-channel sparse recovery using greedy algorithms
- Uniform recovery of fusion frame structured sparse signals
- Enhanced joint sparsity via iterative support detection
- A new conjugate gradient hard thresholding pursuit algorithm for sparse signal recovery
This page was built for publication: Average Case Analysis of Multichannel Sparse Recovery Using Convex Relaxation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4976067)
