A reducing iteration orthogonal matching pursuit algorithm for compressive sensing

38Citations
Citations of this article
17Readers
Mendeley users who have this article in their library.

Abstract

In recent years, Compressed Sensing (CS) has been a hot research topic. It has a wide range of applications, such as image processing and speech signal processing owing to its characteristic of removing redundant information by reducing the sampling rate. The disadvantage of CS is that the number of iterations in a greedy algorithm such as Orthogonal Matching Pursuit (OMP) is fixed, thus limiting reconstruction precision. Therefore, in this study, we present a novel Reducing Iteration Orthogonal Matching Pursuit (RIOMP) algorithm that calculates the correlation of the residual value and measurement matrix to reduce the number of iterations. The conditions for successful signal reconstruction are derived on the basis of detailed mathematical analyses. When compared with the OMP algorithm, the RIOMP algorithm has a smaller reconstruction error. Moreover, the proposed algorithm can accurately reconstruct signals in a shorter running time.

Cite

CITATION STYLE

APA

Wang, R., Zhang, J., Ren, S., & Li, Q. (2016). A reducing iteration orthogonal matching pursuit algorithm for compressive sensing. Tsinghua Science and Technology, 21(1), 71–79. https://doi.org/10.1109/TST.2016.7399284

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free