Abstract
Based on the iterative hard thresholding (IHT) algorithm, this paper presents the relaxed iterative thresholding algorithm which is a modified algorithm of the conventional IHT algorithm. By introducing the relaxed factors, modifying the iterative formulae and proposing the relaxed algorithm correspondingly, we acquired the least number of iterations and error estimate required by the measurement matrices of satisfying the RIP. Compared with the IHT algorithm, the method presented in this paper not only has the advantages of keeping linear stability and clearly delimiting the upper limit of the number of iterations, but also obtains the same computational precision with the less number of iterations which saves the labor of calculation. Finally, taking the Hadamard orthogonal basis as sparse basis, the random Gaussian matrix as measurement matrix, we have verified the validity of the algorithm proposed above by experimental simulation.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Donoho, D.L.: Compressed Sensing. J. IEEE Trans. Information Theory 52, 1289–1306 (2006)
Needell, D., Tropp, J.: COSAMP: Iterative Signal Recovery From Complete and Inaccurate Samples. J. Appl. Comp. Harmonic Anal. 26, 301–321 (2009)
Dai, W., Milenkovic, O.: Subspace Pursuit for Compressive Sensing Signal Reconstruction. In: 2008 5th International Symposium on Turbo Codes and Related Topics, TURBOCODING, Lausanne, Switzerland, pp. 402–407 (2008)
Pope, G.: Compressive Sensing: a Summary of Reconstruction Algorithms. Eidgenössische Technische Hochschule, Zürich (2008)
Candes, E.: The Restricted Isometry Property and Its Implications for Compressed Sensing. J. Compte Rendus de l’Academiedes Sciences 346, 589–592 (2008)
Blumensath, T., Davies, M.E.: Iterative Thresholding for Sparse Approximationsl. J. Fourier Anal. Appl. 14, 629–654 (2008)
Blumensath, T., Davies, M.E.: Iterative Hard Thresholding for Compressed Sensing. J. Appl. Comp. Harmonic Anal. 27, 265–274 (2009)
Blumensath, T., Davies, M.E.: A Simple, Efficient and Near Optimal Algorithm for Compressed Sensing. In: Proceedings of the Int. Conf. on Acoustics, Speech and Signal Processing, pp. 3357–3360 (2009)
Raginsky, M., Willett, R.M.: Compressed Sensing Performance Bounds under Poisson Noise. J. IEEE Transactions on Signal Processing 58, 3990–4002 (2009)
Blanchard, J.D., Cartis, C., Tanner, J.: Decay Properties of Restricted Isometry Constants. J. IEEE Signal Processing 16, 572–575 (2009)
Blumensath, T., Davies, M.E.: Sampling Theorems for Signals from the Union of Finite-Dimensional Linear Subspaces. Submitted to IEEE Transactions on Information Theory (2008)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Li, B., Li, G., Ye, M., Zheng, M., Lv, Y. (2012). A Relaxed Iterative Thresholding Reconstruction Algorithm Based on Compressed Sensing. In: Lei, J., Wang, F.L., Li, M., Luo, Y. (eds) Network Computing and Information Security. NCIS 2012. Communications in Computer and Information Science, vol 345. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-35211-9_33
Download citation
DOI: https://doi.org/10.1007/978-3-642-35211-9_33
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-35210-2
Online ISBN: 978-3-642-35211-9
eBook Packages: Computer ScienceComputer Science (R0)