Analysis of Block OMP using Block RIP

Details Analysis of Block OMP using Block RIP Analysis of Block OMP using Block RIP

2011-04-06

arxiv.org/abs/1104.1071v1

Computer Science

Information Theory

10 pages, no figures

Scientific paper

Orthogonal matching pursuit (OMP) is a canonical greedy algorithm for sparse signal reconstruction. When the signal of interest is block sparse, i.e., it has nonzero coefficients occurring in clusters, the block version of OMP algorithm (i.e., Block OMP) outperforms the conventional OMP. In this paper, we demonstrate that a new notion of block restricted isometry property (Block RIP), which is less stringent than standard restricted isometry property (RIP), can be used for a very straightforward analysis of Block OMP. It is demonstrated that Block OMP can exactly recover any block K-sparse signal in no more than K steps if the Block RIP of order K+1 with a sufficiently small isometry constant is satisfied. Using this result it can be proved that Block OMP can yield better reconstruction properties than the conventional OMP when the signal is block sparse.

Affiliated with

Also associated with

No associations

Rating

Analysis of Block OMP using Block RIP 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 Analysis of Block OMP using Block RIP, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Analysis of Block OMP using Block RIP will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-417932