Professional Documents
Culture Documents
www.iaetsd.in
INTRODUCTION
Image compression is very important for efficient
transmission and storage of images. Demand for
communication of multimedia data through the
telecommunications network and accessing the multimedia
data through Internet is growing explosively. With the use
of digital cameras, requirements for storage, manipulation,
and transfer of digital images, has grown explosively.
These image files can be very large and can occupy a lot of
memory. A gray scale image that is 256 x 256 pixels has 65,
536 elements to store, and a a typical 640 x 480 color image
has nearly a million. Downloading of these files from
internet can be very time consuming task. Image data
comprise of a significant portion of the multimedia data and
they occupy the major portion of the communication
bandwidth for multimedia communication. Therefore
development of efficient techniques for image compression
has become quite necessary. A common characteristic of
most images is that the neighboring pixels are highly
correlated and therefore contain highly redundant
IMAGE COMPRESSION
The need for image compression becomes apparent
when number of bits per image is computed resulting from
typical sampling rates and quantization methods. For
example, the amount of storage required for given images is
(i) a low resolution, TV quality, color video image which
has 512 x 512 pixels/color,8 bits/pixel, and 3 colors
approximately consists of 6 x 10 bits;(ii) a 24 x 36 mm
negative photograph scanned at 12 x 10mm:3000 x 2000
pixels/color, 8 bits/pixel, and 3 colors nearly contains 144 x
10 bits; (3) a 14 x 17 inch radiograph scanned at 70 x
10mm: 5000 x 6000 pixels, 12 bits/pixel nearly contains
360 x 10 bits. Thus storage of even a few images could
cause a problem. As another example of the need for image
compression, consider the transmission of low resolution
512 x 512 x 8 bits/pixel x 3-color video image over
telephone lines. Using a 96000 bauds (bits/sec) modem, the
transmission would take approximately 11 minutes for just a
single image, which is unacceptable for most applications.
www.iaetsd.in
www.iaetsd.in
N 1
Th
0 k, l N 1
e low-low sub band xLL (m,n) of the image be obtained as:
x LL ( m , n )
1
4
{ x ( 2 m , 2 n ) x ( 2 m 1, 2 n )
( 2 m , 2 n 1) x ( 2 m 1, 2 n 1 )},
0 m,n
N
2
1.
Let CLL (k,l), 0 < k,l < N/2-1 be the 2D DCT of xLL(m,n).
Then the sub band approximation of DCT of x(m,n) is given
by:
k l
cos
). The definition of inverse
2N 2N
case 4 cos
EXPERIMENTAL RESULTS
Experimentations are carried out for studying the
performances of the three different images compressed at
different levels. In the context of the JPEG compression, the
effect of quantization on the approximated coefficients
during image-halving or image-doubling should be observed
here. The PSNR values for different compression levels for
the Building, BMW car, and Peacock images were plotted in
Figures as shown below. The performance of Bit Rate,
Mean Square Error, Signal to Noise Ratio, PSNR values for
the images is also tabulated.
www.iaetsd.in
PEACOCK
100
BMW CAR
50
BUILDING
0
0.5
0.75
Image
BMW
Car
Bit
Rate
(bps)
Mean
Square
Error
Signal
To
Noise
Ratio
(db)
PSNR(db)
0.5
0.75
1
2
4
0.5
0.75
1
2
4
0.5
0.75
1
2
4
114.6
60.9
47.9
6.6
0.2
36.5
175.9
124.6
30.8
0.9
302.2
232.2
164.5
33.9
2.5
13.7
16.4
17.5
26.1
42.4
14.1
15.4
16.9
23.0
38.6
9.4
10.5
12.0
18.9
30.2
27.5
30.3
31.3
39.9
56.2
24.4
25.7
27.2
33.2
48.8
23.3
24.5
26.0
32.8
44.2
www.iaetsd.in
CONCLUSION
[9]
REFERENCES
[1] A.
M.
Shams,
a.
Chidanandan,
w. Pan, and m. A.Bayoumi, NEDA: A LowPower High-PerformanceDCT rchitecture,
IEEE trans. Signal process. vol.54, no. 3, pp.
955964, mar. 2006.
[2] M. R. M. Rizk and m. Ammar, Low Power
Small Area High Performance 2D-Dct
Architecture, in proc. Int. Design test
workshop, 2007, pp. 120125.
[3] C. Peng, X. Cao, D. Yu, and X. Zhang, A 250
MHz
Optimized
D is tr i bu t ed
A r c h i t e c t u r e O f 2 D 8 x 8 D C T , in Proc.
Int. Conf. ASIC, 2007, pp. 189192.
[4] Shinsuke Kobayushi, Kenturo Mita Graduate
S c h o o l of Engineering Science, Rapid
prototyping of jpeg encoder using the asip
development systempeas-111 Osaka University
0-7803-7663.
[5] L.V. Agostini, I.S. Silva, and S. Bampi. Pipelined
fast 2d DCT architecture for JPEG image compression. In Integrated Circuits and Systems Design, 2001, 14th Symposium on, pages 226231,
Pireno polis, Brazil, 2001.
[6] Yun-Lung Lee, Jun-Wei Yang,
and Jer
Min Jou Design of a Distributed
JPEG
Encoder on a Scalable NoC Platform
Department of Electrical
Engineering,
National
Cheng Kung University, No.1,
University Road, Tainan, Taiwan, R.O.C. 978-14244-1617-2/08/S25.00 2008IEEE.
[7] Telagarapu, Prabhakar, et al. Image Compression
Using DCT and Wavelet Transformations
International Journal of Signal Processing, Image
Processing and Pattern Recognition 4.3 (2011).
[8] Elamaran, V., and A. Praveen. Comparison of
DCT and wavelets in image coding Computer
Communication and Informatics (ICCCI), 2012
International Conference on. IEEE, 2012.