Comparative Analysis of Multimedia Compression Algorithms
Asian Journal of Mathematics and Computer Research, Volume 30, Issue 2,
Page 26-37
DOI:
10.56557/ajomcor/2023/v30i28265
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.
- Decompression
- algorithms
- multimedia compression algorithms
- lempel-ziv-welch
- run-length
How to Cite
References
Salomon D, Motta G. Data compression: The complete reference. 5th ed. New York: Springer; 2010.
Porwal S, Chaudhary Y, Joshi J, Jain M. Data compression methodologies for lossless data and comparison between algorithms. 2013;2(2):142-7.
Europe T. An introduction to fractal image compression. 1997;Outubro(October):20.
Yuan S, Hu J. Research on image compression technology based on Huffman coding. J Vis Commun Image Represent. 2019;59:33-8.
Sharma M. Compression using Huffman coding. IJCSNS Int J Comput Sci Netw Sec. 2010;10(5).
Dipperstein M. Adaptive delta coding discussion and implementation [online]; 2015.
Available:http://michael.dipperstein.com/delta/index.html
Raundale P. Comparative study of data compression techniques. Int J Comput Appl. 2019;178(28).
ZainEldin H, Elhosseini MA, Ali HA. Image compression algorithms in wireless multimedia sensor networks: A survey. Ain Shams Eng J. 2015;6(2):481-90.
Barman R, Deshpande S, Kulkarni N, Agarwal S, Badade S. A review on lossless data compression techniques. Int J Sci Res Eng Trends. 2021;7(1):2395-566X.
Chenthara S, Ahmed K, Wang H, Whittaker F. Security and privacy-preserving challenges of e-health solutions in cloud computing. IEEE Access. 2019;7:74361-82.
Fitriya LA, Purboyo TW, Prasasti AL. A review of data compression techniques. Int. J Appl. Eng. Res. 2017;12(19):8956-63.
Smith SW. ’Data Compression. Sci; Eng Guid. to Digit. Signal Process. 1997;481-502.
Vimalachandran P, Wang H, Zhang H, Zhuo G, Kuang H. Cryptographic access control in electronic health record systems: a security implication. International Conference on Web Information Systems Engineering. 2017;540-9.
Chenthara S, Ahmed K, Wang H, Whittaker F. Security and privacy-preserving challenges of e-health solutions in cloud computing. IEEE Access. 2019;7:74361-82.
Ballé J. Efficient nonlinear transforms for lossy image compression. Picture Coding Symp (PCS), San Francisco, CA. 2018;248-52.
Qin C, Zhou Q, Cao F, Dong J, Zhang X. Flexible lossy compression for selective encrypted sImage inpainting. IEEE Trans Circuits Syst For Video Technol. 2019;29(11):3341-55.
Bhattacharjee AKB, Bej T, Agarwal S. Comparison study of lossless data compression algorithms for text data. IOSR JCE. 2013;11(6):15-9.
Grossberg M, Gladkova I, Gottipati S, Rabinowitz M, Alabi P, George T, et al. A comparative study of lossless compression algorithms on multi-spectral imager data Data Compression conference. 2015;2015:447-
Salomon D. Data compression: The complete reference. 3rd ed. Northridge, CA; 2004.
Gupta A, Nigam S. A review on different types of lossless data compression techniques. IJSRCSEIT. 2021;7(1):50-6.
-
Abstract View: 0 times
PDF Download: 0 times