GDL

Evaluation of Huffman and Arithmetic Algorithms for Multimedia Compression Standards

ISSN : 2230 - 9616
Journal from gdlhub / 2017-08-14 11:52:33
Oleh : Asadollah Shahbahrami, Ramin Bahrampour,MobinS abbaghi Rostami and Mostafa Ayoubi Mobarhan, International Journal of Computer Science, Engineering and Applications
Dibuat : 2012-06-26, dengan 1 file

Keyword : Multimedia Compression, JPEG standard, Arithmetic coding, Huffmancoding.
Subjek : Evaluation of Huffman and Arithmetic Algorithms for Multimedia Compression Standards
Url : http://airccse.org/journal/ijcsea/papers/0811ijcsea04.pdf
Sumber pengambilan dokumen : Internet

Compression is a technique to reduce the quantity of data without excessively reducing the quality of the


multimedia data.The transition and storing of compressed multimedia data is much faster and more efficient


than original uncompressed multimedia data. There are various techniques and standards for multimedia


data compression, especially for image compression such as the JPEG and JPEG2000 standards. These


standards consist of different functions such as color space conversion and entropy coding. Arithmetic and


Huffman coding are normally used in the entropy coding phase. In this paper we try to answer the following


question. Which entropy coding, arithmetic or Huffman, is more suitable compared to other from the


compression ratio, performance, and implementation points of view? We have implemented and tested


Huffman and arithmetic algorithms. Our implemented results show that compression ratio of arithmetic


coding is better than Huffman coding, while the performance of the Huffman coding is higher than


arithmetic coding. In addition, implementation of Huffman coding is much easier than the arithmetic coding.

Deskripsi Alternatif :

Compression is a technique to reduce the quantity of data without excessively reducing the quality of the


multimedia data.The transition and storing of compressed multimedia data is much faster and more efficient


than original uncompressed multimedia data. There are various techniques and standards for multimedia


data compression, especially for image compression such as the JPEG and JPEG2000 standards. These


standards consist of different functions such as color space conversion and entropy coding. Arithmetic and


Huffman coding are normally used in the entropy coding phase. In this paper we try to answer the following


question. Which entropy coding, arithmetic or Huffman, is more suitable compared to other from the


compression ratio, performance, and implementation points of view? We have implemented and tested


Huffman and arithmetic algorithms. Our implemented results show that compression ratio of arithmetic


coding is better than Huffman coding, while the performance of the Huffman coding is higher than


arithmetic coding. In addition, implementation of Huffman coding is much easier than the arithmetic coding.

Beri Komentar ?#(0) | Bookmark

Properti	Nilai Properti
ID Publisher	gdlhub
Organisasi	International Journal of Computer Science, Engineering and Applications
Nama Kontak	Herti Yani, S.Kom
Alamat	Jln. Jenderal Sudirman
Kota	Jambi
Daerah	Jambi
Negara	Indonesia
Telepon	0741-35095
Fax	0741-35093
E-mail Administrator	elibrarystikom@gmail.com
E-mail CKO	elibrarystikom@gmail.com