Open Access Journal

ISSN : 2394-2320 (Online)

International Journal of Engineering Research in Computer Science and Engineering (IJERCSE)

Monthly Journal for Computer Science and Engineering

Open Access Journal

International Journal of Engineering Research in Computer Science and Engineering (IJERCSE)

Monthly Journal for Computer Science and Engineering

ISSN : 2394-2320 (Online)

Analysis and Implementation of Lossless Image Compression for Various Formatting Images

Author : T.Vaitheeswari 1 Dr.R.Shenbagavalli 2 M.Revathi 3

Date of Publication :30th March 2018

Abstract: Digital image compression is a method of image data reduction to save storage space. Image compression is the process of reducing the size of the image that will enhance images sharing, image transmission and easy storage of the image. There are two types of image compression techniques. In Lossy compression, the compressed image is not equal to the original image; it means the quality of compressed image is less than the original image. In Lossless compression the compressed image is exactly equal to the original image. In this work, the analysis of different format of images have been implemented using the Lossless image compression techniques such as Huffman coding, EZW and SPIHT. Huffman encoding technique basically works on the rule of probability distribution. The principle is to reduce the size of the image by removing redundancies. Less number of bits is used to encode the image. Huffman encoding method is used in JPEG image. Set partitioning in hierarchical trees (SPIHT) is a waveletbased image compression technique. It gives good image compression ratios and image quality. EZW method is based on progressive encoding to compress an image. Experimental result was carried out on four types of image format such as .bmp, .jpg, .png, .tif. The Performance metrics such as Peak signal-to-noise ratio (PSNR), Compression Ratio (CR), Mean square error (MSE), Bits per pixel (BPP) were measured for each format of images

Reference :

    1. Suri, Pushpa R., and Madhu Goel, “Ternary Tree and Memory-Efficient Huffman Decoding Algorithm.” IJCSI International Journal of Computer Science, Issues 8.1, 2011. 
    2. J. Tian and R.O. Wells, Jr. A lossy image codec based on index coding. IEEE Data Compression Conference, DCC ‟96, page 456, 1996.
    3. J. M. Shapiro, “ Embedded image coding using zero trees of wavelet coefficients,” IEEE Transactions on Signal Processing, vol. 41, no. 12, pp. 3445-3462, 1993.
    4. Mridul Kumar Mathur, Seema Loonker, Dr. Dheeraj Saxena, “Lossless Huffman Coding Technique For Image Compression And Reconstruction Using Binary Trees”, IJCTA, Vol 3 , Jan-Feb 2012.
    5. Jagadeesh B, Ankitha Rao, “An approach for Image Compression Using Adaptive Huffman Coding”, International Journal of Engineering Research & Technology (IJERT), Vol. 2 Issue 12, December – 2013.
    6. Puja Bharti, Dr. Savita Gupta and Ms. Rajkumari Bhatia, “Comparative Analysis of Image Compression Techniques: A Case Study on Medical Images”, International Conference on Advances in Recent Technologies in Communication and Computing, 978-0- 7695-3845-7, 2009.

Recent Article