Professional Documents
Culture Documents
www.ijcsit.com 1509
B. Kranthi et al, / (IJCSIT) International Journal of Computer Science and Information Technologies, Vol. 5 (2) , 2014, 1509-1515
the quantization stage which intentionally discards less explained in Section 4. Section5 shows results on the
related parts of the image information [1]. Over the past performance metrics and provides comparisons with the
few years, a variety of novel and sophisticated wavelet- SPIHT coder. Finally Section 6 concludes the paper.
based image coding schemes have been developed. They
are 2. LITERATURE SURVEY
The authors Albertus Joko Santoso et al. considered the test
• Embedded Zero tree Wavelet (EZW), images of size 512x512 and analyzed with different
• Set-Partitioning in Hierarchical Trees (SPIHT), wavelets like Daubechies, Coiflet and Symlet with the
• Set Partitioned Embedded block coder (SPECK), objective of achieving high PSNR and compression ratio.
• Wavelet Difference Reduction (WDR), The result analysis proved that Haar wavelet attains highest
• Adaptively Scanned Wavelet Difference Compression Ratio and PSNR than Coiflet and Symlet
Reduction (ASWDR), wavelets [3].
• Space –Frequency Quantization (SFQ), The authors S.Narasimhulu et al. proposed lossy image
• Compression with Reversible Embedded Wavelet compression algorithm which is simple and effective for
(CREW), gray-scale image compression with the combination of
• Embedded Predictive Wavelet Image Coder (EPWIC), Huffman coding and proposed to extend the work for the
• Embedded Block Coding with Optimized Truncation color image and video compression [4].
(EBCOT),
Anuj Bhardwaj et al. compared different image
• Stack- Run (SR).
compression techniques like Haar Transform (HT), Fast
SPIHT introduced in [13] is an enhancement of EZW Haar Transform (FHT), and Modified Fast Haar Wavelet
algorithm. By adopting set partitioning algorithm and Transform (MFHWT) on the basis of the Compression
exploring self-similarity across different scales in an image Ratio and PSNR. The results illustrates that the MFHWT
wavelet transform, SPIHT algorithm reaches high has characteristics like sparse representation and fast
compression performance. With SPIHT, the image is first transformation and easy to implement. The comparison
decomposed into a series of wavelet coefficients. Those results showed that the quality of reconstructed image is
coefficients are then grouped into sets known as spatial high in MFHWT [5].
orientation trees. After that, the coefficients in each spatial Kiran Arora et al. compared the image compression
orientation tree are encoded progressively from the most algorithms HT, FWT, MFHWT on the basis of processing
significant bit planes to the least significant bit planes, time. The results showed that the time taken by MFHWT is
starting with the coefficients with the highest least as compared to HT and FHT while compression [6].
magnitude [14]. The authors Navjot Kaur et al. proposed a new method of
As with EZW, the SPIHT algorithm involves two coding image compression using SPIHT and MFHWT and they do
passes: the sorting pass and the refinement pass. The not implement [7]. The authors Ms.MansiKambli et al.
sorting pass looks for zerotrees and sorts significant and proposed a modified SPIHT algorithm and implemented on
insignificant coefficients with respect to a given threshold. gray scale fingerprint images to analyze the PSNR
And the refinement pass sends the precision bits of the vales [8].
significant coefficients. After one sorting pass and one
refinement pass, which can be considered as one scan pass, 3. PROBLEM STATEMENT
the threshold is halved, and the coding process is repeated The objective of this work is to minimize the memory
until the expected bit rate is achieved. SPIHT achieves very requirement by achieving high compression ratio without
compact output bit stream and low bit rate than that of its degrading the quality of image by using both lossy and
predecessor’s EZW without adding an entropy encoder, lossless compression techniques. Also, the compression
which allows its efficiency in terms of computational techniques reduce the delay and consume less power by
complexity. Moreover, it uses a subset partitioning scheme transmitting the compressed data. The compressed
in the sorting pass to reduce the number of magnitude information resembles a scramble message and an attacker
comparisons, which also decrease the computational in middle cannot able to understand. Therefore, the data
complexity of the algorithm. Finally, the progressive mode compression not only reduces the size of the original data,
of SPIHT allows the interruption of coding/decoding but also gives data security.
process at any stage of the compression [2]. Despite these
advantages, SPIHT presents the limitations like large 4. OVER VIEW OF PROPOSED METHOD
memory and delay shortcomings. To minimize these The block diagram of the proposed work is shown in the
limitations, a novel technique is proposed by enhancing the Figure 1. The original image is compressed using Enhanced
SPIHT algorithm with the combination of Run Length Set-Partitioning in Hierarchical Trees (ESPIHT) image
coding for image compression. compression technique which is the combination of
Modified Fast Haar Wavelet Transform (MFHWT) &
The rest of this paper is organized as follow. The next SPIHT and lossless Run Length coding (RLC) techniques.
section, Section2, gives an outline of the related works on At receiver the compressed image is decompressed by
image compression. The Section 3 gives the objective of reverse operation.
the proposed algorithm. The ESPIHT algorithm is
www.ijcsit.com 1510
B. Kranthi et al, / (IJCSIT) International Journal of Computer Science and Information Technologies, Vol. 5 (2) , 2014, 1509-1515
www.ijcsit.com 1511
B. Kranthi et al, / (IJCSIT) International Journal of Computer Science and Information Technologies, Vol. 5 (2) , 2014, 1509-1515
L0 L1 L2 L3 L4 L2 L0
-1 5.25 3 6 5.25 -1
-2.75 6 5 -2.75
-0.75 2 9 -0.75
2.5 7 8 2.5
Data/node -1 7 -1
Approximate coefficient
1.5 2 1.5
-2 4 -2
Detail coefficient
0.5 8 0.5
Averaging two nodes
2.5 1 2.5
Differencing two nodes
-2 3 -2
Differencing four nodes
-1 9 -1
2 5 2
www.ijcsit.com 1512
B. Kranthi et al, / (IJCSIT) International Journal of Computer Science and Information Technologies, Vol. 5 (2) , 2014, 1509-1515
www.ijcsit.com 1513
B. Kranthi et al, / (IJCSIT) International Journal of Computer Science and Information Technologies, Vol. 5 (2) , 2014, 1509-1515
MSE
5
4
3
2
1
0
image image image image image image
1 2 3 4 5 6
SPIHT 4.397 5.437 8.262 6.058 2.497 9.317
ESPIHT 2.72 3.599 5.776 4.155 1.062 6.113
50
PSNR (dB) 40
Fig 5: Results of image compression
(a) Original image (b) SPIHT and (c) ESPIHT 30
algorithms 20
www.ijcsit.com 1514
B. Kranthi et al, / (IJCSIT) International Journal of Computer Science and Information Technologies, Vol. 5 (2) , 2014, 1509-1515
www.ijcsit.com 1515