pith. machine review for the scientific record. sign in

arxiv: 1109.5430 · v1 · pith:EU66ZI4Enew · submitted 2011-09-26 · 💻 cs.IT · math.IT

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

classification 💻 cs.IT math.IT
keywords recoveryblock-sparseblock-sparsityblock-versionmatchingmethodorthogonalpattern
0
0 comments X
read the original abstract

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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.