International Conference on Current Trends in Engineering and Technology, ICCTET13

341

Certain Investigation on Image Compression

Technique Using Wavelet Transform For
Telemedicine Application
S.Vairaprakash
Department of I&CE, Anna University,
Chennai, India.
nec_prakash@yahoo.co.in
AbstractIn this paper we propose on efficient region of
Interest coding technique based on [1]Multiwavelet
transform, set portioning in hierarchical Algorithm of
Medical Images. This new method reduces the importance of
Background coefficient of [2]ROI Code block without
compromising algorithm complexity. By using this coding
method the compressed Bit stream are all embedded and
suited for progressive Transmission. Extensive experimental
results show that the proposed algorithm gives better quality
of images using multi wavelets transform compared to that
of other scalar wavelet transforms. In this paper we took
512X512 original image. By using multiwavelet transform
we decomposed the original image in various levels, then the
original image is compressed in to 4:1 compression ratio and
also compared the performance of proposed method with
existing method. The performance of the system has been
evaluated based on bits per pixel(BPP),Peak Signal To Noise
Ratio(PSNR),Mean Square Error, [3](MSE),Compression
Ratio(CR),and Cross Correlation(CC).
Keywords Image Compression, Wavelet, Telemedicine.
1. Introduction
Digital image processing is the use of computer
algorithm to perform processing on images. Conventionally in
secure transmission of redundant data, the data is usually first
compressed and then encrypted at the sender side; to recover
the data at the receiver side and decryption is performed prior
to decompression. Image Restoration compensates for data
errors, noise and geometric distortions introduced during
the scanning, recording, and playback operations. Restoring
periodic line dropouts, Restoring periodic line striping,
filtering of random noise, Correcting [1]geometric distortions.
Image Enhancement alters the visual impact that the image has
on the interpreter in a fashion that improves the Information
content. Information extraction utilizes the decision-making
capability of the computer to recognize and classify pixels on
the basis of their digital signatures. Most often compression is
used to minimize storage space or for reducing transmitted
data over a network. By reducing the size of data transferred,
more bandwidth is available and transmission times are
reduced. To store or to transmit redundant data over an in
secure and bandwidth-constrained channel, it is customary to
firs encrypt the data and then compress it. Analysis and
compression of medical imagery is an important area of
biomedical engineering. The proposed Algorithm is Set
Partitioning In Hierarchical (SPIHT)[2] Algorithm with
multiwavelet function for medical images. Also we propose a
new algorithm based on Region of interest coding technique
using multi wavelet transform. This new method reduces the

IEEE 2013
IEEE 32107
July 3, 2013, Coimbatore, India.

Dr.A.Shenbagavalli
Department of ECE, National Engineering College,
Kovilpatti, India.
importance of background coefficients in the ROI code block
without compromising algorithm complexity. By using this
algorithm the compressed bit stream are all embedded and
suited for progressive transmission. Extensive experimental
results show that the proposed algorithm gives better quality if
images using multiwavelets compared to that of the scalar
wavelets.
Sonal et al addresses the area of image compression as
it is applicable to various fields of image processing. On the
basis of evaluating and analyzing the current image
compression techniques this paper presents the Principal
Component Analysis approach applied to image compression.
PCA approach is implemented in two ways PCA Statistical
Approach & PCA Neural Network Approach. It also includes
various benefits of using image compression techniques.
Image compression addresses the problem of reducing the
amount of data required to represent a digital image. It is a
process intended to yield a compact representation of an
image, thereby reducing the image storage and transmission
requirements.
Nayna Badwaik et al proposed a three dimensional
wavelet transform to hyper spectral images and in order to
compress hyper spectral data, it propose to use the three
dimensional version of the set partitioning in hierarchical trees
(SPIHT) algorithm, which has been successfully applied to 2
dimensional images. Colour images contain lot of data
redundancy and require a large amount of storage space. The
performance of different wavelets using SPIHT algorithm for
colour image compression R, G and B component of colour
image are converted to YCbCr before wavelet transform is
applied. Lena colour image is taken for analysis purpose.
Image is compressed for different bits per pixel by changing
level of wavelet decomposition[3]. Set Partitioning in
Hierarchical Trees (SPIHT) is a well-known state of the art
image compression algorithm based on wavelet transform
which gives high compression ratio, good signal to noise ratio
and high quality reconstructed images compared to other
classical algorithms. It supports images of 8, 16 or more bits,
gives. It is computationally very complex and hence the
execution time is high[4]. S.M.Ramesh et al offers a lossless
compression method for compression of medical images.
Method is based on wavelet decomposition of the medical
images followed by the correlation analysis of coefficients.
The correlation analyses are the basis of prediction equation
for each sub band. The method is applied on MRI and CT
images. The correlation coefficient is based on variance and
covariance. Covariance is always measured between two
matrices or dimensions while the variance is measured for a
dimension with itself. For storage requirements and
transmission bandwidth, it is desirable that the selection of

International Conference on Current Trends in Engineering and Technology, ICCTET13

transform should reduce the size of resultant data set as
compared to source data set. For continuous and discrete time
cases, wavelet transforms and wavelet packet transform has
emerged as popular techniques[5][6].
2. Proposed Methodology
Analysis and compression of medical imagery is an
important area of biomedical engineering. The proposed
Algorithm is Set Partitioning in Hierarchical (SPIHT)
algorithm with multiwavelet function for medical images.
Also we propose a new algorithm based on Region of interest
coding technique using multi wavelet transform.

342

(t)=[1(t),2(t),.,r(t)]T
(1)
Where, (t) is called the multi-scaling function.
Likewise the Multiwavelet function is defined from the set of
wavelet function,
(2)
When r=1, (t) is called a scalar wavelet or simply
called wavelet. Multiwavelets differ from scalar wavelet
systems in requiring two or more input streams to the
Multiwavelet filter bank. Multiwavelets are an extension of
the scalar wavelet to the vector case. As in the scalar wavelet
case, the theory of Multiwavelet is based on the idea of multi
resolution analysis (MRA). [7]The difference is that
Multiwavelet has several scaling functions. For Multiwavelets,
the notion of MRA is the same except that now a basis for V0
and V1 is generated by translates of N scaling functions,
1(t-k),2(t-k).N(t-k)

(3)

The multi scaling function and the Multiwavelet

function will satisfy matrix dilation as in the following
equations[7].
(t)=
(t) =

Fig.1 Proposed Methodology Procedure

A. Multiwavelet
Multiwavelets are defined using several wavelets with
several scaling functions. Multi wavelets have several
advantages in comparison with scalar wavelet. The features
such as compact support, orthogonally, symmetry, and high
order approximation are known to be important in signal
processing. A scalar wavelet cannot possess all these
properties at the same time. On the other hand, a Multiwavelet
system can simultaneously provide perfect reconstruction
while preserving length (Orthogonally), good performance at
the boundaries (via linear-phase symmetry), and a high order
of approximation (vanishing moments). Thus Multiwavelet
offer the possibility of superior performance and high degree
of freedom for image processing applications, compared with
scalar wavelets. A Multiwavelet with r scaling functions and r
wavelet functions is said to have multiplicity r. When r = 1,
one scaling function and one wavelet function, the
Multiwavelet system reduces to the scalar wavelet system.
Multiwavelets have two or more scaling functions and wavelet
functions. For notational difference the set of scaling functions
can be written using the vector notation,

IEEE 2013
IEEE 32107
July 3, 2013, Coimbatore, India.

K(2t-k)
k(2t-k)

(4)
(5)

The filter coefficients Hk and Gk are N by N matrices

instead of scalar. Corresponding to each Multiwavelet system,
there is a matrix-valued multi-rate filter bank. A Multiwavelet
filter bank has taps that are N N matrices. The 4coefficient symmetric Multiwavelet filter bank whose low
pass filter is given by the four N N matrices named C.
Unlike a scalar 2-band Para unitary filter bank, the
corresponding high pass filter specified by the four N N
matrices named D, cannot be obtained simply as an
alternating flip of the low pass filter; the wavelet filters D
must be designed. The resulting N channel, N N matrix filter
bank operates on N input data streams, filtering them into 2N
output streams, each of which is down sampled by a factor of
2. This is shown in Fig.2

Fig.2 Decomposition of the Signal

B. Pre-Processing for Multiwavelets
Aside from decomposition concerns, there is another
issue to be addressed when multiwavelets are used in the
transform process. [8]Multiwavelet filter banks require a
vector-valued input signal. There are a number of ways to
produce such a signal from 2-D image data. Perhaps the most
obvious method is to use adjacent rows and columns of the

International Conference on Current Trends in Engineering and Technology, ICCTET13

image data; this has already been attempted. However, this
approach does not work well for general multiwavelets and
leads to reconstruction artifacts in the low pass data after
coefficient quantization. This problem can be avoided by
constructing Constrained multiwavelets, which possess
certain key properties. Unfortunately, the extra constraints are
somewhat restrictive; image compression tests show that
constrained multiwavelets do not perform as well as some
other multifilters. Another approach is to first split each row or
column into two half-length signals, and then use these two
half signals as the channel inputs into the multifilter. A native
approach is to simply take the odd samples for one signal and
the even samples for the second signal.
As Strela points out, this approach doesnt work well
because it destroys the assumed characteristics of the input
signal. It is generally presumed that image data will be locally
well-approximated by low-order polynomials, usually
constant, linear, or quadratic. The high pass filters are
designed to give a uniformly zero output when the input has
this form. Taking alternating data points as the filter inputs
alters the character of the input signal; hence the filter output
will no longer be forced to zero, reducing compression
performance. But there is a way around this problem: one may
first pre-filter the two half-length signals before passing them
into the multifilter. The prefilter step adjusts the input signal
properties so that one scalar signal is split into two half-length
signals in such a way that the orders of approximation built
into the multifilter are utilized. [9]The prefiltering is generally
performed by taking the two signals as a 2N matrix (where
the original 1-D signal had length 2N) and then left
multiplying by one or more 22 prefilter matrices. Note that
the earlier methods have some limitations, such as being tied
to a specific multifilter or requiring more than one prefilter
matrix, present a method that requires only a single orthogonal
prefilter matrix for any given multifilter.
Additionally, their method also provides some
optimization of the prefilter properties to match any given
multifilter. When applied to the class of symmetric
antisymmetric (SA) multiwavelets, produces a prefilter matrix
with entries of equal magnitude[10]. If the overall constant
were absorbed into the multifilter itself, then the preprocessing
operation would require no multiplications and only two
additions for each input vector. Naturally, there is a matching
postfilter operation in the synthesis stage that exactly undoes
the effects of the prefilter.
C. SPIHT Algorithm
The set partition in hierarchical trees(SPIHT) coding
algorithm was proposed by said and Pearlman. SPIHT
quantizer achieves good performance by explotting the spatial
dependencies of pixels in different sub band so scalar wavelet
transform. The method deserves good image quality, high
PSNR, Especially for colour images. It has been noted that
there exists a spatial dependence between pixels in different
sub bands in the form of a child-parent relationship. The coder
starts with a threshold value that is the largest integer power of
two that does not exceed the largest pixel value. Pixel values
are evaluated in turn to see if they are larger than the
threshold, if not, these pixels are considered in significant. If a
parent and all of its descend ants are insignificant, then the
code rmerely records the parents coordinates. Since the
childrens coordinates can be inferred from those of the
parent, those coordinates are no trecorded, resulting in a

IEEE 2013
IEEE 32107
July 3, 2013, Coimbatore, India.

343

potentially great saving sin the output it stream. The parent

childrelationshipinthisschemeshowninfig.1.Afterlocating and
recording all the significant pixels for the given threshold, the
threshold is reduced.

Fig.3 Basic Flow Chart of SPIHT

Set Partitioning in Hierarchical Trees (SPIHT)[10] is a
well-known state of the art image compression algorithm
based on wavelet transform. It is a lossy compression
technique which gives compression performances as good as
other classical algorithms. It supports images of 8, 16 or more
bits, gives high compression ratio, good signal to noise ratio
and high quality reconstructed images. The algorithm is
computationally very complex and hence the execution time is
high. We present an improved method of compression using
SPIHT algorithm by reducing the computational complexity
and time complexity. This is done by omitting the entropy
coding of the bit stream and compensating for the same by
increasing the number of sorting passes. The PSNR values
obtained by the proposed method are comparable to the
original SPIHT algorithm.
In sorting pass, we first initialize LSP to be empty, add
coordinates to LIP and those with decedents to LIS. Define the
value of n aslog2 [max(c(i, j))]. For each entry in LIP,
magnitude test is carried out. If the value is greater
thanthreshold 2 power n, moved to LSP, else LIP and move to
next sorting pass .B. Process LIS: The list of insignificant sets
is taken into consideration. The entry may be of type A or type
B .the seta are evaluated in such a way that if it is found to be
significant, it is removed from the list and partitioned. The
new subsets with more than element are added back to LIS
while the single coordinate sets are added to LIP or LSP
depending on the output of magnitude test. Now for each entry
in the significant pixel list (LSP), the nth most significant bit
of the coordinate is taken as output. Fig.3 shows the basic
flowchart of SPIHT.
The value of n is decremented by 1 and sorting pass is
done again. At end of the encoding process, all the significant
pixels are in the LSP and the pixels in the LIP are discarded,
the LIS is empty. In the refinement pass, the n-th bit of all LSP
members four significant at thresholds greater than 2n is taken
as the output. In the proposed technique, the arithmetic coding
which is done after the refinement pass is removed to reduce
the computational complexity. To compensate the coding
efficiency, we increase the levels of decomposition which in
turn increases the number of sorting passes in the algorithm.
The entries in the LSP are given as input to the decoder. The
decoder algorithm does the exact opposite procedure of the
encoding algorithm, using the same three lists. The decoder
receives the largest level that the encoder finds and outputs it

344

International Conference on Current Trends in Engineering and Technology, ICCTET13

first. The decoder does an additional job of constructing the
image using wavelet reconstruction filters. The PSNR value is
calculated and compared with the values of original SPIHT
algorithm.
[11]SPIHT is an efficient wavelet based image
compression algorithm with many unique and desirable
properties such as multi resolution scalability, adaptability and
gives high quality reconstructed images. The main drawback
of the technique is its complexity in computation and high
execution time. The proposed code omits the arithmetic
coding step which reduces the complexity of the algorithm in
turn reducing the execution time. To compensate for the same,
the number of sorting passes is increased. The performance of
the SPIHT based compress von algorithm is hence improve
without compromising on the PSNR the basic concepts of the
SPIHT algorithm. The SPIHT algorithm is essentially a
wavelet transform-based encoding technique.

Peak Signal to Noise ratio and cross correlation is the

important technical evaluation parameter in Image. Table I
compares SNR and Cross correlation values of various
Multiwavelet filters.

3. Results And Discussion

In this project, an important research challenge is to
improve the visual quality of the image in order to reduce the
transmitting time in communication process. This project
describes new methods for image compression for noise
suppression and edge enhancement based on the Multiwavelet
transform. The image preprocessing was designed to enhance
the local contrast in dense regions adaptively. The image
compression process also is adaptive and the selection of a
peak signal to Noise ratio factor provides the desired and
detailed enhancement of images. Our multiwavelet approach
was designed to avoid introducing artifacts in the enhancement
process, which is very important when analyzing digital image
compression. The preliminary results indicate that our
proposed method improves the PSNR and Cross correlation.
The experiments were conducted to study the suitability of
different Existing wavelet and proposed multi-wavelet bases
and also different Image sizes. Experimental results also show
that multiwavelet with soft threshold gives better results than
existing method like wavelet.

Fig.6 Encrypted image

Fig.7 Reconstruced Image

Fig.9 Performance Criteria Curve

Fig.4 Original Image
For the implementation purpose we have selected the
original image with size 512 X 512. Fig.4 shows original
image.

Fig.5 Decomposed image

IEEE 2013
IEEE 32107
July 3, 2013, Coimbatore, India.

Table 1. Summary Of The Technical Parameters Evaluation

Time
Technical
Parameters

Existing Methods

Proposed
Method

PSNR
MSE
CR
CC

26.50
65.50
80.50
92.96

37.32
57.50
87.50
97.97

In this project we taken a 512512 original image.By

using multiwavelet transform we decomposed the original
image in varoious levels,then the original image was

International Conference on Current Trends in Engineering and Technology, ICCTET13

compressed into 7:1 compressed Ratio.In our proposed
metheodology we compare technical parameters like peak
siginal to noise ratio,mean square error ,compression ratio and
cross correlation with the existing method.From those
observation Multiwavelet transform is suitable for image
compression in real time Application.
4. Conclusions
This paper summarizes the outcome of the
implementation work developed for compression in Digital
images. The details of existing method are analyzed and
present their comparative evaluation in terms of various
technical parameters like peak signal to noise ratio, correlation
factor, Mean square error and compression ratio. Compression
is the process of identifying and reducing size of the image
without changing the quality. The main objective of the
compression is to reduce the image size of original image
without loss of information. In this project multiwavelet based
novel Approach was implemented and its output performances
are discussed. The major contributions of this project are
improvement in image quality, High peak signal to noise ratio
value, Reduction in the time in Compression process,
Correlation achievement, better compression ratio.
The concluding remarks of the compression methods
are stated as follows, It can be seen from the experiments that
it can successfully reduce the size from original size.
Multiwavelet method has outperformed compared to Wavelet
Transform as far as PSNR concerned. Multiwavelet method
has outperformed compare to Wavelet Transform as far as
correlation factor concerned. It can be seen from the
experiments the Quality of the image has been high
improvement. Based on these results it can be concluded that
Multiwavelet transform has an overall performance which is
better than exsisting methods like Wavelet i.e. Multiwavelet is
the most consistent and robust compression method.
[1]

[2]

[3]

[4]

[5]

[6]

References
R.Sumalatha, M.V.Subramanyam, Medical Image
Compression Using Multiwavelets For Telemedicine
Applications, International Journal of Scientific &
Engineering Research, Vol. 2, Issue 9, September2011.
Rehna. V.j, shubhangi, vasanthi, Improving the
Performance of Wavelet
Based image
compression Using Spiht Algorithm, IR Net
Transactions on Electrical and Electronics Engineering
(ITEEE) ISSN 2319 2577, may-2012.
Sadashivappa K.V.S, AnandBabu, Dr.Srinivas K,
Color Image Compression using SPIHT Algorithm,
International Journal of Computer Applications (0975
8887) Volume 16 No.7, February 2011.
V.JinoShiny,Balashanmugavadivu,Geometric wavelet
and binary space Partition algorithm for image
compression,
International
Journal
of
Communications and Engineering Volume 04 No.4,
Issue 02, March 2012.
Sachin Dhawan, A Review of Image Compression and
Comparison of its Algorithms,International Journal of
Electronics & Communication Technology IJECT Vol.
2, Issue 1, March 2011.
Tripatjot Singh, Sanjeev Chopra, Harman preetKaur,
AmandeepKaur Image Compression Using Wavelet

IEEE 2013
IEEE 32107
July 3, 2013, Coimbatore, India.

[7]

[8]

[9]

[10]

[11]

345

and Wavelet Packet Transformation, IJCST Vol. 1,

Issue 1, September 2010.
Sudhakar.R,
and
Jayaraman.S
Fingerprint
Compression Using Multiwavelets, International
Journal of Information and Communication
Engineering vol.2, issu 02, march 2006.
Michael B. Martin and Amy E. Bell, Member,
IEEENew Image Compression Techniques Using
Multiwavelets and Multiwavelet Packets, ieee
transactions on image processing, vol. 10, no. 4, april
2001.
M. Sifuzzaman, M.R, Islam and M.Z, Ali Application
of Wavelet Transform and its Advantages Compared to
Fourier Transform, Journal of Physical Sciences, Vol.
13,
2009,
121-134
ISSN:
0972-8791:
idyasagar.ac.in/journal 121.
S.Esakirajan,T.Veerakumar,V.SenthilMurugan,
P.Navaneethan,
Image
Compression
Using
Multiwavelet And Multi-Stage Vector Quantization,
WASET International Journal of Signal Processing
Volume 04, Issue: 04, 2008.
Satish K. Sing, Shishir Kumar, Mathematical
transforms and image compression: A review,Maejo
Int. J. Sci. Technol. 2010, 4(02), 235-249.