BMROMP: a fast algorithm of block compressed sensing
by Yongping Zhang; Lei Wang; Yan Liu; Jun Gao; Qiming Liu; Rong Chen
International Journal of Wireless and Mobile Computing (IJWMC), Vol. 15, No. 1, 2018

Abstract: Compressed Sensing (CS) is a method of signal sampling that can directly acquire the compressed form of original signal. However, its signal reconstruction needs to solve the optimisation algorithm with high computational complexity. This paper introduces a redesigned algorithm of block CS, Block More Relaxed Regularised Orthogonal Matching Pursuit (BMROMP), which is a fast reconstruction algorithm for 2D-signals based on Regularised Orthogonal Matching Pursuit (ROMP) algorithm. To reduce the consumption of computational resources when reconstructing 2D-signals with big-size, BMROMP uses the method of dividing blocks reconstruction. For the reconstruction of each block signal, like ROMP, BMROMP also uses the least-squares method, but relaxes the calculation of the most relevant atoms. It is realised by a newly defined parameter, regularised-entire-correlation. The parameter can help us obtain 2D reconstructed signal directly. The experimental results show that BMROMP has great performance advantage in the reconstruction speed, i.e., it can drastically reduce the execution time of the optimisation algorithm. This point is very useful in many scenarios of CS application.

Online publication date: Mon, 10-Sep-2018

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Wireless and Mobile Computing (IJWMC):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com