Академический Документы
Профессиональный Документы
Культура Документы
R.Praisline Jasmi
Department of ECE
Kalasalingam University
Virudhunagar, Tamil Nadu, India
praise.jas@gmail.com
Mr.B.Perumal
INTRODUCTION
Dr.M.Pallikonda Rajasekaran
Head of the Department of ECE
Kalasalingam University
Virudhunagar, Tamil Nadu, India
mpraja80@gmail.com
Department of ECE
Kalasalingam University
Virudhunagar, Tamil Nadu, India
palanimet@gmail.com
I.
two or more images of same size in that same disk it will not
be able to fit in a single disk. Thus, in order to transmit such
an image over 32.8 Kbps modem would almost take 6-10
minutes. The main purpose for this image compression is to
reduce the quantity of data that is essential for representing the
sampled digital images and hence reduce the cost for storage
space and communication. [1]
Input
Image
Forward
Transform
Quantization
Entropy
Encoding
Compressed Image
Fig 1. General Block Diagram of Image Compression
2015 International Conference on Computer Communication and Informatics (ICCCI -2015), Jan. 08 10, 2015, Coimbatore, INDIA
II.
ALGORITHMS USED
A) Huffman Coding
Huffman coding is an entropy encoding algorithm used for
lossless image compression. Huffman coding is efficient
technique for image compression to some extent. [1] The last
two decades has seen considerable improvements in image
and video compression techniques. Variable length coding,
such as Huffman code, is widely used to increase coding
efficiency. It uses the Huffman source-coding algorithm to
generate the uniquely decipherable Huffman code with a
minimum expected codeword length when the probability
distribution of a data source is known to the encoder. [2]
Entropy can be defined as a measure of information content; it
will be able to represent the amount of bits used in the data in
particular given image. Huffman coding uses a specific
method for choosing the representation for particular images
which results in a prefix code. The Compression of Images
and data is both possible using Huffman Coding Algorithm.
By using this Huffman algorithm we can be able to design the
most efficient compression method. Huffman Coding comes
under lossless technique here in lossless compression no
information is lost during Image Compression.
B) Fractal Algorithm
Fractal image compression comes under the type of lossy
compression among the two types in Image Compression
methods. The main idea in this algorithm is to divide the
image into segments by using standard image processing
techniques such as color partition, edging, and spectrum and
quality analysis. Then each segment in the given image is
looked up in a library of fractals. [6] Image compression
methods can also be divided as two different types namely,
symmetrical and asymmetrical. Fractal image compression is
the common example of asymmetrical methods. Image
Compression using this Algorithm takes less execution time to
compress the given 512512 images than Huffman Coding.
Fractal algorithm can be used to deal with both encoding and
decoding methods and here Fractal encoding is mainly used to
convert bitmap images to fractal codes. Two important
benefits are immediately observed by converting conventional
bitmap images to fractal data. The first is the ability to modify
the division of fractal images. The second benefit is that there
will be particular size of the data for each and every image and
this size of data in a given input image will be used to store
the fractal codes which are smaller than the size of original
data in an image. Then the process of matching fractal is done
with the fractal codes. This process will not look for exact
matches, but it will look for best fit matches based on the
compression parameters. Fractal compression algorithm is
entirely different from other lossy compression algorithms.
C) Discrete Wavelet Transform(DWT)
DWT plays an important role to compress the given image
without the loss of any information in that particular image.
DWT comes under lossless type of image compression. Here,
DWT can be mainly used in the transformation of a discrete
time signal to Discrete Wavelet Representation. DWT usually
based on time-scale representation, which can be able to
___________________________________
978-1-4799-6805-3/15/$31.00 2015 IEEE
LH3
HL3
HH3
HL2
HL1
LH2
LH1
HH2
HH1
III.
RELATED WORK
2015 International Conference on Computer Communication and Informatics (ICCCI -2015), Jan. 08 10, 2015, Coimbatore, INDIA
The simulation results for images are shown below and the
comparison tables are also included. The images with better
compression performance with the better CR and high PSNR
are included in the following figures.
PERFORMANCE PARAMETERS
,
,
MSE=
___________________________________
978-1-4799-6805-3/15/$31.00 2015 IEEE
2015 International Conference on Computer Communication and Informatics (ICCCI -2015), Jan. 08 10, 2015, Coimbatore, INDIA
C
R
V
a
l
u
e
s
Compression Ratio
45
CR
PSNR
MSE
BPP
Man
43.91
28.83
2.09
1.23
Lena
27.94
26.13
2.85
1.28
Bear
22.29
24.04
1.96
1.39
Apple
31.69
24.52
15.20
1.51
Grass
13.46
14.06
15.72
1.55
Penguin
29.21
22.30
19.62
0.95
35
30
25
Huffman
20
DWT
15
Fractal
10
5
Man
Lena
Bear
Apple
Grass
Algorithm
Parameters
CR
PSNR
DWT
MSE
BPP
Man
4.03
34.63
2.41
1.98
Lena
6.92
52.91
0.03
1.15
Bear
11.95
45.87
0.19
0.66
Apple
1.73
29.70
0.05
16.73
Grass
2.03
30.50
2.90
4.29
Penguin
1.54
32.94
2.62
8.36
Penguin
Input Images
PSNR
80
70
60
50
V
a
l
u
e
s
Huffman
40
P
S
N
R
Algorithm
Parameters
40
Huffman
30
DWT
20
Fractal
Fractal
CR
PSNR
MSE
BPP
Man
0.65
84.30
0.26
1.49
Lena
2.76
62.79
0.23
1.58
Bear
3.86
55.32
1.73
1.67
Apple
0.47
36.14
0.03
1.89
Grass
1.80
43.01
0.14
1.85
Penguin
1.31
36.44
0.81
1.64
10
0
Man
Lena
Bear
Apple
Grass
Penguin
Input Images
___________________________________
978-1-4799-6805-3/15/$31.00 2015 IEEE
CONCLUSION
In this paper we discussed about the comparison of
image compression techniques based on Huffman coding,
DWT and Fractal coding. Compressed images for different
input images are obtained by these three algorithms.
Parameters calculation is also done for the compressed image
and comparison chart is provided for Compression Ratio (CR)
and Peak Signal to Noise Ratio (PSNR). By comparing the
performance parameters of compressed image for these three
algorithms, we conclude that Fractal coding is efficient
technique for image compression. In this paper we evaluate
2015 International Conference on Computer Communication and Informatics (ICCCI -2015), Jan. 08 10, 2015, Coimbatore, INDIA
___________________________________
978-1-4799-6805-3/15/$31.00 2015 IEEE
[12] Xingsong Hou, Jing Yang, Guifeng Jiang, Xueming Qian, "Complex
SAR Image Compression Based on Directional Lifting Wavelet
Transform With High Clustering Capability," Geosciences and Remote
Sensing, IEEE Transactions on , vol.51, no.1, pp.527,538, January
2013.
[13] Karami A, Yazdi M, Mercier G, "Compression of Hyper spectral Images
Using
Discrete
Wavelet
Transform
and
Tucker
Decomposition," Selected Topics in Applied Earth Observations and
Remote Sensing, IEEE Journal of , vol.5, no.2, pp.444,450, April 2012.
[14] Singh H.K., Tomar S.K, Singh P, "Analysis of Multispectral Image
Using Discrete Wavelet Transform," Advanced Computing and
Communication Technologies (ACCT), 2013 Third International
Conference on , vol., no., pp.59,62, 6-7 April 2013.
[15] Chun-Lung Hsu; Yu-Sheng Huang; Ming-Da Chang; Hung-Yen Huang,
"Design of an Error-Tolerance Scheme for Discrete Wavelet Transform
in JPEG 2000 Encoder," Computers, IEEE Transactions on , vol.60,
no.5, pp.628,638, May 2011.