Documente Academic
Documente Profesional
Documente Cultură
Abstract:
Image compression is the noticeable requirement of recent digital image processing strategies as
well as codes to save large digital images in small images. And for the same reason we need the image
compression algorithms which has optimum performance of compression without losing visual quality of
image. This paper presents an improved color image compression approach that has the ability to
compress the color image. The proposed approach divides the color image into RGB bands; each band is
selected to be divided. The division processes of the band into blocks are based on specific criteria with
non-overlapping. For each selection, the some operations are applied. A particular implementation of this
approach was tested, and its performance was quantified using the peak signal-to-noise ratio and similarity
index. Numerical results indicated general improvements in visual quality for color image coding.
C. Entropy Coding
The quantized values are then reordered The final DCT-based
based encoder processing step is
according to a zigzag pattern shown in Figures (3) entropy coding. This step achieves additional
and (4). compression losslessly by encoding the quantized
DCT coefficients more compactly based on their
statistical characteristics. The JPEG proposal
specifies two entropy coding methods Huffman
coding [7] and Run Length coding [5].
D. Run-length encoding
Run-length encoding is a data compression
algorithm that helps us encode large runs of
repeating items by only sending one item from the
run and a counter showing how many times this
item is repeated. Unfortunately this technique is
useless when
en trying to compress natural language
Fig. 3 The Quantization Table. texts, because they don’t have long runs of
To take advantage of the slow varying nature of repeating elements. In the other hand RLE is useful
most natural images, the DC coefficient is predicted when it comes to image compression, because
from the DC coefficient of the previous block and images happen to have long runs pixels with
differentially encoded with a variable length code. identical color. As you can see on o the following
The rest of the coefficients (referred to as AC picture we can compress consecutive pixels by only
coefficients) are run-length
length coded. JPEG produces replacing each run with one pixel from it and a
relatively good performance at medium to high counter showing how many items it contains [9].
coding rates, but suffers from blocking artifacts at
lower rates because of the block-based
based encoding.
following representations:
Fig 6. The results of proposed approach, left column represent the original
images, right column represent the compressed images.
REFERENCES
[1]. Pallavi N. Save and Vishakha Kelkar, “An
Improved Image Compression Method using
LBG with DCT”, IJERT Journal, Volume-
3,Issue-06, June-2014.
[2]. X. O. Zhao and Z. H. He, “Lossless image
compression using super-spatial structure
prediction,” Signal Processing Letters, IEEE,
vol. 17, no. 4, pp. 383–386, 2010.
[3]. W.M. Abd-Elhafiez, “Image compression
algorithm using a fast curvelet transform,”
International Journal of Computer Science and
Telecommunications, vol. 3, no. 4, pp. 43–47,
2012.
[4]. M. Sonka, V. Halva, and T.Boyle, “Image
Processing Analysis and Machine Vision”,
Brooks/Cole Publishing Company, 2nd Ed.,
1999.
[5]. F. Douak, Redha Benzid, Nabil Benoudjit “Color
image compression algorithm based on the DCT
transform combined to an adaptive block
scanning,” Int. J. Electron. Commun. (AEU),
vol. 65, pp. 16–26, 2011.
[6]. M. Mohamed Sathik, K.Senthamarai Kannan and
Y.Jacob Vetha Raj, “Hybrid Compression of