Computer Science – Information Theory
Scientific paper
2009-06-16
Computer Science
Information Theory
Submitted to the IEEE Trans. on Signal Processing, version 2 has updated figures
Scientific paper
We consider compressed sensing of block-sparse signals, i.e., sparse signals that have nonzero coefficients occurring in clusters. An uncertainty relation for block-sparse signals is derived, based on a block-coherence measure, which we introduce. We then show that a block-version of the orthogonal matching pursuit algorithm recovers block $k$-sparse signals in no more than $k$ steps if the block-coherence is sufficiently small. The same condition on block-coherence is shown to guarantee successful recovery through a mixed $\ell_2/\ell_1$-optimization approach. This complements previous recovery results for the block-sparse case which relied on small block-restricted isometry constants. The significance of the results presented in this paper lies in the fact that making explicit use of block-sparsity can provably yield better reconstruction properties than treating the signal as being sparse in the conventional sense, thereby ignoring the additional structure in the problem.
Bölcskei Helmut
Eldar Yonina C.
Kuppinger Patrick
No associations
LandOfFree
Compressed Sensing of Block-Sparse Signals: Uncertainty Relations and Efficient Recovery does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Compressed Sensing of Block-Sparse Signals: Uncertainty Relations and Efficient Recovery, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Compressed Sensing of Block-Sparse Signals: Uncertainty Relations and Efficient Recovery will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-223204