A remark about orthogonal matching pursuit algorithm

Details A remark about orthogonal matching pursuit algorithm A remark about orthogonal matching pursuit algorithm

2010-05-18

arxiv.org/abs/1005.3093v5

Computer Science

Information Theory

10 pages

Scientific paper

In this note, we investigate the theoretical properties of Orthogonal Matching Pursuit (OMP), a class of decoder to recover sparse signal in compressed sensing. In particular, we show that the OMP decoder can give $(p,q)$ instance optimality for a large class of encoders with $1\leq p\leq q \leq 2$ and $(p,q)\neq (2,2)$. We also show that, if the encoding matrix is drawn from an appropriate distribution, then the OMP decoder is $(2,2)$ instance optimal in probability.

Affiliated with

Also associated with

No associations

Rating

A remark about orthogonal matching pursuit algorithm 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 A remark about orthogonal matching pursuit algorithm, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A remark about orthogonal matching pursuit algorithm will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-57417