Analisa Kombinasi Algoritma Burrows  Wheeler Transform dan Adaptive Huffman Coding untuk Kompresi Citra

Gusron Hasibuan

Gusron Hasibuan * Un, Indonesia

(*) Corresponding Author

Keywords: Image; Compression; BWT; AHC

Abstract

Image is one of the tools that humans use to convey messages to other humans. Image has developed along with the development of human civilization. Combination of Burrows Wheeler Transform (BWT) with Adaptive Huffman Coding (AHC) The process of Adaptive Huffman Coding Algorithm is reading one by one from the leftmost character to the end, it will change the initial character data using Burrows Wheeler Transform to change the order of the character set to be read by Adaptive Huffman Coding. This aims to compress the image by combining the Burrows Wheeler Transform method and the Adaptive Huffman Coding Algorithm to make the image file capacity small so that it can save storage media and is not slow when sending images from one place to another. Compression results depend on the selection of the desired compression quality. If you choose compression with standard quality, then the compressed image with the original image will not see the difference, but the reduction in bytes size is not too drastic. But if we choose a low compression quality, then the size of the bytes in the image will be reduced but the quality of the compressed image will be visible the difference with the original image.

References

[1] R. Krasmala, A. Budimansyah, and U. T. Lenggana, “Kompresi Citra Dengan Menggabungkan Metode Discrete Cosine Transform (DCT) dan Algoritma Huffman,” J. Online Inform., vol. 2, no. 1, p. 1, 2017, doi: 10.15575/join.v2i1.79.
[2] I. Lubis, P. Tarigan, and N. Sitompul, “Analisa Perbandingan Kompresi Citra Menggunakan Metode Discrete Cosine Transform ( Dct ) Dan Burrows Wheeler Transform ( Bwt ),” Pelita Inform., vol. 16, pp. 285–287, 2017.
[3] D. Venkatasekhar and P. Aruna, “a Fast Fractal Image Compression Using Huffman Coding,” Asian J. Comput. Sci. Inf. Technol., vol. 2, no. 9, pp. 272–275, 2012.
[4] W. W. Kelen and D. Nugraheny, “Analisa Pemrosesan Paralel Untuk Kompresi Dan Dekompresi Data,” Compiler, vol. 4, no. 1, pp. 65–74, 2015, doi: 10.28989/compiler.v4i1.89.
[5] I. R. Lubis, “Menggunakan Metode Eksponensial,” vol. 16, pp. 382–384, 2017.
[6] Y. Darnita, K. Khairunnisyah, and H. Mubarak, “Kompresi Data Teks Dengan Menggunakan Algoritma Sequitur,” Sistemasi, vol. 8, no. 1, p. 104, 2019, doi: 10.32520/stmsi.v8i1.429.
[7] Van, V. S. 2009. Image Compression Using Burrows-Wheeler Transform. Tesis. Helsinki University Of Technology.
[8] Marjiyono, “Penerapan Algoritma Ahc Algorithm Dalam Aplikasi,” pp. 6– 8, 2015.
[9] T. Zebua and E. Ndruru, “Pengamanan Citra Digital Berdasarkan Modifikasi Algoritma RC4,” J. Teknol. Inf. dan Ilmu Komput., vol. 4, no. 4, p. 275, 2017, doi: 10.25126/jtiik.201744474.
[10] A. Nugroho, Rekayasa Perangkat Lunak Berorientasi Objek dengan Metode USDP. Yogyakarta: Penerbit ANDI, 2010.
[11] R. Hakim, Visual Basic 2008 for Pemula Banget. Jakarta: Elex Media Komputindo, 2009.
[12] Ihsan and D. P. Utomo, “Analisis Perbandingan Algoritma Even-Rodeh Code Dan Algoritma Subexponential Code Untuk Kompresi File Teks,” KOMIK (Konferensi Nas. Teknol. Inf. dan Komputer), vol. 4, no. 1, 2020.
[13] S. R. Saragih and D. P. Utomo, “Penarapan Algoritma Prefix Code Dalam Kompresi Data Teks,” KOMIK (Konferensi Nas. Teknol. Inf. dan Komputer), vol. 4, no. 1, 2020.
[14] Lamsah and D. P. Utomo, “Penerapan Algoritma Stout Codes Untuk Kompresi Record Pada Databade Di Aplikasi Kumpulan Novel,” KOMIK (Konferensi Nas. Teknol. Inf. dan Komputer), vol. 4, no. 1, 2020.

Bila bermanfaat silahkan share artikel ini

Berikan Komentar Anda terhadap artikel Analisa Kombinasi Algoritma Burrows Wheeler Transform dan Adaptive Huffman Coding untuk Kompresi Citra