• May 27, 2016 News!The submission for Special Issue is officially open now!   [Click]
  • May 03, 2016 News!Vol.6, No.6 has been indexed by EI (Inspec).   [Click]
  • Mar 17, 2017 News!Vol.9, No.2 has been published with online version. 13 peer reviewed articles from 4 specific areas are published in this issue.   [Click]
General Information
Prof. Wael Badawy
Department of Computing and Information Systems Umm Al Qura University, Canada
I'm happy to take on the position of editor in chief of IJCTE. We encourage authors to submit papers concerning any branch of computer theory and engineering.
IJCTE 2012 Vol.4(2): 270-273 ISSN: 1793-8201
DOI: 10.7763/IJCTE.2012.V4.464

An Efficient Iterative Thresholding Method for Compressed Sensing

Amin Tavakoli and Ali Pourmohammad, Member, IACSIT
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 ).


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.
Copyright © 2008-2015. International Journal of Computer Theory and Engineering. All rights reserved.
E-mail: ijcte@vip.163.com