A K-best orthogonal matching pursuit for compressive sensing

This paper proposes an orthogonal matching pursuit (OMP-) based recovering algorithm for compressive sensing problems. This algorithm can significantly improve recovering performance while it can still maintain reasonable computational complexity. Complexity analysis and simulation results are provided for the proposed algorithm and compared with other popular recovering schemes. We observe that the proposed algorithm can significantly improve the exact recovering performance compared to the OMP scheme. Moreover, in the cases with high compressed ratio, the proposed algorithm can even outperform the benchmark performance achieved by the subspace programming and linear programming.

[1]  E.J. Candes,et al.  An Introduction To Compressive Sampling , 2008, IEEE Signal Processing Magazine.

[2]  Michael A. Saunders,et al.  Atomic Decomposition by Basis Pursuit , 1998, SIAM J. Sci. Comput..

[3]  Marco Righero,et al.  An introduction to compressive sensing , 2009 .

[4]  Stéphane Mallat,et al.  Matching pursuits with time-frequency dictionaries , 1993, IEEE Trans. Signal Process..

[5]  Yurii Nesterov,et al.  Interior-point polynomial algorithms in convex programming , 1994, Siam studies in applied mathematics.

[6]  Olgica Milenkovic,et al.  Subspace Pursuit for Compressive Sensing Signal Reconstruction , 2008, IEEE Transactions on Information Theory.

[7]  Mikael Skoglund,et al.  Look ahead orthogonal matching pursuit , 2011, 2011 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP).

[8]  Emmanuel J. Candès,et al.  Decoding by linear programming , 2005, IEEE Transactions on Information Theory.

[9]  David L Donoho,et al.  Compressed sensing , 2006, IEEE Transactions on Information Theory.