A K-best orthogonal matching pursuit for compressive sensing

Abstract

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.