AI Chat Paper
Note: Please note that the following content is generated by AMiner AI. SciOpen does not take any responsibility related to this content.
{{lang === 'zh_CN' ? '文章概述' : 'Summary'}}
{{lang === 'en_US' ? '中' : 'Eng'}}
Chat more with AI
Powered by AMiner. Clicking this button will take you away from SciOpen.
Home Tsinghua Science and Technology Article
PDF (1.3 MB)
Cite
EndNote(RIS) BibTeX
Collect
Submit Manuscript AI Chat Paper
Show Outline
Outline
Show full outline
Hide outline
Outline
Show full outline
Hide outline
Open Access

A Reducing Iteration Orthogonal Matching Pursuit Algorithm for Compressive Sensing

Rui Wang( ), Jinglei Zhang, Suli Ren, Qingjuan Li
School of Computer and Communication Engineering, University of Science and Technology Beijing, Beijing 100083, China.
School of Computer and Control Engineering, University of Chinese Academy of Sciences, Beijing 100049, China.
Show Author Information

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.

Keywords

compressed sensingsignal processingwireless sensor networks

References

[1]
Donoho D. L., Compressed sensing, IEEE Transactions on information Theory, vol. 52, no. 4, pp. 1289–1306, 2006.
Crossref Google Scholar
[2]
Davenport M., Duarte M., Eldar Y. C., and Kutyniok G., Compressed Sensing: Theory and Applications. Cambridge, UK: Cambridge Univ. Press, 2011.
[3]
Bi H., Zhang B., and Hong W., Matrix completion-based distributed compressive sensing for polarimetric SAR tomography, SCIENCE CHINA Information Sciences, vol. 58, no. 11, pp. 1–3, 2015.
Crossref Google Scholar
[4]
Hou Q., Liu Y., Fan L., and Su S., Compressed sensing digital receiver and orthogonal reconstructing algorithm for wideband ISAR radar, SCIENCE CHINA Information Sciences, vol. 58, no. 2, pp. 1–10, 2015.
Crossref Google Scholar
[5]
Ning H., Liu H., and Yang L. T., Aggregated-proof based hierarchical authentication scheme for the internet of things, IEEE Transactions on Parallel and Distributed Systems, vol. 26, no. 3, pp. 657–667, 2014.
Crossref Google Scholar
[6]
Bhattacharya S., Blumensath T., Mulgrew B., and Davies M., Fast encoding of synthetic aperture radar raw data using compressed sensing, in IEEE Workshop on Statistical Signal Processing, 2007, pp. 448–452.
Crossref
[7]
Lustig M., Donoho D. L., and Pauly J. M., Rapid MR imaging with compressed sensing and randomly under sampled 3DFT trajectories, in Proceedings of the 14th. Annual Meeting of ISMRM, 2006.
[8]
Kirolos S., Laska J., Wakin M., and Duarte M., Analog to information conversion via random demodulation, in Proceedings of the IEEE Dallas Circuits and Systems Workshop, 2006, pp. 71–74.
Crossref
[9]
Laska J., Kirolos S., and Massoud Y., Random sampling for analog to information conversion of wideband signals, in Proceedings of the IEEE Dallas Circuits and Systems Workshop, 2006, pp. 119–122.
Crossref
[10]
Borgnat P. and Flandrin P., Time frequency localization from sparsity constraints, in IEEE Int. Conf. on Acoustics, Speech, and Signal Processing, 2008.
Crossref
[11]
Dai W. and Milenkovic O., Subspace pursuit for compressive sensing signal reconstruction, IEEE Trans. Inf. Theory, vol. 55, no. 5, pp. 2230–2249, 2008.
Crossref Google Scholar
[12]
Stuber C., Kuppinger P., and Pope G., Recovery of sparsely corrupted signals, IEEE Trans. Inf. Theory, vol. 58, no. 5, pp. 3115–3130, 2012.
Crossref Google Scholar
[13]
Wu R., Huang W., and Chen D. R., The exact support recovery of sparse signals with noise via orthogonal matching pursuit, IEEE Signal Process Lett., vol. 20, no. 4, pp. 403–406, 2013.
Crossref Google Scholar
[14]
Kong L. and Xia M., Data loss and reconstruction in wireless sensor networks, IEEE Transaction on Parallel and Distributed Systems, vol. 25, no. 11, pp. 2818–2828, 2014.
Crossref Google Scholar
[15]
Needell D. and Tropp J. A., CoSaMP: Iterative signal recovery from incomplete and inaccurate samples, Appl. Comp. Harmonic Anal., vol. 26, no. 12, pp. 93–100, 2008.
Crossref Google Scholar
[16]
Chen S. S., Donoho D. L., and Saunders M. A., Atomic decomposition by basis pursuit, SIAM J. Sci. Comput., vol. 58, no. 1, pp. 33–61, 1999.
Crossref Google Scholar
[17]
Tropp J. and Gilbert A., Signal recovery from random measurements via orthogonal matching pursuit, IEEE Transactions on Information Theory, vol. 53, no. 12, pp. 4655–4666, 2007.
Crossref Google Scholar
[18]
Freedman D., Pisani R., and Purves R., Statistics. Norton & Company, 1998.
Tsinghua Science and Technology
Volume 21 Issue 1,
February 2016
Pages 71-79
DOI: 10.1109/TST.2016.7399284
Cite this article:
Wang R, Zhang J, Ren S, et al. A Reducing Iteration Orthogonal Matching Pursuit Algorithm for Compressive Sensing. Tsinghua Science and Technology, 2016, 21(1): 71-79. https://doi.org/10.1109/TST.2016.7399284

571

Views

35

Downloads

27

Crossref

N/A

Web of Science

38

Scopus

14

CSCD

Altmetrics
Received: 12 September 2015
Revised: 13 October 2015
Accepted: 02 November 2015
Published: 04 February 2016
© The author(s) 2016
Return