Fast Method Of Image File Compression In Web-Based Application Form Using Huffman Algorithm
DOI:
https://doi.org/10.53697/jkomitek.v3i2.1214Keywords:
Fast Method, File Compression, Website formAbstract
Many web-based applications/forms serve as online data entry devices equipped with facilities for uploading image data. When uploading image data, the image file is often incompatible or cannot be uploaded because the size is too large. Users have to resize those files separately. For example, with several compression applications used such as photoshop, gimp, photoscape, photo compressor, image size and many other compression applications. Web-based applications should be able to automatically resize the file according to the appropriate file size so that it can save time and speed up the process. To deal with the problem of automatic compression, the user must provide or build a web-based application that can directly compress files on the web because automatic file or image compression is available on the website without compressing them separately beforehand. With this automatic compression form application, it certainly reduces costs. (quota) internet, shortening time and also making it easier for users or users when uploading files on the web. The algorithm that is suitable for resizing files in online web applications is the hufman algorithm.
References
K. Mahesa, “Dekompresi Pada Citra Digital,” vol. 12, no. 1, pp. 948–963, 2017.
Sodikin, T. F. Putri, and T. Hidayat, “Analisa Kompresi File Teks Menggunakan Algortima Huffman,” vol. 3, no. 1, pp. 10–19.
F. Masruri, “Kompresi Citra Digital Menggunakan Kode Huffman,” 2020.
A.S, Rosa, dan M. Shalahuddin. 2016. Rekayasa Perangkat Lunak Terstruktur dan Berorientasi Objek. Bandung: Informatika Bandung.A. R. I. Widagdo, “Tugas akhir implementasi algoritma metode huffman pada kompresi citra,” 2012.
Lubis et al., “Huffman coding pada image compression 1,” vol. 12, no. 1, pp. 16–25, 2022.
F. Soufitri, “Perancangan Data Flow Diagram Untuk Sistem Informasi Sekolah (Studi Kasus Pada Smp Plus Terpadu),” Ready Star, vol. 2, no. 1, pp. 240–246, 2019.
M. Lazuardi Imani, R. Rotul Muhima, and S. Agustini, “Penerapan Metode Huffman dalam Kompresi Data,” Semin. Nas. Sains dan Teknol. IX 2021 Inst. Teknol. Adhi Tama Surabaya, pp. 457–462, 2021.
Pujianto, Mujito, B. H. Prasetyo, and D. Prabowo, “Perbandingan Metode Huffman dan Run Length Encoding Pada Kompresi Document,” InfoTekJar J. Nas. Inform. dan Teknol. Jar., vol. 5, no. 1, pp. 216–223, 2020.
D. Debiyanti, S. Sutrisna, B. Budrio, A. K. Kamal, and Y. Yulianti, “Pengujian Black Box pada Perangkat Lunak Sistem Penilaian Mahasiswa Menggunakan Teknik Boundary Value Analysis,” J. Inform. Univ. Pamulang, vol. 5, no. 2, p. 162, 2020, doi: 10.32493/informatika.v5i2.5446.
I. A. Ridlo, “Pedoman Pembuatan Flowchart,” Academia.Edu, p. 27, 2017.
V. Amrizal, “Implementasi Algoritma Kompresi Data Huffman Untuk Memperkecil Ukuran File MP3 Player,” J. Tek. Inform., vol. 2, no. 1, pp. 1–14, 2011, doi: 10.15408/jti.v2i1.8.
D. Asdini and D. P. Utomo, “Analisis Perbandingan Kinerja Algoritma Huffman dan Algoritma Levenstein Dalam Kompresi File Dokumen Format .RTF,” KOMIK (Konferensi Nas. Teknol. Inf. dan Komputer), vol. 6, no. November, pp. 87–99, 2022, doi: 10.30865/komik.v6i1.5739.
M. Chulkamdi, S. Pramono, and E. Yudaningtyas, “Kompresi Teks Menggunakan Algoritma Huffman Dan Md5 Pada Instant Messaging Smartphone Android,” J. EECCIS, vol. 9, no. 1, pp. 103–108, 2015.
Downloads
Published
How to Cite
Issue
Section
License
Copyright (c) 2023 Ronny Saputra, Yuza Reswan, Yulia Darmi, Khairullah

This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.