International Journal of Computer Theory and Engineering

Editor-In-Chief: Prof. Mehmet Sahinoglu
Frequency: Quarterly
ISSN: 1793-8201 (Print), 2972-4511 (Online)
Publisher:IACSIT Press

OPEN ACCESS
4.0
CiteScore

IJIET 2012 Vol.4(2): 270-273
doi: 10.7763/IJCTE.2012.V4.464

An Efficient Iterative Thresholding Method for Compressed Sensing

Amin Tavakoli , Ali Pourmohammad

  • Electrical Engineering Department, Amirkabir University of Technology, Hafez Ave., Tehran 15914, Iran.

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.

Keywords

  • Compressed sensing
  • iterative hard thresholding
  • matching pursuit
  • orthogonal matching pursuit
464-G1314

How to Cite

Copied

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. https://doi.org/10.7763/IJCTE.2012.V4.464

Copyright & License

Copyright © 2012 by the authors. This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited (CC BY 4.0).

Article Metrics in Dimensions

Menu