2018•2018 International Conference on Intelligent and Innovative Computing Applications (ICONIC)Requires access

CMedia Compressor: An Application to Graphically Compare General Compression Algorithms and Adaptive Huffman Compression Algorithm

Sampson D. Asare, Phyela Mbewe

Open publisher page 0 citations

Abstract

Much discussion and research has been done on compression algorithms but not many have gone to the extent of developing an application that can test and compare various compression algorithms with each other. In this paper, we present an application known as the CMedia Compressor, that tests and compares various compression algorithms. The application shows that adaptive Huffman and Arithmetic Coding tend to outperform the others such as the Run-length encoding (RLE), Huffman coding, Arithmetic coding (AC) and Lempel-Ziv-Welch (LZW) methods. Results obtained from this study are discussed and also presented graphically. The study's results indicates that Arithmetic coding yields higher space-savings than Huffman coding and Adaptive Huffman coding.

About this research paper

What this paper is about

Much discussion and research has been done on compression algorithms but not many have gone to the extent of developing an application that can test and compare various compression algorithms with each other. In this paper, we present an application known as the CMedia Compressor, that tests and compares various compression algorithms. The application shows that adaptive Huffman and Arithmetic Coding tend to outperform the others such as the Run-length encoding (RLE), Huffman coding, Arithmetic coding (AC) and Lempel-Ziv-Welch (LZW) methods. Results obtained from this study are discussed and also presented graphically. The study's results indicates that Arithmetic coding yields higher space-savings than Huffman coding and Adaptive Huffman coding.

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Much discussion and research has been done on compression algorithms but not many have gone to the extent of developing an application that can test and compare various compression algorithms with each other. In this paper, we present an application known as the CMedia Compressor, that tests and compares various compression algorithms. The application shows that adaptive Huffman and Arithmetic Coding tend to outperform the others such as the Run-length encoding (RLE), Huffman coding, Arithmetic coding (AC) and Lempel-Ziv-Welch (LZW) methods. Results obtained from this study are discussed and also presented graphically. The study's results indicates that Arithmetic coding yields higher space-savings than Huffman coding and Adaptive Huffman coding.

Key concepts: Huffman coding, Arithmetic coding, Algorithm, Tunstall coding, Data compression, Shannon–Fano coding, Adaptive coding, Computer science

Related papers

Back to paper searchBrowse research topicsOriginal source
CMedia Compressor: An Application to Graphically Compare General Compression Algorithms and Adaptive Huffman Compression Algorithm — Research Paper | ScholarLens