Perpustakaan judul masih dalam tahap pengembangan, admin siap menampung kritik dan saran
KOMPRESI GAMBAR
MENGGUNAKAN ALGORITMA HUFFMAN
DIAN JULIANTI (2003) | Skripsi | Teknik Informatika , Teknik Informatika , Teknik Informatika , Teknik Informatika , Teknik Informatika
Bagikan
Ringkasan
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.
Ringkasan Alternatif
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.