Comparative Analysis of Multimedia Compression Algorithms
Godwin Awuah Amoah *
Department of Computer Science, Kwame Nkrumah University of Science and Technology, Kumasi, Ghana.
Esthella Rahama Abdul Wahab
Department of Computer Science, Kwame Nkrumah University of Science and Technology, Kumasi, Ghana.
*Author to whom correspondence should be addressed.
Abstract
Data compression reduces the amount of bits needed to encode information, conserving expensive resources like disc space and transmission bandwidth. By using data compression, an information block's real size is kept as little as possible. The compression process consists of two steps: encoding, which uses fewer bits to compress a message, and decoding, which uses the compressed representation to roughly resemble or replicate the original message. The two main types of data compression are lossless compression and lossy approaches. The Huffman, Lempel-Ziv, and Run Length encoding techniques were all examined in this research, along with three other commonly used compression techniques. According to the research, Run Length Encoding was the best method for reducing the size of text, web pages, images, and sound.
Keywords: Decompression, algorithms, multimedia compression algorithms, lempel-ziv-welch, run-length