Analisis Perbandingan Algoritma Lz78 Dengan Algoritma Transformasi Walsh-Hadamard Untuk Kompresi Citra
DOI:
https://doi.org/10.30865/komik.v6i1.5792Keywords:
Image Compression, LZ78 Algorithm, Walsh-Hadamard Transformation AlgorithmAbstract
Data communication is an activity that is very often carried out in the field of information technology. Data with a large size will take a longer transfer time compared to data that has a smaller size, sometimes there is a risk that it cannot be accommodated on the storage media and is not delivered, so that it will reduce the empty capacity in the memory of the storage media. This can cause the data transformation process to be slow and take a long time. The solution that can solve the above problem is by doing compression. Compression is a technique that can reduce the size of the image to be smaller than its original size. This compression performs a compression technique with compression properties where it is allowed to lose some or most of the data in the image. The algorithm used in this study is the LZ78 algorithm with the Walsah-Hadamard Transform algorithm. To find out the comparison of the compression performance, the parameters to be compared are Ratio of Compression (RC), Space Saving (SS). Based on the results of the researcher's test in comparing the LZ78 algorithm with the Walsh-Hadamard Transformation, the compression value obtained by calculating the ratio that the Walsh-Hadamard Transform algorithm is better than LZ78 where the results of the comparison of the Ratio of Compression of the Walsh-Hadamard Transformation algorithm are 0.71 bits, while the Ratio of 2.66 bit LZ78 compression algorithm. LZ78 62.5% while the Compression Ratio algorithm Walsh-Hadamard Transformation 76%References
D. M. Rajagukguk, A. Mahmud, P. Informatika, B. Darma, Dan V. I. Volume, “Algoritma Huffman Dengan Algoritma ( Lempel-Zip- Welch ) Pada Kompresi Gambar Menggunakan M ...â€
U. S. Utara, “Algoritma Transformasi Walsh-Hadamard Dengan Run Length Encoding ( Rle ) Draft Skripsi Rachmi Handriyati,†2013.
U. S. Utara, “Algoritma Transformasi Walsh-Hadamard Dengan Run Length Encoding ( Rle ) Draft Skripsi Rachmi Handriyati,†2013.
T. H. Simbolon, “Perbandingan Algoritma Transformasi Walsh- Hadamard Dengan Metode Run Length,†Hal. 114–119, 2017.
S. Hasibuan Dan R. D. Sianturi, “Penerapan Algoritma Boldy Vigna Untuk Mengkompresi File Gambar Berformat ( Bmp ),†Vol. 10, Hal. 109–118, 2022.
E. Ndruru Dan U. B. Darma, “Kompresi File Citra Dengan Algoritma Transformasi,†Vol. Iv, No. 1, Hal. 1–7, 2020.
D. A. Depika Dan S. D. Nasution, “Penerapan Algoritma Punctured Elias Codes Dalam Kompresi Citra,†Vol. 2, No. 2, Hal. 176–187, 2020.
C. T. Utari, “Implementasi Algoritma Run Length Encoding Untuk Perancangan Aplikasi Kompresi Dan Dekompresi File Citra,†J. Times, Vol. V, No. 2, Hal. 24–31, 2016.
U. Lu Dan N. H. Salsabila, “Penggunaan Metode Run Length Encoding Untuk Kompresi Data,†No. 1, Hal. 273–280, 2017.
R. A. Purba, L. Sitorus, A. Coding, Dan L. Z. Welch, “Analisis Perbandingan Algoritma Arithmetic Coding Dengan Algoritma Lempel Ziv Welch ( Lzw ) Dalam Kompresi Teks,†Vol. 03, Hal. 158–165, 2018.
P. Studi Et Al., “Perbandingan Algoritma Lzss Dan Lzmw Untuk Kompresi Data Teks.â€
T. Tommy, R. Siregar, A. M. Husein, M. Harahap, Dan F. Riza, “Analisis Performa Rasio Kompresi Pada Metode Differensiasi Ascii Dan Lempel Ziv Welch (Lzw),†J. Teknol. Dan Ilmu Komput. Prima, Vol. 1, No. 2, Hal. 20–26, 2018, Doi: 10.34012/Jutikomp.V1i2.225.
