CS recovery algorithms(OMP,ROMP,IRLS, GBP,...)

             There are many compressed sensing (CS) recovery algorithms that have been proposed. Here I list some of them, and provide the corresponding experimental results. Essentially, the recovery algorithms are similar to the sparse coding based on the over-complete dictionary. The corresponding MATLAB Codes of the following algorithms can be downloaded from my homepage, http://home.ustc.edu.cn/~roy.

 

1. Orthogonal Matching Pursuit (OMP) [1]

  

Fig. 1. Recovery result by using OMP

 

  I employ the OMP to recovery an image in the column-by-column fashion, i.e. process each column separately. The recovery result is shown in Fig. 1. The advantages of OMP are easy implementation and fast speed.

 

2. Compressive Sampling Matching Pursuit (CoSaMP) [2]

 

   

  The foundation of this algorithm is that “For an s-sparse signal x, the vector y can serve as a proxy for the signal because the energy in each set of s components of y approximates the energy in the corresponding s components of x. In particular, the largest s entries of the proxy y point toward the largest s entries of the signal x.”