Julianti, Dian (2003) KOMPRESI GAMBAR MENGGUNAKAN ALGORITMA HUFFMAN. Diploma thesis, Universitas Komputer Indonesia.

Full text not available from this repository.
Official URL: http://elib.unikom.ac.id/gdl.php?mod=browse&op=rea...


Compressing an image consists of transform and quantization process, having the character of lossy and lossless. The compression can be undertaken by discrete cosine transform (DCT), quantization, Run Length Encoding (RLE) and Huffman algorithm. The Huffman Compression algorithm is an algorithm used to compress files. To minimize the number of bits required, the length of code of any character can be shortened as much as possible, especially these characters that appear more frequently. In Huffman algorithm is used a tree for file compression that is called Huffman tree. It is used to find code of the character after file compression.

Item Type: Thesis (Diploma)
Subjects: S1-Final Project > Fakultas Teknik Dan Ilmu Komputer > Teknik Informatika > 2003
Divisions: Universitas Komputer Indonesia > Fakultas Teknik dan Ilmu Komputer
Universitas Komputer Indonesia > Fakultas Teknik dan Ilmu Komputer > Teknik Informatika (S1)
Depositing User: Admin Repository
Date Deposited: 16 Nov 2016 07:40
Last Modified: 16 Nov 2016 07:40
URI: http://repository.unikom.ac.id/id/eprint/4827

Actions (login required)

View Item View Item