A K-best orthogonal matching pursuit for compressive sensing

Pu Hsuan Lin, Shang-Ho Tsai, Gene C.H. Chuang

研究成果: Conference contribution同行評審

4 引文 斯高帕斯(Scopus)

摘要

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.

原文English
主出版物標題2013 IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2013 - Proceedings
頁面5706-5709
頁數4
DOIs
出版狀態Published - 18 10月 2013
事件2013 38th IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2013 - Vancouver, BC, 加拿大
持續時間: 26 5月 201331 5月 2013

出版系列

名字ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings
ISSN(列印)1520-6149

Conference

Conference2013 38th IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2013
國家/地區加拿大
城市Vancouver, BC
期間26/05/1331/05/13

指紋

深入研究「A K-best orthogonal matching pursuit for compressive sensing」主題。共同形成了獨特的指紋。

引用此