Comparative Analysis of Multimedia Compression Algorithms

Amoah, Godwin Awuah and Wahab, Esthella Rahama Abdul (2023) Comparative Analysis of Multimedia Compression Algorithms. Asian Journal of Mathematics and Computer Research, 30 (2). pp. 26-37. ISSN 2395-4213

Full text not available from this repository.

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.

Item Type: Article
Subjects: European Repository > Mathematical Science
Depositing User: Managing Editor
Date Deposited: 09 Dec 2023 03:36
Last Modified: 09 Dec 2023 03:36
URI: http://go7publish.com/id/eprint/3859

Actions (login required)

View Item
View Item