You are on page 1of 6

International Conference on Computing, Communication and Automation (ICCCA2015)

Image Reconstruction Using Modified Orthogonal


Matching Pursuit And Compressive Sensing
Meenakshi

Sumit Budhiraja

ECE, UIET, PANJAB UNIVERSITY


Chandigarh
meenakshi319@gmail.com

ECE, UIET, PANJAB UNIVERSITY


Chandigarh
sumitbudhiraja@gmail.com

AbstractCompressive sensing system merges sampling and


compression for a given sparse signal. It can reconstruct the
image accurately by using fewer linear measurements than the
original measurements. Hence, it is able to achieve reduction in
complexity of sampling and number of computations. Since
existing algorithms for implementation of sampling for the whole
image are time consuming and it requires huge storage space,
greedy approaches are used commonly to recover sparse signals
from fewer measurements. One of the commonly used greedy
approaches is Orthogonal Matching Pursuit (OMP), which can
iteratively reconstruct the image. In this paper, modified form of
OMP is presented in which stopping condition specified by the
Recovery condition and Mutual incoherence property is used on
the low frequency coefficients of the image. The simulation result
using modified OMP shows that the reconstructed image achieves
better PSNR and uses lesser number of measurements.
KeywordsCompressive Sensing; Orthogonal Matching
Pursuit; Sparsity; Image Recovery; Mutual Incoherence Property

I.

INTRODUCTION

Traditional technique of sampling uses Nyquist-Shannon


sampling theorem in order to reduce the signal deformation.
This theorem states that the band limited signal can be
perfectly reconstructed from the given number of samples if
the sampling rate is higher than the maximum frequency
present in the signal. The Nyquist-Shannon sampling theorem
is a sufficient condition for perfect reconstruction [1] but it is
not the necessary one. This process of sampling, compressing
and transmitting needs huge data storage, more number of
computational iterations which leads to the dissipation of
resources. In many practical applications, this method gives
low sampling efficiency and hence an effective breakthrough is
required.
Compressing Sensing (CS) was presented by D. L. Donoho,
E. Candes and T. Tao. It is the technique which is experiencing
an increasing interest now a day. Donoho shows that there is no
need to collect all the data when majority portion of the data
will be rejected. Hence, the requirement is to directly estimate
that part of data that won't end up being rejected [2].
Compressive sensing makes it realizable to directly measure the
required information about the image. CS theory enables the
recovery of sparse images from significantly few measurements
with a sampling rate much smaller than that of Nyquist
sampling rate. Compressive sensing is an effective technique to
measure required samples only that can carry maximum

ISBN:978-1-4799-8890-7/15/$31.00 2015 IEEE

information about the image. The feature of CS enables the


reduction in the requirement of storing the large number of
samples when they are actually not required. CS provides the
large number of applications in various areas, ranging from
image processing to medical imaging [3].
There are three major parts for CS paradigm: sparse domain
representation, measurement matrix and reconstruction
technique. For reconstruction, various techniques are available
to be combined with CS. In recent years, greedy algorithms
including its different variants have been proposed which are
capable of providing iterative and fast implementation of
reconstruction. Orthogonal Matching Pursuit (OMP) is very
effective greedy iterative reconstruction algorithm which is
popularly used due to its clarity and competitive
implementation. OMP selects the columns of the residual which
have maximum correlation with the current one at each step [4].
This selected column is then added into the defined set of
selected columns, which further provides the estimated output
and then iterates.
In this paper, the implementation of image reconstruction is
done by modified OMP and compressive sensing. The basic
purpose is to sample the original image using measurement
matrix and only low frequency coefficients are used. These
coefficients are then recovered using OMP under certain
termination rules which are derived from exact recovery
condition and Mutual Incoherence Property. This paper is
structured as follows. The section II provides previous work
done in the field of OMP. The Section III presents the
implementation of the compressive sensing and OMP. The
Section IV gives the implementation of modified OMP
approach. The conclusion is presented in Section V.
II.

PREVIOUS WORK

Compressive sensing accomplishes the objective of reducing


the huge storage memory requirements for random samples. E.
Candes, T. Tao and D. Donoho show that the sufficient
knowledge of the sparsity of image enables to reconstruct the
given image from lesser number of samples as comparison to
the sampling theorem. In recent years, a lot of research work has
been done on compressive sensing based image reconstruction
with OMP. The step wise implementation of OMP which
provides solution for underdetermined system of linear
equations was given by D. Donoho and E. Candes. The
Measurement matrices like Gaussian and Bernoulli required in
the implementation of CS have been studied by Tropp and

1073

International Conference on Computing, Communication and Automation (ICCCA2015)


Gilbert that can be utilised for the reconstruction algorithms in
order to sense the coefficients accurately [5]. The recursive
algorithm of OMP with CS has been introduced by Y. C Pati, R.
Rezalifal and P. S. Krishna Prasad to evaluate the representation
of the functions with respect to the atoms of fundamental
building block. The implementation of recovery of image from
random measurements with OMP have been proposed which
gives reduced running time for OMP as compare to that required
for
-norm procedure. This work requires only
)
measurements for -sparse image [6]. The segmented OMP
algorithm was later proposed by Hamid R. Rabiee, R.L.
Kashyap and R. Safavian. Later on, regularization of OMP i.e.
Regularised OMP algorithm was introduced which enables to
achieve the advantage of speed and accessibility. This algorithm
is capable of retrieving an image with
nonzero
measurements from the random information [7].The ROMP
algorithm was further modified in order to recover the image
from given inaccurate data. Then, the OMP algorithm was
implemented by T. Tony and Lie Wang for the reconstruction of
sparse image based on the small number of measurements in the
presence of noise. The factor of noise has been considered for
recovery using OMP in his work [8]. Then, OMP was
generalized to pick multiple indices rather than a single index
and provides the fast processing speed [9]. An adaptive
procedure in terms of OMP was proposed by Laura ReboulleNeira and David Lowe for reconstruction that constructs the
atoms taken from the dictionary. An approximation of signal is
provided that can minimize the residual norm for each iterative
step [10]. OMP was further modified so that it possesses the
property of faster implementation than the MP algorithm. Ling
Hua Chang and Jwo-Yuh wu have worked on upgraded RIP
based performance guarantee for sparse signal recovery via
OMP. The OMP has been implemented for image
reconstruction either directly or in the form of variants.
However, OMP can be further improved for image
reconstruction under the influence of bounded noise and
stopping rules.
III.

isi

where column vector y is a measurement vector of


coefficients
= , k in which =1, 2,..... . It is assumed
that the basis is orthogonal. If << elements of the column
vector are the only non-zero coefficients, then the signal is
called -sparse [11].
B. Measurement Matrix
Compressive Sensing requires the measurement matrix to be
incoherent with the sparsity basis, like wavelet basis. The
simple random binary matrix can be considered for its simple
advantages for example, its simplicity, higher sensing
efficiency. The measurement matrix should maintain the
required information of the original image during orthogonal
projection [12]. Donoho and Candes show that the measurement
matrix should satisfy the restricted isometry property [13]. To
any -sparse signal , should satisfy
1

(3)

The Gaussian random measurement matrix provides higher


sparse structure and simplicity because it is not correlated with
any sparse signal [14]. Hence, it is used commonly.
C. Reconstruction algorithm
The algorithm for reconstruction of an image must consider
M measurements in column vector y, random measurement
matrix , transform basis as the inputs for the algorithm. It is
capable of reconstructing the N dimensional image x or
equivalently its sparse form vector s. Consider the
measurement vector , {j=1 to } given as:
,

A. Sparse Represenatation
Sparsity intends to convey that the original image shows its
dense form in a particular basis, but after transformation into
other convenient domain, the coefficients of image offer a brief
summary. There are many signals that possess concise
representations when expressed in a suitable basis. In almost
every case, the coefficients of the transform (usually DCT,
Wavelet etc.) of an image provided are small and the transform
domain is sparse. Suppose we have a vector
RN (such as Ndimensional image) which can be expanded in an orthonormal
basis for example wavelet transform domain which can be given
as = [ 1, 2,........ N] as follows:

(2)

in which >0 and is known as restricted isometric constant,


M is the number of measurements used. The Gaussian random
matrix (H) which is used in this paper can be given as.

IMAGE RECONSTRUCTION USING OMP AND


COMPRESSIVE SENSING

Compressive Sensing or sparse sampling is an efficient


technique that provides means for reconstruction of the signal
from under-sampled data. Compressive sensing is a kind of
inverse problem that is capable of reconstructing a sparse signal
using a few measurements. In this kind of inverse problem,
main motive is to approximate the unknown image from lesser
number of given observation [1, 2].

(1)

(4)

(5)

Where
1, 2,....... N} is the measurement matrix of
size
, where << . Measurement matrix multiply x to
acquire only the required information from , so each column
of can be seen as a sensing column. Here, is the sensing
matrix that senses i.e. samples the compressed data at single
step [1].
In order to recover an image with compressive sensing there
are various techniques based on Basis pursuit (BP) which works
on the principle of norm and it provides valid results for
reconstruction of image but it exhibit slower running time for
the algorithm. The one of the popular recovery algorithm is
OMP which is quite faster than BP algorithm but also having
computational complexity.With the help of certain methods if
complexity can be lessen, then the OMP algorithm is far more
productive than BP in terms of total elapsed time and the
accurate recovery [4]. In previous research work of Rauhut
which shows the method of the OMP algorithm [15] and its
implementation for reconstructing the image from undersampled

1074

International Conference on Computing, Communication and Automation (ICCCA2015)


information given. This algorithm identifies the maximum
correlation between and the column of the residual, later it
selects those identified columns in a predefined set at each
iteration [16]. Therefore, the original image can be recovered
back by performing this algorithm. The steps for implementing
the OMP algorithm are given as follows [17].
Initialize the value of residual r0=y, the index set 0 =
and the iteration count k=0;
Select the index k =
, |. If for
. |
the multiple indices, maximum occurs then break the tie
deterministically.
Augment the index set

For acquiring the new approximation of the image,


solve the least square problem:

Observe the new estimate of the data and then calculate


the new residual:
= k ; = Increment the iteration count k, and go back to step 2
if
, is the sparsity level.
The approximation coefficients for the image have
nonzero indices at the elements listed in K.
IV.

MODIFIED OMP AND COMPRESSIVE SENSING

The Modified OMP is the modification of the iterative


OMP technique that enables the algorithm to reconstruct the
sparse image under certain conditions. In CS, firstly an image
is required to be represented in the sparse form. For sparse
representation, wavelet domain is commonly employed. In the
modified algorithm, the image is first of all disintegrated into
low frequency sub-bands and high frequency sub-bands and
the low frequency sub-band can be treated as the
approximation equivalent of the original image at different
scaling factor. If both the high and low frequency coefficients
are measured it will lead to large storage requirement and it
will also result in the destruction of correlation of the
coefficients. This paper proposes compressive sensing based
reconstruction algorithm using modified OMP in response to
above mentioned limitations. This algorithm not only reduces
memory requirements but also it works under the certain
condition provided by ERC (Exact Recovery Condition) and
MIP (Mutual Incoherence Property) in the presence of random
Gaussian noise [18, 19].
A. Stopping rules and properties
The mutual incoherence of can be referred to as the
value of the pair wise correlation between the columns of .
Tropp (2004) has provided the result for the noiseless case.
The mutual incoherence is defined by
(6)
max |i,j|
The MIP (mutual incoherence property) requires the value
of mutual incoherence to be small. It is shown that <

which is required for recovering K-sparse image. The MIP


condition is more prominent than ERC and RIP because it
states the validity of RIP and ERC but the converse is not true.
The next condition considered in this paper is ERC (exact
recovery condition) which states that for , let (t) be the set
of the columns of corresponding to the maximum
correlation. Define
-1
||

r||}1
(7)
M=max
The condition M<1 is called the Exact Recovery Condition
The condition M<1 is called the Exact Recovery Condition
(ERC) [20]. This condition is enough for the exact recovery of
the image. These conditions guarantee the recovery of the
selected set with higher success rate.
B. Modified OMP Algorithm
In this paper, a modified OMP is presented in recovering
the sparse signal based on the lesser number of linear
measurements, considers the following model as:
y= x +
(8)
where can be random noise vector like i.i.d Gaussian noise
vector. The sparse image is here recovered in the presence of
noise under the implication of stopping rules and their
property. The modified algorithm is shown as follows:
1) Consider an N x N image, Select suitable value of M
and construct the Measurement matrix (M x N).
Disintegrate the image into low frequency sub-band having Li
(i=1,2.....N), and high frequency coefficients Hi, Vi, Di
(i=1,2.....N).
2) The next step is to obtain the sparse form of the low
frequency coefficients only using CS. Recover the low
frequency coefficients using the modified OMP algorithm
under the certain stopping condition and its properties.
3) Set the residual r0 = y and initialize the set of
selected variables = . Suppose the iteration count k=1. The
other parameters can be specified as as Measurement Matrix
(M x N), x as the input image (N x N),
(N x N) as the
transform matrix.
4) The algorithm progresses further if it satisfies these
two conditions at each iteration step:
a) Mutual incoherence for should be a small value
(
1)
b) Estimated Residual > zero_threshold where
zero_threshold is the specified complex integer to ensure the
selection of significant columns only and iteration count
should be k < min {K, M/N}
5) Select the indices {
}i=1,2,3...N corresponding to N
k-1
.
largest entries in
6) Augment the set of selected variables: k = k-1
{ 1 ,..
}. Then, solve a least squares problem to
acquire a new image estimate:
(9)
k
2
7) Update the residual to recover the image:
(10)
Check if, M <1, then retrieve the recovered image:
(11)
2
set
1, go to step 5, otherwise stop the algorithm.

1075

International Conference on Computing, Communication and Automation (ICCCA2015)


V.

SIMULATION RESULTS

Compressive sensing combines the method of acquiring and


recovering a sparse signal in the competitive way possible
with the use of suitable transform domain like DCT, Fourier
transform, Wavelet Transform. In order to assess CS based
image reconstruction with Modified OMP; several 256 256
gray scale '.bmp' test images are considered in this paper. The
Gaussian measurement matrix i.e. an independent and
identically distributed matrix with zero mean and standard
deviation of 1/ for compressive sensing is used for all. All
simulations are done in MATLAB 7.6.0 set-up and the
experiments are run on a computer under Windows 7 with
Intel i5 CPU at 2.5 GHz and 6 GB. In this paper, results for
256 x 256 standard grayscale cameraman, peppers and Lena
images are depicted. The visual outcomes of the algorithm are
shown in Fig. 1, Fig. 2 and Fig. 3. It is observed that the
compressive sensing based image reconstruction with
Modified OMP provides better results within reduced running
time. The figures for reconstructed images using compressive
sensing
with
Gaussian
measurements
from
M=128,150,170,190 are shown. In Fig. 3, the reconstruction
result for the Modified algorithm is demonstrated for varying
sampling ratios i.e. M/N= {0.5, 0.6, 0.7, 0.8, 0.85}. These
results show that as the value of sampling ratios increases the
visual quality of the reconstructed images increases. The Fig.
1, Fig. 2 and Fig. 3 show that the Modified OMP is able to
recover the images for fewer sample measurements. Thus,
Modified algorithm reduces the requirement of large memory
storage. The Fig. 4 compares the reconstruction result of the
other existing techniques with the reconstruction result of the
Modified OMP. The comparative analysis shows that the
visual result of the Modified OMP is better as comparison to
the other techniques. The fine details of the images have been
recovered properly with Modified Technique. The parameters
PSNR and Running time have been used for evaluation of the
reconstructed images.

(a)

(b)

(c)

(d)

Fig.1 Reconstruction result of Modified OMP for cameraman image (a)


Original image (b) Image reconstructed with M=128 (b) Image
reconstructed with M=150 (c) Image reconstructed with M=170.

(a)

(b)

(c)

(d)

Fig.2 Reconstruction result of Modified OMP for image Lena (a) Original
image (b) Image reconstructed with M=170 (c) Image reconstructed
with M= 190 (d) Image reconstructed with M=220

(a)

(b)

(c)

(d)

(e)

(f)

Fig.3 Reconstruction result of Modified OMP for image peppers with


different sampling rate (M/N) (a) Original Image (b) Reconstruction
result for M/N=0.5 (c) Reconstruction result for M/N=0.6 (d)
Reconstruction result for M/N=0.7 (e) Reconstruction result for
M/N=0.8 (f) Reconstruction result for M/N=0.85

The results for PSNR and the comparative analysis are given
in Table I. The value of PSNR is compared for reconstructed
images at several measurements M x N (N=256). The quality
of image improves with increase in number of measurements,
M. Among these techniques, Modified OMP provides best
PSNR. The Modified algorithm ensures the selection of the
significant columns, thus eliminating the non-significant ones
due to certain stopping conditions. However, the recovery
performance becomes comparable for higher measurements.
Table II compares the running time of different algorithms
comparisons with that of Modified Algorithm. The table
shows that as the sampling rate (M/N) increases, the running
time increases.

1076

International Conference on Computing, Communication and Automation (ICCCA2015)


(a)

(b)

(c)

(d)

the captured observations. Modified OMP can be used


effectively to recover the sparse images. The recovery is done
with lesser number of captured measurements. Implemented
technique of OMP is performed under certain conditions and
stopping rules extracted from MIP (Mutual Incoherence
Property) and ERC (Exact Recovery Condition). The Modified
algorithm provides better values of PSNR and provides
feasible results in reduced running time for lesser number of
undersampled data provided.

(e)

Fig.4 Comparison of Reconstruction results of other techniques (a) Original


Image (b) Recovery result with Subspace Pursuit (c) Recovery result
with OMP (d) Recovery result with ROMP (e) Recovery result with
Modified OMP.
TABLE I. COMPARISON OF PSNR (IN DB)

M=128

M=150

M=170

M=190

Subspace Pursuit

25.76

26.49

26.90

27.07

OMP

26.44

28.23

30.72

32.63

25.33

26.45

28.04

ROMP

21.84

25.59

27.36

28.26

Modified OMP

32.09

31.87

32.09

33.67

OMP (DCT) [4]

[1]

[2]

PSNR(db)

REFERENCES

[3]

[4]

[5]

[6]

TABLE II. COMPARISON OF ELAPSED TIME (IN SEC)


Elapsed Time (sec)

M=128

M=150

M=170

M=190

Subspace Pursuit

52.38

58.20

74.92

77.39

OMP

4.64

5.02

5.26

5.29

Modified OMP

3.91

4.24

4.30

4.43

[7]

[8]

[9]

The modified OMP provides reconstruction results with better


PSNR using lesser number of measurements. The running time
for the algorithm is also reduced. However, the fine details
around edges are not well reconstructed for very lesser number
of measurements particularly for M less than 100. The Table I
and Table II show that even 150 captured samples are
sufficient to recover the image within the permissible limit of
PSNR. The value of PSNR is found to be 28.19 db in the
presence of random Gaussian noise for M=190 and the
running time is 11.45 seconds. The modified OMP is able to
work in the presence of noise and provides acceptable results.
VI.

CONCLUSION

[10]

[11]
[12]

[13]

[14]

This paper presents modification in OMP which is an


effective choice for signal recovery from random
measurements. In this paper, compressive sensing based image
reconstruction is implemented by applying OMP modified
conditions. The algorithm is implemented with the Gaussian
measurements having zero mean. The simulation results show
that the presented Modified OMP gives a rapid recovery using
fewer dimensions as comparison to the existing OMP
algorithms. Therefore, it allows only fewer storage spaces for

[15]

[16]

[17]

1077

Emmanuel J. Candes, Michail B. Wakin, "An Introduction to


Compressive Sampling", IEEE Signal Processing Magazine, pp. 21-30,
2008.
Donoho DL. "Compressed Sensing" IEEE Transactions on Information
Theory, vol 52,pp. 1289-1306, 2006.
Saad Qaisar, Rana Muhammad Bilal, Wafa Iqbal, Muqaddas Naureen
and Sungyoung Lee, "Compressive Sensing : From Theory to
Applications, a Survey"Journal of Communications and networks, vol
15, pp. 443-456, 2013.
Fan Yang, Shengqian Wanf, Chengzhi deng, "Compressive Sensing of
Image Reconstruction using Multi-wavelet Transforms" IEEE
International Conference, pp. 702-705, 2010.
Tropp, Gillbert, Signal recovery from random measurements via
orthogonal matching pursuit, IEEE Transactions On Inf Theory, Vol.
53, No. 12, Dec 2007
Y. C. Pati, R. Rezaiifar, P. S. Krishna prasad, Orthogonal matching
pursuit: Recursive function approximation with applications to wavelet
decomposition, in: Proc. 27th Asilomar Conference on Signals, Systems
and Computers, vol.1, Los Alamitos, CA, pp.4044 1993.
D. Needell , r. Vershynin, Uniform uncertainty principle and signal
recovery via Regularized orthogonal matching pursuit, IEEE
Transactions on information theory, July 2007
T. Tony Cai and Lie Wang, "Orthogonal Matching Pursuit for Sparse
Signal Recovery With Noise", IEEE Trans. on Information Theory, vol.
57, pp. 4680-4688,2011
Jian Wang, Seokbeop Kwon, Byonghyo Shim Generalised Orthogonal
Matching Pursuit, IEEE Transactions on Signal Processing vol. 60, pp.
6202- 6216, 2012
Rebollo-Neira, Lowe D, Optimized Orthogonal matching pursuit
approach, signal processing Letters, IEEE, Volume:9 Issue:4, April
2002.
Richard G. Baraniuk, Compressed sensing IEEE Signal Processing
Magazine July 2007
Zaixing HE, Takahiro OGAWA, and Miki HASEYAMA," The
Simplest Measurement Matrix for Compressed Sensing of Natural
Images", IEEE 17th International Conference on Image Processing, pp
4301-4304, 2010 .
Candes E J, Romberg, Tao T, "Robust uncertainty principles: exact
signal reconstruction from highly incomplete frequency information
theory", IEEE Transactions, vol. 52, pp. 489-509, 2006.
Candes E J, Tao T, "Decoding by linear programming information
theory", IEEE Transactions, vol. 51, pp. 4203-4215, 2005.
S. Kunis, h. Rauhat, Random sampling of sparse trigonometric
polynomials II: Orthogonal matching pursuit versus basis pursuit,
Applied and computational harmonic analysis journal, vol. 22, pp. 16-42,
2007.
Qiaoling Wu, Lin Ni, Delong He, "Improved Image Reconstruction
Based on Block Compressed Sensing", IEEE International Conference,
pp 1964-1966, 2012.
Joel A. Tropp, "Signal Recovery from Random Measurements Via
Orthogonal Matching Pursuit", IEEE Trans. on Inf. Theory, vol. 53, pp.
4655-4666, 2007.

International Conference on Computing, Communication and Automation (ICCCA2015)


[18] T.Tony Cai, Lie Wang, "Orthogonal Matching Pursuit for Sparse Signal
Recovery with Noise", IEEE Trans. on Inf. Theory, vol. 57, pp. 46804688,2011.
[19] Donoho DL, Elad M, Temlyakov VN. Stable recovery of sparse over
complete representations in the presence of noise.IEEE Trans Inf
Theory;52:618, 2006.
[20] J.A Tropp, "Greed is good: Algorithmic results for sparse approximation
",IEEE Trans. Inf. Theory, vol. 50, pp. 2231-2242,2004.

1078

You might also like