Sharp Sufficient Conditions for Stable Recovery of Block Sparse Signals by Block Orthogonal Matching Pursuit
Preprint
Abstract
In this paper, we investigate some sufficient conditions based on the block restricted isometry property (block-RIP) for exact (when $\v=\0$) and stable (when $\v\neq\0$) recovery of block sparse signals $\x$ from measurements $\y=\A\x+\v$, where $\v$ is a $\ell_2$ bounded noise vector (i.e., $\|\v\|_2\leq \epsilon$ for some constant $\epsilon$).. First, on the one hand, we show that if $\A$ satisfies the block-RIP with constant $\delta_{K+1}<1/\sqrt{K+1}$, then every $K$-block sparse signal $\x$ can be exactly or stably recovered by BOMP in $K$ iterations; On the other hand, for any $K\geq 1$ and $1/\sqrt{K+1}\leq t<1$, there exists a matrix $\A$ satisfying the block-RIP with $\delta_{K+1}=t$ and a $K$-block sparse signal $\x$ such that the BOMP algorithm may fail to recover $\x$ in $K$ iterations. Second, we study some sufficient conditions for recovering $\alpha$-strongly-decaying $K$-block sparse signals. Surprisingly, it is shown that if $\A$ satisfies the block-RIP with $\delta_{K+1}<\sqrt{2}/2$, every $\alpha$-strongly-decaying $K$-block sparse signal can be exactly or stably recovered by the BOMP algorithm in $K$ iterations, under some conditions on $\alpha$. Our newly found sufficient condition on the block-RIP of $\A$ is weaker than that for $\ell_1$ minimization for this special class of sparse signals, which further convinces the effectiveness of BOMP. Furthermore, for any $K\geq 1$, $\alpha>1$ and $\sqrt{2}/2\leq t<1$, the recovery of $\x$ may fail in $K$ iterations for a sensing matrix $\A$ which satisfies the block-RIP with $\delta_{K+1}=t$. Finally, we study some sufficient conditions for partial recovery of block sparse signals. Specifically, if $\A$ satisfies the block-RIP with $\delta_{K+1}<\sqrt{2}/2$, then BOMP is guaranteed to recover some blocks of $\x$ if these blocks satisfy a sufficient condition. We further show that this condition is sharp.
Keywords
All Related Versions
This publication has 41 references indexed in Scilit:
- Stable recovery of sparse signals via -minimizationApplied and Computational Harmonic Analysis, 2015
- Improved bounds on restricted isometry constant for orthogonal matching pursuitElectronics Letters, 2013
- The null space property for sparse recovery from multiple measurement vectorsApplied and Computational Harmonic Analysis, 2011
- A note on guaranteed sparse recovery via -minimizationApplied and Computational Harmonic Analysis, 2010
- Sparsest solutions of underdetermined linear systems via -minimization forApplied and Computational Harmonic Analysis, 2009
- The restricted isometry property and its implications for compressed sensingComptes Rendus Mathématique, 2008
- For most large underdetermined systems of linear equations the minimal 𝓁1‐norm solution is also the sparsest solutionCommunications on Pure and Applied Mathematics, 2006
- Stable signal recovery from incomplete and inaccurate measurementsCommunications on Pure and Applied Mathematics, 2006
- A Wavelet Tour of Signal Processing1999
- On the approximability of minimizing nonzero variables or unsatisfied relations in linear systemsTheoretical Computer Science, 1998