A REVIEW ON LATEST TECHNIQUES OF IMAGE COMPRESSION

International Research Journal of Engineering and Technology (IRJET) e-ISSN: 2395 -0056
Volume: 03 Issue: 07 | July-2016 www.irjet.net p-ISSN: 2395-0072
© 2016, IRJET | Impact Factor value: 4.45 | ISO 9001:2008 Certified Journal | Page 727
A REVIEW ON LATEST TECHNIQUES OF IMAGE COMPRESSION
Akhand Pratap Singh1, Dr. Anjali Potnis2, Abhineet Kumar3
1Dept. of electrical and electronics engineering, NITTTR Bhopal, M.P, India
2Asst. professor, Dept. of electrical and electronics engineering, NITTTR Bhopal, M.P, India
3Dept. of electrical and electronics engineering, NITTTR Bhopal, M.P, India
ABSTRACT : With the growth of modern communication technologies, demand for data compression is increasing rapidly.
This Paper gives review of compression principle, classes of compression and various algorithm of image compression. Image
Compression is the solution of problems associated with transmission of digital image and storage of large amount of information
for digital Image. Compression of Images includes different applications like remote sensing via satellite, broadcasting of
Television, and other long distance Communication. Image storage is required for satellite images, medical images, documents
and pictures. Image compression is essential for these types of applications. This paper attempts to help for selecting one of the
best and popular image compression algorithm.
KEYWORDS: Image, Image compression technique, DCT, DWT, BTC, Huffman Coding, LZW, Loss less and lossy image
compression. Run Length Encoding, Transform Coding.
1. INTRODUCTION: Image is basically a two Dimensional signal representation in Digital system. Normally Image which
we take from the camera is in the analog form. However for further processing, storage and transmission, images should have
to be converted in to its digital form. A Digital Image is 2- Dimensional array of pixels. Basically compression of image is
different than compression of digital data. We can use Data compression algorithm for Image compression but the result
obtain from that process is less than optimal. Different types of images are used in bio medical, remote sensing and in
technique of video processing which require compression for transmission and storage. Compression could be achieved by
removing some redundant or extra bits from the image.
1.1 Need of compression:
An Uncompressed image occupies large amount of memory in storage media, and it takes more time to transfer
from one device to another. So if we want to transfer or store digital image then we have to compress it first for fast speed of
transfer and to store in a less space. Hence compression is very essential for modern multi media application.

2. COMPRESSION TECHNIQUE:
In this paper we study different type of image compression techniques. The image compression techniques are classified into
two categories.
A. Lossless compression technique.
B. Lossy compression technique
2.1. LOSSLESS COMPRESSION TECHNIQUE:
In lossless image compression algorithm, the original data can be recovered exactly from the compressed data. It is used for
discrete data such as computer generated data, text and certain kinds of image and video information. It can achieve only a
modest amount of compression of the data and hence it is not useful for sufficiently high compression ratios. Lossless
compression is preferred for artificial images such as drawing, comics etc.
there are some techniques of lossless compression:
2.1.1 Run length encoding
2.1.2. LZW coding
2.1.3. Huffman coding
2.1.4. Area coding
2.1.1. Run length encoding:
Run length encoding is one of the simplest data compression method. This compression technique is useful in case of
repetitive data. when we have sequence of same intensity pixel or symbols then this sequence is replaced by shorter symbols
and it is represented by a sequence (Vi,Ri).where Vi is represented as the intensity of pixel and Ri is the no of consecutive
pixel with same intensity as shown in fig.
50 50 50 50 97 97 120 120 120
(50, 4) (97, 2) (120, 3)
Run length coding
2.1.2. Lempel-Ziv-Welch (LZW) coding:
It is dictionary based coding, which is used in computer industries. LZW is basically of two type, Static and dynamic. in the
static dictionary coding the dictionary is fixed during the encoding and decoding while in dynamic dictionary coding the
dictionary is updated when new word is introduction.

2.1.3. Huffman coding:
Huffman coding is based on the statistical occurrence frequencies or probabilities. Huffman coding can reduce the file size by
10% to 50% by removing the irrelevant information. In this encoding each pixel are treated as a symbol. The symbols which
have higher frequency are assigned a smaller number of bits while the symbol which has less frequency is assigned a relative
large number of bits.
2.1.4. Area code :
Area coding is more enhanced form of run length coding of lossless compression. It is highly effective and can produce better
compression ratio (CR) but it has some limitation that it cannot be implemented in hardware because of non-liner method.
2.2. LOSSY COMPRESSION TECHNIQUE : Lossy compression techniques refer to the loss of information when data is
compressed, but because of this distortion, much higher compression ratios can be achieved as compared to the various
lossless compression technique in reconstruction of the image. 'Lossy' compression technique sacrifices quality of data for
better compression. It removes redundancy and creates an approximation which is near to the original image. This scheme is
highly effective for compressing images.
fig 1: Lossy compression
Here are some examples of lossy compression are given below:
2.2.1. Transform coding.
2.2.2. Block truncation coding.
2.2.3. Vector quantization.
2.2.4. Sub band coding.
2.2.5. fractal coding.
2.2.1. transform coding:
transformation coding is a lossy compression technique. It usually starts by dividing the original image into small blocks of
smaller size. This technique is used for natural data like audio signal or biomedical image. Lesser bandwidth is required in
this type of coding. Different transform such as DFT (discrete Fourier transform) and DCT (discrete coding transform) are
used to change the pixel of the original image into frequency domain coefficients. Among all the transforms , DCT coding has
been the most common technique of transform coding and also adopted in the JPEG image compression standard.
input
image
source
encoder
quantizer
entropy
encoder
compressed
image

2.2.2. Block truncation coding:
Block truncation coding is well known technique for image compression, It (BTC) divides the original image into small sub
blocks of size n x n pixels and after the division of image, it reduces the number of gray levels within each block. reduction of
gray level is performed by a quantizer. Threshold and reconstruction values are calculated for each block and a bitmap of the
block is obtained for that values. We replace all the pixels whose values are greater than or equal (less than) to the threshold
by a 1 (0), in this bit map. Then for each segment (group of 1s and 0s) of the bitmap, reconstruction value is calculated.
2.2.3. Vector quantization:
VQ technique is nothing but the extension of Scalar quantization but with multiple dimensions. code vectors which is a
dictionary of fixed-size vectors, needs to be develop,. A given image again divided into non-overlapping blocks, which are
called image vectors. Then the closest matching vector in the dictionary is determined for each image vector and its index in
the dictionary which is used to encode the original image vector. It is mostly used in multimedia application.
2.2.4. Sub band coding:
The sub band coding split the frequency bands of a signal and then each sub band is coded by encoder .decoder decodes the
sub band signal, then it is sampled and passed through the synthesis filter. SBC is generally used in speech coding and image
coding.
3. PERFORMANCE PARAMETER:
There are various parameters present which are used to measure the performance of different compression algorithm. Some
examples of the performance parameters of image compression are given below:
3.1 Peak signal to noise ratio (PSNR):
PSNR is an important parameter for image compression. It is measurement of the peak error present between the compressed
image and original image. For better quality of image PSNR should be as high as possible.
� = 10 log10
��2
�
�
= 20 log10
��
�
= 20 log10
( �� ) − 10 log10
( �)

3.2 compression ratio:
CR is the ratio of size of compressed image to the size of original image. Compression ratio should be as high as possible to
achieve better compression.
compression ratio =
uncompressed size
compressed size
3.3 Mean square error :
Mean Square Error (MSE) is cumulative difference between the original image and compressed image. MSE should be as
minimum as possible for better quality of image.
4. LITERATURE SURVEY:
In 2010, Jau Ji Shen et al presents vector quantization based image compression technique [5]. In this paper encoding of the
difference map between the original image and compressed image is adjusted and after that it is restored in VQ compressed
version. Result of this experiment shows that although this scheme needs to provide extra data, it can improve the quality of
Vector quantized compressed images, and further be adjusted according to the difference map from the lossy compression to
lossless compression.
In 2011, Suresh Yerva, et al presents the approach of the lossless image compression using the novel concept of image
folding [6]. This proposed method uses the property of adjacent neighbor redundancy for the prediction. In this method,
column folding followed by row folding is applied iteratively on the image till the image size reduces to a smaller pre-defined
value. This method is then compared with the existing lossless image compression algorithms and the obtained result shows a
comparative performance of various methods. Data folding method is a simple technique for compression of images which
provides good efficiency and offer lower computational complexity as compared to the SPIHT technique of lossless
compression.
In 2012, Firas A. Jassim, et al presents a novel method for compressing the image named as Five module method (FMM). In
this method they convert each pixel value in 8x8 blocks into a multiple of 5 for each of RGB array [7]. Then After that the value
is divided by 5 to obtain new values which are known as bit length for each pixel and uses less storage space than the original
values which is 8 bits. This paper shows the potential of the FMM based image compression techniques. The advantage of this
method is, it provides high PSNR although it is low CR (compression ratio). This method is good for bi-level like black and
white medical images where the pixel of the images is presented using one byte (8 bit). As a recommendation, a variable
module method (X) MM, where X could be any number, may be constructed in latter research.
In 2013, C. Rengarajaswamy, et al presents a technique in which encryption and compression of an image is done. first,
stream cipher is used to encrypt an image after that a compression technique named SPIHT [14] is used for compressing the
image. In this paper stream cipher encryption is used to provide good encryption. SPIHT compression results better

compression ratio as the size of the larger images can be chosen and can be decompressed with the least or no loss in the
original image. Thus confidential and high encryption and the best compression rate has been energized to provide better
security, hence the main scope or aspiration of this paper is achieved.
In 2012, Yi-Fei Tan, et al presents a technique which utilizes the reference points coding with threshold values for image
compression. This paper gives the idea of an image compression method which can be used to perform both lossy and lossless
compression [12]. A threshold value is associated in the compression process, by varying this threshold values, different
compression ratios can be achieved and if we set the threshold value to zero then lossless compression can be performed.
quality of the decompressed image can be calculated during the process of compression. when the threshold value of a
parameter assumes positive values, Lossy compression can be achieved. Further study can also be performed to determine
the optimal threshold value T.
In 2013, S. Srikanth, et al presents a technique for image compression which uses different embedded Wavelet based image
coding with Huffman-encoder for further compression. In this paper they implemented the EZW and SPIHT algorithms with
Huffman encoding [15] which uses different wavelet families for compression and after that comparison of the PSNRs and bit
rates of these families are made. These algorithms were performed on various images, and it is seen that the results have
good quality and it also provides high compression ratio as compared to the previous existing lossless image compression
techniques
5. EXPERIMENTAL COMPARISION:
Method Advantage Disadvantage
Wavelet High Compression Ratio State-Of-
The-Art
Coefficient Quantization Bit
allocation
JPEG Current Standard Coefficient (dct) Quantization Bit
allocation
VQ Simple decoder No-coefficient
quantization
Slow codebook Generation Small
bpp
Fractal Good Mathematical Encoding-frame Slow Encoding

6. CONCLUSION:
Basic concept of image compression and various technologies used are discussed in this paper.. We have also discussed
advantages and disadvantages of some lossy image compression techniques. This review paper also gives the idea about
various image types and performance parameter of image compression. Based on review of different types of images and its
Compression algorithms we conclude that the compression algorithm are useful in their related areas and basically depends
on the three factors i.e. quality of image, amount of compression and speed of compression.
7. REFERENCES:
[1] Dr. Eswara Reddy, and K Venkata narayana, "a lossless image compression using traditional and lifting based wavelet"
Signal and image processing : An international Journal(SIPIJ),pp. 213 to 222, Vol 3 No 2,APRIL 2012.
[2] Subramanya A. Image Compression Technique potentials IEEE, Vol. 20, issue 1, pp19-23, Feb-March 2001.
[3] Marc Antonini, Michel, Member, IEEE, Pierre Mathieu and Ingrid Daubechies, Member, IEEE image coding using wevlet
transform IEEE transactions on image processing, pp.205 to 220,Vol.1. No 2. April 1992.
[4] Doaa Mohammed, Fatma Abou-Chadi, Image Compression Using Block Truncation Coding, Journal of Selected Areas in
Telecommunications (JSAT), February, 2011.
[5] Jau-Ji Shen and Hsiu-Chuan Huang, An Adaptive Image Compression Method Based on Vector Quantization, IEEE, pp. 377-
381, 2010.
[6] S. A. Mohamed; Dept. of Electr. Eng., Queen'' S Univ., Kingston, Ont., Canada ; M. M. Fahmy, Image compression using VQ-
BTC, IEEE Transactions on Communications.
[7] Suresh Yerva, Smita Nair and Krishnan Kutty, Lossless Image Compression based on Data Folding,IEEE, pp. 999-1004,
2011.
[8] Ahmed, N., Natarajan, T., Rao, K. R., Discrete Cosine Transform , IEEE Trans. Computers, vol. C-23, Jan. 1974, pp. 90-93.
[9] Firas A. Jassim and Hind E. Qassim, "Five Modulus Method for Image Compression" SIPIJ Vol.3, No.5, pp. 19-28, 2012.
[10] Woods, R. C. 2008. "Digital Image processing. New Delhi" Pearson Pentice Hall, Third Edition, Low price edition, Pages 1-
904.
[11] John Miano; Compressed image file formats: JPEG,PNG, GIL, XBM, BMP , Edition-2, January-2000, page 23.
[12] Majid Rabbani, Paul W.Jones; Digital Image Compression Techniques . Edition-4, 1991.page 51.
[13] Ioannis Pitas, Digital image processing algorithms and applications. , ISBN -471- 37739-2
[14] Yi-Fei Tan and Wooi-Nee Tan, Image Compression Technique Utilizing Reference Points Coding with Threshold
Values,IEEE, pp. 74-77, 2012.
[15] A.S. Ragab, Abdalla S.A. Mohmed, M.S. Hamid, Efficiency of Analytical Transforms for Image Compression th National
Radio Science Conference, Feb.24-26, 1998, Cairo- Egypt.
[16] Rafael C. Gonzalez, Richard Eugene; Digital image processing , Edition , 8, page .Alan Conrad Bovik Handbook
of image and video processing , Edition .

[17] C. Rengarajaswamy and S. Imaculate Rosaline, SPIHT Compression of Encrypted Images, IEEE, pp. 336-341,2013.
[18] Ming Yang & Nikolaos Bourbakis, An Overview of Lossless Digital Image Compression Techniques Circuits& Systems,
2005 48th Midwest Symposium , vol. 2 IEEE, pp 1099-1102, 7 – 10 Aug, 2005.
[19] S. Srikanth and Sukadev Meher, Compression Efficiency for Combining Different Embedded Image Compression
Techniques with Huffman Encoding, IEEE, pp. 816-820, 2013.
[20] Ismail Avcibas, Nasir Memon, Bulent Sankur, Khalid Sayood, A Progressive Lossless/Near Lossless Image Compression
Algorithm IEEE Signal Processing Letters, vol. 9, No. 10, pp 312-314, October 2002.

A REVIEW ON LATEST TECHNIQUES OF IMAGE COMPRESSION

Recommended

More Related Content

Similar to A REVIEW ON LATEST TECHNIQUES OF IMAGE COMPRESSION (20)

More from Nancy Ideker (20)

Recently uploaded (20)

A REVIEW ON LATEST TECHNIQUES OF IMAGE COMPRESSION