Research Article
Open access
Published on 31 May 2023
Download pdf
Ma,S. (2023). Comparison of image compression techniques using Huffman and Lempel-Ziv-Welch algorithms. Applied and Computational Engineering,5,793-801.
Export citation

Comparison of image compression techniques using Huffman and Lempel-Ziv-Welch algorithms

Shaowen Ma *,1,
  • 1 Glasgow College, University of Electronic Science and Technology of China, Chengdu, Sichuan, 611731, China

* Author to whom correspondence should be addressed.

https://doi.org/10.54254/2755-2721/5/20230705

Abstract

Image compression technology is very popular in the field of image analysis because the compressed image is convenient for storage and transmission. In this paper, the Huffman algorithm and Lempel-Ziv-Welch (LZW) algorithm are introduced. They are widely used in the field of image compression, and the compressed image results of the two algorithms are calculated and compared. Based on the four dimensions of Compression Ratio (CR), Mean Square Error (MSE), Peak Signal to Noise Ratio (PSNR) and Bits Per Pixel (BPP), the applicable conditions of the two algorithms in compressing small image files are analysed. The results illustrated that when the source image files are less than 300kb, the Compression Ratio (CR) of Huffman algorithm was better than that of LZW algorithm. However, for Mean Square Error (MSE), Peak Signal to Noise Ratio (PSNR) and Bits Per Pixel (BPP), which are used to represent the compressed images qualities, LZW algorithm gave more satisfactory results.

Keywords

Huffman, Lempel-Ziv-Welch, image compression

[1]. Birajdar A, Agarwal H, Bolia M and Gupte V, Image Compression Using Run Length Encoding and Lempel Ziev Welch Method, 2019 Global Conf. for Advancement in Technology (GCAT), 2019, pp 1-6

[2]. Khaitu S and Panday S, Canonical Huffman Coding for Image Compression, 2018 IEEE 3rd International Conf. on Computing, Communication and Security (ICCCS), 2018, pp 184-190

[3]. Patel R, Kumar V, Tyagi V and Asthana V, A fast and improved Image Compression technique using Huffman coding, 2016 International Conf. on Wireless Communications, Signal Processing and Networking (WiSPNET), 2016, pp 2283-2286

[4]. Li X, Shen Y and Ma J, An Efficient Medical Image Compression Scheme, 2005 IEEE Engineering in Medicine and Biology 27th Annual Conf., 2005, pp 3437-3439

[5]. Sangeetha M, Betty P and Kumar G, A biometrie iris image compression using LZW and hybrid LZW coding algorithm, 2017 International Conf. on Innovations in Information, Embedded and Communication Systems (ICIIECS), 2017, pp 1-6

[6]. Chen Y, Zhou L, Chen X, Chen W, 2016, Information Theory and Coding, ed T P Han, Publishing House of Electronic Industry, Beijing, pp 40-44

[7]. Sun B, Wu K, Improvement of Huffman Algorithm and Its Application in Image Compression, Microcomputer Information, 2011, Vol 27, pp 264-266

[8]. Praisline Jasmi R, Perumal B and Pallikonda Rajasekaran M, Comparison of Image Compression Techniques Using Huffman Coding, DWT and Fractal Algorithm, 2015International Conf. on Computer Communication and Informatics (ICCCI), 2015, pp 1-5

[9]. Ahmed Z and George L, A Comparative Study Using LZW with Wavelet or DCT for Compressing Color Images, 2020 International Conf. on Advanced Science and Engineering (ICOASE), 2020, pp 53-58

[10]. Prudvi C, Muchahary D and Raghuvanshi A, Analysis of Image Compression Techniques for IoT Applications, 2022 2nd International Conf. on Intelligent Technologies (CONIT), 2022, pp 1-5

[11]. Vaish A and Kumar M, A new Image compression technique using principal component analysis and Huffman coding, 2014 International Conf. on Parallel, Distributed and Grid Computing, 2014, pp 301-305

[12]. Sharma K and Gupta K, Lossless data compression techniques and their performance, 2017 International Conf. on Computing, Communication and Automation (ICCCA), 2017, pp 256-261

[13]. Sun M, Xie Y, Tang X and Sun M, Image Compression Based on Classification Row by Row and LZW Encoding, 2008 Congress on Image and Signal Processing, 2008, pp 617- 621

Cite this article

Ma,S. (2023). Comparison of image compression techniques using Huffman and Lempel-Ziv-Welch algorithms. Applied and Computational Engineering,5,793-801.

Data availability

The datasets used and/or analyzed during the current study will be available from the authors upon reasonable request.

Disclaimer/Publisher's Note

The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of EWA Publishing and/or the editor(s). EWA Publishing and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

About volume

Volume title: Proceedings of the 3rd International Conference on Signal Processing and Machine Learning

Conference website: http://www.confspml.org
ISBN:978-1-915371-57-7(Print) / 978-1-915371-58-4(Online)
Conference date: 25 February 2023
Editor:Omer Burak Istanbullu
Series: Applied and Computational Engineering
Volume number: Vol.5
ISSN:2755-2721(Print) / 2755-273X(Online)

© 2024 by the author(s). Licensee EWA Publishing, Oxford, UK. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license. Authors who publish this series agree to the following terms:
1. Authors retain copyright and grant the series right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgment of the work's authorship and initial publication in this series.
2. Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the series's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgment of its initial publication in this series.
3. Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (See Open access policy for details).