Recovery of Block-Sparse Representations from Noisy Observations via Orthogonal Matching Pursuit

Details Recovery of Block-Sparse Representations from Noisy Observations via Orthogonal Matching Pursuit Recovery of Block-Sparse Representations from Noisy Observations via Orthogonal Matching Pursuit

2011-09-26

arxiv.org/abs/1109.5430v1

Computer Science

Information Theory

7 pages in two-column format; 2 figures

Scientific paper

We study the problem of recovering the sparsity pattern of block-sparse signals from noise-corrupted measurements. A simple, efficient recovery method, namely, a block-version of the orthogonal matching pursuit (OMP) method, is considered in this paper and its behavior for recovering the block-sparsity pattern is analyzed. We provide sufficient conditions under which the block-version of the OMP can successfully recover the block-sparse representations in the presence of noise. Our analysis reveals that exploiting block-sparsity can improve the recovery ability and lead to a guaranteed recovery for a higher sparsity level. Numerical results are presented to corroborate our theoretical claim.

Affiliated with

Also associated with

No associations

Rating

Recovery of Block-Sparse Representations from Noisy Observations via Orthogonal Matching Pursuit 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 Recovery of Block-Sparse Representations from Noisy Observations via Orthogonal Matching Pursuit, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Recovery of Block-Sparse Representations from Noisy Observations via Orthogonal Matching Pursuit will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-685531