International Journal of Engineering and Technical Research (IJETR)

ISSN: 2321-0869, Volume-3, Issue-1, January 2015

An Efficient Technique of Lossless Data

Compression
Megha S. Chaudhari , S.S.Shirgan

efficient communication. It has made large impact on service

Abstract We present a new method for lossless image sector to provide best services to all sections of society.
compression that gives compression comparable to JPEG High code efficiency is measurement parameter for
lossless mode with about five times the speed. Our method, performance of data compression system.
called ELICS, is based on a novel use of two neighboring pixels The dictionary-based algorithm exploits almost identical
for both prediction and error modeling. For coding we use
mapping relation- ship; prediction technique is utilized to
single bits, adjusted binary codes, and Golomb Rice codes. For
the latter we present and analyze a provably good method for improve coding efficiency. Prediction- based algorithms
estimating the single coding parameter. Efficient, lossless image apply prediction technique to generate the residual, and
compression system (ELICS) algorithm, which consists of utilize the entropy coding tool to encode it. Many
simplified adjusted binary code and GolombRice code with methods, including fast, efficient, lossless image
storage-less k parameter selection, is proposed to provide the compression system (FELICS) [4], context-based, adaptive,
lossless compression method for high-throughput applications. lossless image coding (CALIC) [5] and JPEG-LS, have been
The simplified adjusted binary code reduces the number of extensively developed in this field. Among these methods,
arithmetic operation and improves processing speed. According the JPEG-LS presents better performance [6] and is further
to theoretical analysis, the storage-less k parameter selection
adopted as lossless/near-lossless standard, but it possesses
applies a fixed value in GolombRice code to remove data
dependency and extra storage for cumulation table. serious data dependency and complex coding procedure that
limits the hardware performance in high-throughput
Index Terms Binary adjusted coding,Golomb-Ricecoding, applications. The fast, efficient, lossless image
Intensity distribution, lossless data compression, predictive compression system (FELICS) algorithm, which consists
coding, wavelet transform. of simplified adjusted binary code and Golomb-Rice code
with storage-less k parameter selection, is proposed to
provide the lossless compression method for
I. INTRODUCTION high-throughput applications. The simplified adjusted
Due to the great innovation o f display and information binary code reduces the number of arithmetic operations
technology, the stringent requirement of data capacity is and improves processing speed. According to theoretical
drastically increased in human life. This trend ma k e s a analysis, the storage-less k parameter selection applies a
significant impact on storage and communication evolution. fixed k value in Golomb-Rice code to remove data
The data compression technique is extensively applied to dependency and extra storage for cumulation table. Besides,
offer acceptable solution for this scenario, some images like the colour difference pre-processing is also proposed to
satellite images or medical images have very high resolution. improve coding efficiency with simple arithmetic operation.
Such high resolution images have large file size.
Computation time required to process such high quality
images is more. Hence compression of images and video II. LITERATURE REVIEW
has become need of hour. The image can be compressed
using lossy or lossless compression techniques. In the Using present techniques, we can compress image either by
lossy image compression technique, the reconstructed using lossy or loss- less compression algorithms. For lossy
image is not exactly same as the original image. compression technique, many sophisticated standards have
The lossless image compression can remove redundant been intensively developed such as JPEG and JPEG
information and guarantee that the reconstructed image is 2000 for still image, and MPEG-4 and H.264 for multimedia
without any loss to original image. Different image communications and high-end video applications,
compression techniques are suggested by the researchers, respectively. Many articles put more effort on related
but the technique with high data compression with low loss VLSI architecture designs [1]. Therefore, both algorithm
is always preferred. Because of the advance- ment in and hardware implementa- tion have attracted massive
Internet, world has come very close and can afford and avail research effort for the evolution of lossy compression
the services such as medical, tourism, education etc., technique. Lossless compression can remove redundant
remotely. Data compression is the key in giving such fast and information and guaran- tee that the reconstructed
procedure is without any loss to original information. This
can ensure that the decoded information is exactly identical
Manuscript received December 30, 2014. to original in- formation. According to the coding principle
Megha S. Chaudhari, Dept.of Electronics & Telecommunication,
N.B.Navale college of engineering, Solapur,India of lossless compression technique, it can be categorized into
S.S.Shirgan, Dept.of Electronics & Telecommunication, N.B.Navale two fields: dictionary-based and prediction-based. In
college of engineering, Solapur,India dictionary-based, frequently occurring and repetitive

10 www.erpublication.org
 An Efficient Technique of Lossless Data Compression

patterns are assigned to a shorter codeword. The less D. Description of the method
efficient codeword is assigned to the others. Based on this Proceeding in raster-scan order, we code each new pixel P3
principle, the codeword table should be constructed to using the intensities of the two nearest neighbors of P that
provide the fixed mapping relationship. Many famous have already been coded; except along the top and left edges,
methods, including Huffman coding [2], run length coding these are the pixel above and the pixel to the left of the new
, arithmetic coding, and LZW[3], have been widely pixel (see Figure 2). We call the smaller neighboring value L
developed, and some of them are further applied in lossy and the larger value H, and we define to be the difference H
compression standards. The FELICS [4], proposed by P. G. L. We treat _ as the prediction context of P, used for code
Howard and J. S. Vitter in 1993, is a lossless compression parameter selection. The idea of the coding algorithm is to use
algorithm with the advantage of fast and efficient coding one bit to indicate whether P is in the range from L to H, an
principle. Furthermore, FELICS presents competitive additional bit if necessary to indicate whether it is above or
coding efficiency in com- parison with other sophisticated below the range, and a few bits, using a simple prefix code, to
lossless compression algorithms [7]. specify the exact value. This method leads to good
compression for two reasons: the two nearest neighbors
III. PROBLEM STATEMENT provide a good context for prediction, and the image model
implied by the algorithm closely matches the distributions
A. Present Technique: found in real images. In addition, the method is very fast,
We can compress Image either Lossy or Lossless since it uses only single bits and simple prefix codes.
compression algorithm using JPEG and JPEG 2000
technique.
Many methods, including efficient lossless image IV. METHODOLOGY:
compression system , context-based, adaptive, lossless image
coding (CALIC) and JPEG-LS, have been extensively
Most lossless image compression methods consists of four
developed in this field. Among these methods, the JPEG-LS
main components a selector, a predictor, an error modeler
presents better performance and is further adopted as
and a statistical coder.
lossless/near-lossless standard, but it possesses serious data
Pixel Selector: A selector is used to choose the next pixel
dependency and complex coding procedure that limits the
which is to be encoded, from the image data.
hardware performance in high-throughput applications. The
Intensity Predictor: - A predictor is used to estimate the
efficient lossless image compression system algorithm, which
intensity of the cur- rent pixel depending on the intensities of
consists of simplified adjusted binary code and Golomb rice
the two reference pixels Error modeler. It is used to estimate
code.
the distribution of the prediction error.
B. Title of work: Statistical coder: It is used to code the prediction error using
Implementation and Analysis of Efficient Lossless Image the error distribution. By using an appropriate pixel sequence
Compression Algorithm Using Binary Adjusted Coding and we can obtain a progressive encoding, and by us- ing
Golomb-Rice Coding Technique sophisticated prediction and error modeling techniques in
conjunction with arithmetic coding we can obtain
state-of-the-art compression efficiency. These techniques are
C. Proposed Work: computation intensive. The (ELICS) is a simple system for
Applying image The Wavelet Transform on the Image: lossless image compression that runs very fast with only
For applying wavelet transform on the MATLAB minimal loss of compression efficiency [7]. In this algorithm
Wavelet Toolbox can be used. raster-scan order is used, and a pixels two nearest neighbors
Applying ELICS technique on the pixels: are used to directly obtain an approximate probability
For applying ELICS technique on the pixels we can distribution for its intensity, in effect combining the
develop a MATLAB program by considering following prediction and error modeling steps.
mathematical formulation.
Applying Adjusted Binary Coding (ABC) on in-range Fig 1: Block Diagram of data flow
pixels:
Again adjusted Coding technique on the for applying
Binary pixels we can develop a MATLAB program by
considering mathematical formulation.
Applying Golomb-Rice coding on out of range Pixels:
For applying Binary adjusted Coding technique on the Fig.2 Illustration of prediction template in FELICS
pixels we can develop a MATLAB program by considering
mathematical formulation. This will be faster and efficient
than the existing JPEG and JPEG-2000
techniques.Development of the proposed algorithm using
MATLAB. JPEG uses Discrete Cosine transform (DCT) and
JPEG-2000 uses Wavelet Transform. By applying the
adjusted binary code and golomb rice code techniques on
wavelet coefficients faster and efficient compression
algorithm can be achieved.

11 www.erpublication.org
 International Journal of Engineering and Technical Research (IJETR)
ISSN: 2321-0869, Volume-3, Issue-1, January 2015

FELICS utilizes two reference pixels around current pixel

to yield the predic- tion template, and it can be divided into
four cases. In case 1, since surrounding reference pixels are
not available for the first two pixels, P1 and P2, both current
pixels are directly packed into bit stream with original
pixel intensity. For case 2, successive pixels, N1 and N2,
are regarded as reference pixels for current pixel P5. For
non-first row, cases 3 and 4 clearly define the relationship
between cur- rent pixel and reference pixels. Between N1
and N2, the smaller reference pixel is represented as L, and
the other one is H. As in Fig.4, the intensity distribution
model is exploited to predict the correlation between
current pixel and reference pixels. In this model, the
intensity that occurs between L and H is with almost
uniform distribution, and regarded as in-range. The
intensities higher than H or smaller than L are regarded
as above range and below range, respectively. For Fig.4 Probability distribution model in FELICS
in-range, the adjusted binary code is adopted, and Fig. 4 shows that the adjusted binary code is adopted
GolombRice code is for both above range and below range in in-range, where the intensity of current pixel is between
[7]. H and L. For in-range, the probability distribution is
Flow chart slightly higher in the middle section and lower in both side
sections. Therefore, the feature of adjusted binary code
claims that the shorter codeword is assigned to the middle
section, and longer one is assigned to both side sections. To
describe the coding flow of adjusted binary code, the coding
parameters should be first declared as follows:

The adjusted binary code takes the sample of P-L to

be encoded, and range indicates that the number of possible
samples should be encoded for a given delta. The upper
bound and lower bound denote the maximum and
minimum number of bits to represent the codeword for each
sample, respectively. Particularly, the lower bound is
identical to upper bound, while the range is exactly equal
to the power of two. The threshold and shift number are
utilized to determine which sample should be encoded
Golomb-Rice Code For both above range and below
range, the probability distribution sharply varies with
exponential decay rate, and the efficient codeword should be
more intensively assigned to the intensity with high
probability. There- fore, Golomb-Rice code is adopted as
the coding tool for both above range and below range.
With Golomb-Rice code, the codeword of sample x is
partitioned into unary and binary parts Golomb-Rice code:
- Unary part: floor(x/2k) Binary part: x mod 2k where k
is a positive integer.
The entire codeword is concatenated with unary part
and binary part, and one bit is inserted between both for
identification. Therefore, the Golomb-Rice code is a
special case of Golomb code, and its k parameter,
exactly equal to power of 2, is efficient for hardware
implementation. The selection procedure of k parame- ter
induces serious data dependency and consumes
Fig.3 Flowchart for the FELICS Algorithm considerable storage capacity. The resulting compressor
runs about five times as fast as an implementation of the

12 www.erpublication.org
 An Efficient Technique of Lossless Data Compression

lossless mode of the JPEG proposed standard while the DWT technique followed by the FELICS algorithm.
obtaining slightly better compression on many images [4]. This experiment is carried out on different class of
images these images are taken the performance of these
Formal description of algorithm techniques is compared on the basis of various image quality
measures such as Compression Ratio (CR), Bits per pixel,
To encode an image, we output the _rst two pixels without Signal to Noise Ratio (SNR), Inefficiency, Throughput.
coding, then repeat the Here, different types of images are used. Standard images
following steps: like Lenna, Baboon, Man, Woman,Bridge boat. The Lenna
1. We select the next pixel P and _nd its two nearest neighbors image contains a nice mixture of detail, at regions, shading,
N1 and N2. and texture that do a good job of testing various image
2. We compute L = min(N1;N2), H = max(N1;N2), and _ = H processing algorithms. The Baboon image has details and
L. texture information. The Bridge and Boat images have
3. mixture of detail, edges and shading.
(a) If L P H, we use one bit to encode IN-RANGE; then we
use an
adjusted binary code to encode P L in [0; ].
(b) if P < L, we use one bit to encode OUT-OF-RANGE, and
one bit to
encode BELOW-RANGE. Then we use a Golomb-Rice code
to encode the
non-negative integer L - P - 1.
(c) if P > H, we use one bit to encode OUT-OF-RANGE, and
one bit to
encode ABOVE-RANGE. Then we use a Golomb-Rice code
to encode the non-negative integer P -H -1.
The decoding algorithm involves simply reversing step 3,
decoding the in-range/out-
of-range and above-range/below-range decisions, branching
accordingly, and adjust-ing the decoded numbers to obtain the
value of P.

V. CONCLUSION Figure 1 : Lenna image compressed using (a) FELICS (b)

JPEG (c) 2-level DWT+FELICS (d) 3-level DWT+FELICS
The proposed algorithm uses the Adjusted BinaryCoding
which requires minimum two bits per pixel for in range and Table 1
Golomb-Rice coding for out range. Since for most of the FELICS+ FELICS
pixels Adjusted Binary Coding will be used so the Parameter JPEG Compress
DWT Adjusted
compression ratio will be very high. Also due to use of ELICS original size
35.7 38.6 156 316
technique the algorithm will be faster and efficient. (kb)
compression
9.13 1.72 1.72 1.14
ratio
VI. RESULTS ANALYSIS Bits per pixel 0.87 4.65 4.65 7.01
Inefficiency 6.15 41.9 44.28 42
Image Quality Parameters Throughput 314.06 83.8 32.4 81.9
For comparing the images obtained from the three techniques SNR 10.39 10.21 15.23 12.8
we have considered various image quality parameters such as
Compression Ratio (CR), Mean Square Error (MSE), Peak
Signal to Noise Ratio (PSNR), Normalized Cross-Correlation
(NCC), Average Di_erence (AD), Structural Content (SC)
and Normalized Absolute Error (NAE) [7]. Here for
calculating various image quality parameters original image
matrix and compressed image matrix are used. I1(m; n)
indicates an element of original image matrix and I2(m; n)
indicates an element from compressed image matrix. Also M
and N indicate the number of rows and columns of image
matrix. For calculating the image quality parameters the
dimensions of original and compressed images must be same.

VII. RESULTS
Here, a same image is compressed by three different
image compression tech-niques. First technique consists of
Figure 2 Baboon image compressed using (a) FELICS (b)
FELICS algorithm, second technique consists of JPEG. The
JPEG (c) 2-level DWT+FELICS (d) 3-level
third technique is the proposed technique which consists of

13 www.erpublication.org
 International Journal of Engineering and Technical Research (IJETR)
ISSN: 2321-0869, Volume-3, Issue-1, January 2015

Parameter FELICS+DWT FELICS JPEG Compress

Adjusted
original size 60 74 157 337
(kb)
compression 5.62 2.18 2.15 1.63
ratio
Bits per 1.422 3.6 3.72 4.92
pixel
Inefficiency 2.53 44.60 7.1 34.9
Throughput 230.0 88.9 17.1 69
SNR 11.4 11.3 14.7 12.5

ACKNOWLEDGMENT
We wish to thank Allan R. Moser of E. I. duPont de Nemours
and Company (Inc.) for his assistance in obtaining
compression and timing data for JPEG lossless mode.

REFERENCES

[1] P.-C. Tseng, Y.-C. Chang, Y.-W. Huang, H.-C. Fang, C.-T. Huang, and
L.-G. Chen, Advances in hardware architectures for image and
video coding-a survey, Proc. IEEE, vol. 93, no. 1, pp. 184197, Jan.
2005.
[2] Huffman D, A method for the construction of minimum redundancy
codes, Proc. IRE, vol. 140, pp. 10981011, Sep. 1952.
[3] T.Welsh, A technique for high-performance data compression, IEEE
Comput., vol. 17, no. 6, pp. 810, Jun. 1984.
[4] P. G. Howard a n d J . S. Vitter, Fast a n d effi c i en t los s les s
i m a ge compression, in Proc. IEEE Int. Conf. Data Compression,
1993, pp.
[5] X. Wu and N. D. Memon, Context-based,
Adaptive, lossless Image coding, IEEE Trans. Commun., vol. 45, no. 4,
pp. 437 444, Apr. 1997
[6] M . J. Weinberger, G. Seroussi, and G. Sapiro,.
The LOCO-I Lossless image compression algorithm: Principles and
standardization into JPEG-LS, IEEE Trans. Image Process., vol.
9, no. 8, pp. 13091324, Aug.2000
[7] Tsung-Han Tsai, Yu-Hsuan Lee, and Yu-Yu Lee,
Design and. Analysis of High-Throughput Lossless Image
Compression Engine using VLSI- Oriented FELICS Algorithm
IEEE trans. on VLSI Systems, Vol. 18, No.1, January 2010

Megha S. Chaudhari, Dept.of Electronics & Telecommunication,

N.B.Navale college of engineering, Solapur,India
S.S.Shirgan, Dept.of Electronics & Telecommunication, N.B.Navale
college of engineering, Solapur,India

14 www.erpublication.org