Abstract—Compressed sensing is one of the newest problems in signal processing area. Recently greedy algorithms, such as matching pursuit (MP), orthogonal matching pursuit (OMP), iterative hard thresholding (IHT) and so on, are become applicable methods for compressed sensing problem. In this paper we propose an efficient technique for thresholding in IHT method. Proposed method simulation results in comparison with OMP and IHT methods, lead us to faster reconstruction and same SNR for reconstructed signal.
Index Terms—Compressed sensing, iterative hard thresholding, matching pursuit, orthogonal matching pursuit.
The authors are with the Electrical Engineering Department, Amirkabir University of Technology, Hafez Ave., Tehran 15914, Iran (e-mails: amintavakoli61@gmail.com, pourmohammad@aut.ac.ir, tel.: +98 21 64543392, fax: +98 21 66406469 ).
[PDF]
Cite: Amin Tavakoli and Ali Pourmohammad, "An Efficient Iterative Thresholding Method for Compressed Sensing,"
International Journal of Computer Theory and Engineering vol. 4, no. 2, pp. 270-273, 2012.
