A Novel Lossy Image C Ompression Based On Color Prediction Technique

International Journal of Application or Innovation in Engineering & Management (IJAIEM)
Web Site: www.ijaiem.org Email: editor@ijaiem.org

Volume 5, Issue 8, August 2016
ISSN 2319 - 4847
A Novel Lossy Image Compression Based On

Color Prediction Technique
PL.Chithra
Department of Computer Science, University of Madras, Chennai -600 005, India
ABSTRACT
In this paper, a novel lossy image compression technique based on color prediction and Huffman encoding is proposed. The
proposed color prediction technique handles the color planes separately and built pixel by pixel through a raster scan order. A
color map is generated based on color difference by using the predefined threshold. This color map is encoded by using
Huffman encoding. The predicted colors are stored separately as header information along with the encoded stream.
Experimental results show that as threshold increases, the compression ratio of the proposed system also increases although
PSNR decreases. The proposed method is extensively tested with well known test images. Simulation results show that the
proposed compression scheme can achieve a better compression performance.
Keywords: Color image compression, Huffman coding, thresholding, Color prediction
I. INTRODUCTION
The color image compression becomes mandatory because of the splendid use of color images in the field of
multimedia and internet applications. In a digital true color, each color component is quantized with 8 bits, and so a
24
color is specified with 24 bits. There are 2 possible colors for the image. The Human visual system cannot
differentiate many colors. A color image contains a lot of data redundancy and requires a large amount of storage
space. Thus compression is required to reduce the storage and transmission cost of color images. When focusing the
color image compression, various methods have been proposed. Some of them are based on the direct methods acting
by the direct processing of image samples such as the block truncation [2-4], the other techniques based on the vector
quantizationj [5,6], the others are based on the transformations like DCT[7-9],wavelets[10-12] and PCA. [13].
Dhara and Chanda[4] focused a color image compression based on block truncation coding using pattern fitting
principle. Feng and Nasrabadi[5] described a dynamic address- vector quantisation of RGB colour images. Lee and
Chan[6] presented a dynamic finite state VQ of colour images using stochastic Learning. Makrogiannis et al.,[7]
proposed Region oriented compression of colour images using fuzzy inference and fast merging. Alkholidi et al.,[8]
proposed a new approach for optical colored image compression using the jpeg standards. Chikouche et al.[9]
described the application of the DCT and arithmetic al., presented a coding to medical image compression.
Wu et al.,[18] used a single bit map to quantize all of three color planes so that only one out of three bit planes needs to
be preserved in order to increase the compression efficiency. Kurita et al.,[2] used the mean vector and the covariance
matrix of color vectors to compute the principal score for each pixel into two classes.
Douak et al.,[14] proposed a color image compression algorithm based on the DCT transform combined to an adaptive
block scanning. After a preprocessing step (mean removing and RGB to YCbCr transformation), the DCT transform is
applied and followed by an iterative phase (using the bisection method) including the threshold, the quantization,
dequantization, the inverse DCT, YCbCr to RGB transform and the mean recovering. This is done in order to
guarantee that a desired quality (fixed in advance using the well known PSNR metric) is checked. For the aim to obtain
the best possible compression ratio CR, the next step is the application of a proposed adaptive scanning providing, for
each (n, n) DCT block a corresponding (nn) vector containing the maximum possible run of zeros at its end. The last
step is the application of a modified systematic lossless encoder.
Yang et al.,[3] brought out the color image compression by moment-preserving and block truncation coding techniques
in which an input image is divided into non overlapping blocks and each block pixel is assigned one of two
representative colors, which are computed with analytic formulas derived from preserving certain moments in the
block.
A bit map is then generated for each block to represent the pixels colors. Different uniformity conditions in the
representative colors are also identified and utilized to save code bits. Dharra et al., 2006[4] described a color image
compression technique based on block truncation coding using pattern fitting (BTC-PF). They have reduced a high
degree of correlation between the RGB planes of a color image by transforming them to O1, O2, O3 planes.
Page 68

ISSN 2319 - 4847
In the proposed method, the color prediction technique is used to handle the color planes separately and built pixel by
pixel through a raster scan order. A color map is generated based on color difference by using the predefined threshold.
This color map is encoded by using Huffman encoding. The predicted colors are stored separately as header
information along with the encoded stream. In this study, a color image compression approach yielding high
compression ratios and good reconstructed image quality is proposed.
The rest of the paper is organized as followed in four sections. Section 2 describes the background. Section 3 presents
the proposed algorithm. Section 4 presents the experimental results obtained in this paper. Section 5 gives the
conclusion of this work.
2. BACKGROUND
2.1 Color Models
Color models provide a standard way to specify a particular color by defining a 3D coordinate system, and a subspace
that contains all constructible colors within a particular model. Any color can be specified using a model. Each color
model is oriented towards a specific software or image processing applications. They are categorised into Red Green
Blue color model, Cyan Magneta Yellow color model, Hue Saturation Intensity color model, Y (Luminance) IQ
(chrominance) color model. In the proposed method, we have used the RGB model images. In the RGB model, each
color appears in its primary spectral components of red, green and blue. This model is based on Cartesian coordinate
system.
2.2 Coding
There are a number of coding techniques used by the schemes being investigated. There are optimal coding techniques,
these include Rice, Huffman and Arithmetic coding. There are also other schemes such as Lempel-Ziv which is more a
combination of a modeler and coder. Coding is the procedure of creating a model and a code. The model is a stream of
bits that describes how the data is encoded, the cost of incurred by having to store or transmit the model is known as the
model cost. The code is a stream of bits that uniquely identifies the original symbols. As the code uniquely identifies all
of the original symbols, coding will always be lossless.
beforehand or a good estimate of the probabilities can be made before looking at the data, a static Huffman table is
used. This is known to both the encoder and the decoder, which eliminates model cost, but may make the compression
non-optimal if the data is not similar to the data that was used to make the original Huffman table. If the data fits the
table well, then the compression will be almost optimal and no model cost is incurred.
Huffman coding is an optimal coding scheme. That is to say the amount of bits that are produced is as close to the
theoretical limit, the entropy, as possible. However, this only applies to the bits that identify the data, not the symbol
table. The symbol table must be transmitted if it was formed independently by the encoder. Also, the theoretical limit of
outputting at least 1 bit per symbol means that Huffman coding cannot achieve further compression on extremely
compressible data.
The PNG (Adler et al., 1999) scheme uses Huffman coding combined with Lempel- Ziv (Ziv and Lempel, 1977) coding
to generate compressed images. The CALIC-H (Wu and Memos, 1997) and JPEG (CCITT, 1922) schemes also use this
coding method.
3. PROPOSED SYSTEM
Initially the first pixel color is chosen and stored in the List of Color (LOC) array. The color prediction technique is
applied to all pixels in the image by raster scan order. The color prediction technique finds the sum of color difference
between current pixel and the colors in the LOC. If the color difference is less than the predefined threshold then the
color of the minimum color difference is updated in the color map (COL) at current pixel position. If the color
difference is greater than the predefined threshold then color of the current pixel is updated in LOC array and also the
color map. This procedure is repeated for the entire pixel in the raster scan order. Further, Huffman encoding is applied
for the color map to achieve better compression. Then LOC is stored in the header information in order to reconstruct
the original color image.
Proposed color prediction technique
read input color image and stored in RGB array R
= Height of the image C = Width of the image
Page 69

ISSN 2319 - 4847
Figure 1 Proposed codec a) Encoder and b) Decoder

Proposed color prediction algorithm
// read input color image and stored in RGB array
// R = Height of the image
// C = Width of the image
// Color Prediction technique
nThres = 50 ;
COL = []; % Color Map
// LOC is the List of Color array LOC(1,1,1) = RGB(1,1,1);// R Component LOC(1,1,2) = RGB(1,1,2); // G
Component LOC(1,1,3) = RGB(1,1,3); // B Component LOCFLAG(1,1) = 0 ; // Symbol for color nIndex = 2
;
for i=1:R for j=1:C
// calculate color difference between current pixel and LOC for k=1:size(LOC)
nColorDiff(1,k) = abs(RGB(i,j,1) - LOC(1,k,1)) + abs(RGB(i,j,2) - LOC(1,k,2)) + abs(RGB(i,j,3) - L OC(1,k,3))
;
end
//Find the index of the color difference less than n Threshold nInd = find(nColorDiff <= nThres);
if numel(nInd) > 1 // greater than one color difference less
// than threshold nInd = [];
nInd = find(nColorDiff == min(nColorDiff)); end
if nInd == 0 // if all color difference are greater than // threshold
LOC(1,nIndex,1) = RGB(i,j,1);
LOC(1,nIndex,2) = RGB(i,j,2);
LOC(1,nIndex,3) = RGB(i,j,3); LOCFLAG(1,nIndex) = LOCFLAG(1,nIndex-1) + 1 ; COL(i,j) = LOCFLAG(1,nIndex);
nIndex = nIndex + 1 ; else
COL(i,j) = LOCFLAG(1,nInd(1,1)); end
end end
4. EXPERIMENTAL RESULTS
A set of 24-bit 128x128 and 256x256 standard images is used to evaluate the performance of the color prediction
technique. A color map is generated based on color difference by using the predefined threshold. This color map is
encoded by using Huffman encoding. The predicted colors are stored separately as header information along with the
encoded stream. Then the reverse process is applied to reconstruct the original images with a loss due to thresholding.
In the proposed method the thresholding was accomplished respecting the idea that ensuring the quality control is more
preferable, in real world image processing
applications, than elaborating lossy compression algorithms that work in an openloop manner.
Several quality measures can be found in the open literature of the field. It is well known that in thresholding based
lossy compression algorithms, two sources of information loss are encountered:
The first loss is due to the thresholding process.
Page 70

ISSN 2319 - 4847
The second one is resulting from the quantization phase.

The most used measures are (distortion evaluation): The mean squared errors (MSE) and the popular peak signal to
noise ratio (PSNR). In the case of gray level images, the PSNR is expressed by
(1)
However, for color RGB images case, we have used the relation given in
(2)
(3)
where
and
are, respectively the original and
reconstructed intensities belonging to R, G or B planes. The size of the compressed image is evaluated with the
compression ratio (CR) as follows
(4)
The proposed algorithm result is given in terms of compressed file size in KB (CFS) and compression ratio (CR)
defined by (4). Experimental results show that the new coding algorithm provides a better compression ratio and PSNR,
which are listed in the following tables.
Table 1 shows the compression results of the images of size 128x128 with thresholding from 15 to 30 in steps of 5.
Table 2 shows the compression results for images of size 256x256 with thresholding ranging from 25 to 50 in steps of
25. Fig.1.2 and 1.3 show the output of original 128x128 test images of goldhill and lena and their reconstructed images
with threshold of 15, 20, 25 and 30 respectively. Fig.1.4 and 1.5 show the original 256 x 256 test images of goldhill
and hplogo and their reconstructed images with threshold of 25, 50, 75 and 100 respectively.
Fig. 1.6 to 1.9 show threshold versus CR, CFS, LOC and PSNR for the some of the selected test images.
Page 71

ISSN 2319 - 4847
Table 1. Color Image compression with 128 X 128 = 48 KB images for 15:5:30 as threshold
Page 72

ISSN 2319 - 4847
Table 2. Color Image compression with 256 X 256=192 KB images for 25:25:100 as threshold
Figure 1.2: (a) Original; (b)Threshold=15; )Threshold=20; (d) Threshold=25; (e) Threshold=30
Figure 1.3: (a) Original ;(b) Threshold=15; (c)Threshold=20; (d) Threshold=25; (e) Threshold=30
Page 73

ISSN 2319 - 4847
Figure 1.4: (a) Original ;(b) Threshold=25; (c)Threshold=50; (d) Threshold=75; (e) Threshold=100
Figure 1.5: (a) Original; (b) Threshold=25; c)Threshold=50;(d) Threshold=75; (e) Threshold=100
Figure 1.7: THRESHOLD VS LOC
Page 74

ISSN 2319 - 4847
Figure 1.8: THRESHOLD VS PSNR
Figure 1.9: THRESHOLD VS CR
4. Conclusion
In this paper, a novel lossy image compression technique based on color prediction and Huffman encoding is proposed.
The proposed color prediction technique
handles the color planes separately and built pixel by pixel through a raster scan order. A color map is generated based
on color difference by using the predefined threshold. This color map is encoded by using Huffman encoding. The
predicted colors are stored separately as header information along with the encoded stream. Experimental results show
that as threshold increases, the compression ratio of the proposed system also increases although PSNR decreases.
References
[1]. Wu, Y., Coll, D.C., 1992. Single bit-map Block Truncation Coding of color images. IEEE Journal on Selected
areas commun. 10 (5) (1992) 952959.
[2]. Kurita T, Otsu N.A method of block truncation coding for color image compression. IEEE Trans. on
Communications 41 (9) (1993) 12701274.
[3]. Yang C, Lin J, Tsai W. Color image compression by moment-preserving and block truncation coding techniques.
IEEE Trans. on Communications 45(1997) 15131516.
[4]. Dhara B, Chanda B., Color image compression based on block truncation coding using pattern fitting principle
International journal on Pattern recognition 40 (2007) 240817.
[5]. Feng Y, Nasrabadi N., Dynamic address- vector quantisation of RGB colour images. IEE Proceedings
ICommunications, Speech and Vision 13(8) (1991) 22531.
Page 75

ISSN 2319 - 4847
[6]. Lee W, Chan C., Dynamic finite state VQ of colour images using stochastic Learning, Signal Processing: Image
Communication 6 (1994) 111.
[7]. Makrogiannis S, Economou G, Fotopoulos S. Region oriented compression of colour images using fuzzy inference
and fast merging. Pattern Recognition 35 (2002) 180720.
[8]. Alkholidi A, Alfalou A, Hamam H.,A new approach for optical colored image compression using the jpeg
standards. Signal Processing 8 (7) (2007) 56983.
[9]. Chikouche D, Benzid R, Bentoumi M., Application of the DCT and Arithmetic coding to medical image
compression. In: IEEE third international conference on rmation and communication technologies: from theory to
applications, ICTTA2008, 2008, p15.
[10]. Skodras A.,Christopoulos C., Ebrahimi T., Jpeg2000:the upcoming still image compression standard, Pattern
Recognition Letters 22 (2001) 133745.
[11]. Yu W., Sun F.,Fritts .J., Efficient rate control for jpeg-2000.IEEE Trans.on Circuits and Systems for Video
Technology 16 (2006) 57789.
[12]. Pearlman W, Islam A, Nagaraj N, Said A., Efficient,low-complexity image coding with a set-partitioning
embedded block coder. IEEE Trans. on Circuits and Systems for Video Technology 14 (2004) 121935.
[13]. Abadpour A,Kasaei S.,Colour PCA eigen images and their application to compression and watermarking. Image
and Vision Computing 26 (2008) 87890.
[14]. Douak F, Benzid R, Benoudjit N., Color image compression algorithm based on the DCT transform combined
to an adaptive block scanning, Int. J. Electron. Commun. (AEU), 65 (2011) 1626.
[15]. Yang C.K., Lin J.C., Tsai W.H., Color image compression by moment preserving and block truncation coding
techniques, IEEE Trans. Commun. 45 (1997) 15131516.
[16]. Dhara B. C., Chanda B., Color image compression based on block truncation coding using pattern fitting ,
Pattern Recognition 37 (2004) 21312139.
[17]. CCITT (1992). Information technology: Digital compression and coding of continuous-tone still images
requirements and guidelines, Recommendation, International Telecommunication Union. ITU T.81.
[18]. Wu, X. and Memon, N. D., Context-based adaptive lossless image compression, IEEE Trans. on Communication
45(1997) 437444.
[19]. Ziv, J. and Lempel, A., A universal algorithm for sequential data compression, IEEE Trans. on Information
Theory 23(3) (1997) 337343.
[20]. Nakachi T., Fujii, T., Suzuki J., Lossless and near-lossless compression of still color images, in: Proceedings of
ICIP99, 1 (1999) 453457.
[21]. Wallace G.K., The jpeg still picture compression standard, IEEE Trans. Consumer Electron. 38 (1992) 1834.
Page 76

A Novel Lossy Image C Ompression Based On Color Prediction Technique

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

A Novel Lossy Image C Ompression Based On Color Prediction Technique

Uploaded by

Copyright:

Available Formats

International Journal of Application or Innovation in Engineering & Management (IJAIEM)

Web Site: www.ijaiem.org Email: editor@ijaiem.org

ISSN 2319 - 4847