Implementasi Algoritma Set Partitioning in Hierarchical Trees (SPIHT) dan Algoritma Huffman Untuk Kompresi File Citra
DOI:
https://doi.org/10.47065/bulletincsr.v2i2.156Keywords:
Implementation; Image File Compression; Set Partitioning In Hierarchical Trees; HuffmanAbstract
As technology develops, the process of sending files no longer needs to be done manually. Data or files can be sent electronically via email. The image file size is sometimes very large, where the better the quality of the resulting image, the bigger the pixel size needed to record the image. With a very large image file size, the transfer process may fail, because the media storage space exceeds its limit. The solution to this problem is how the image file can be compressed in order to speed up the transfer and storage of image files. Image compression is done by reducing the size of the image file by reducing the bits in the image file, but not eliminating the information data in it. By compressing, large data will be reduced in size so as to save storage space. In this study, the algorithm used is the Swiss army knife data compression, using this method, the compression results from the value of k have different compression results for each value, and the compression results will be beneficial in sending and moving image files more easily
Downloads
References
K.Mahesa,"Rancang Bangun Aplikasi Kompresi Dan Dekompresi Pada Citra Digital Menggunakan Metode Huffman", Jurnal Processor, vol. 12, no. 1, pp. 997–1012, pekan baru, 2017.
L. Marlina, A. Putera, U. Siahaan, H. Kurniawan, and I. Sulistianingsih, “Data Compression Using Elias Delta Code", Int. J. Recent Trends Eng, Res., vol. 3, no. 8, pp. 210–217, jakarta, 2017.
Jubilee Enterprise,"Rahasia Manajemen File", PT Elex Media Komputindo, Jakarta, 2010.
DMW Simamora, G Ginting, dan Y Hasan, Implementasi Algoritma Run Length Encoding Pada Kompresi File MP3, Jurikom, ISSN : 2407-389X Pp: 5-9, Medan, 2016.
Piyu Tsai, Yu-Chen Hu b, Chin-Chen Chang, “Menggunakan Partisi Set Dalam Hierarki Hierarki Untuk Otentikasi Gambar Digital.” Pers, Pasal D I et al. 2003. 18: 813–22.
K.M.S Eka Prayoga,”Implementasi algoritma Huffman dan Run Length Encoding pada aplikasi kompresi berbasis web,"J.ilmiah Teknol.Inf. Terap. vol.IV.2018.
E. S. Mulyanta,"Dari Teori Hingga Praktik:Pengolahan Digital Image dengan Photoshop CS2", C.V Andi Offset, Yogyakarta, 2006.
S. S. M. K. Dr.pulung Nurtantio Andono, S.T, M.Kom, T.sutojo,"Konsep Pengolahan Citra Digital", C.V Andi Offset, Yogyakarta, 2015.
Darma Putra," Pengolahan Citra Digital", C.V Andi Offset, Yogyakarta, 2010.
T. S. M. Pulung Nurtantio Andono," Pengolahan Citra Digital", C.V Andi Offset, Yogyakarta, 2017.
Bila bermanfaat silahkan share artikel ini
Berikan Komentar Anda terhadap artikel Implementasi Algoritma Set Partitioning in Hierarchical Trees (SPIHT) dan Algoritma Huffman Untuk Kompresi File Citra
ARTICLE HISTORY
How to Cite
Issue
Section
Copyright (c) 2022 Lubis Irsan
This work is licensed under a Creative Commons Attribution 4.0 International License.
Authors who publish with this journal agree to the following terms:
- Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under Creative Commons Attribution 4.0 International License that allows others to share the work with an acknowledgment of the work's authorship and initial publication in this journal.
- Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgment of its initial publication in this journal.
- Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (Refer to The Effect of Open Access).
