Kompresi File Video Menggunakan Algoritma Yamamoto’s Recursive Code
-
Ronaldo P. Butar-Butar
*
Universitas Budi Darma,
Indonesia
(*) Corresponding Author
Abstract
At this time it is very common to use it in all aspects, from advertising, films, even learning during the COVID-19 pandemic using video media as a learning medium. Large video file sizes can reduce free space on storage media such as hard drives, flash drives and so on. The more videos that are stored, the less free space is left, or even no free space is left on the storage media. This will not cause a problem if the storage media used has a large capacity, but not everyone has a large storage media. One way to overcome this problem is to use compression techniques. Data compression is a process of converting a set of data into a form of code to save the need for data storage. On this basis, the application of Yamamoto's Recursive Code Algorithm in Compressing Video Files is made in order to help users compress video files that are initially large into their smallest size. Video compression is the opposite of digital video data compression. Compression is the conversion of data to a smaller format, usually done so that data can be stored or transmitted more efficiently. The process of recovering data that has been reduced is called decompression.
Downloads
References
A. Setiawan, "Kompresi Video Menggunakan Metode Hybrid DWT dan DCT untuk Pengurangan Ukuran File," Jurnal Teknologi Informasi dan Komputer, vol. 4, no. 2, pp. 123-130, Apr. 2016.
S. Andriani, "Penerapan Algoritma Kompresi Lossy pada Citra Digital," Jurnal Teknologi Informasi dan Komunikasi, vol. 7, no. 1, pp. 23-30, 2017
MusdalifaThamrin, “jurnal penelitian kompresi,” vol. 148, hal. 148–162.
H. T. Sihotang, “Perancangan Dan Implementasi Algoritma Arithmetic Coding Untuk Aplikasi Kompresi Data Video Dan Audio,” J. Mantik Penusa, vol. 2, no. 1, hal. 58–64, 2018.
I. G. Rasagama, “Pengembangan Model Pembelajaran Getaran Berbasis Video Youtube Untuk Meningkatkan Pemahaman Konsep Mahasiswa Politeknik,” J. Pendidik. Sains, vol. 8, no. 2, hal. 91, 2020, doi: 10.26714/jps.8.2.2020.91-101.
M. S. Wahyuni, “Analisa Membandingkan Hasil Kompresi File Mpeg-4 Dan Flv Menggunakan Algoritma Huffman Dan Lz77,” Saintek ITM, vol. 32, no. 1, hal. 40–47, 2019, doi: 10.37369/si.v32i1.52.
. S., T. B. Adji, dan H. A. Nugroho, “Pengaruh Load Balancing Pada Pemrosesan Paralel untuk Kompresi Video,” Conf. Senat. STT Adisutjipto Yogyakarta, vol. 2, hal. 121, 2016, doi: 10.28989/senatik.v2i0.85.
A. Triantoro, H. Sajati, dan A. Pujiastuti, “the Audio Video of Web-Based Compression With Ffmpeg,” Compiler, vol. 7, no. 2, hal. 132, 2018, doi: 10.28989/compiler.v7i2.280.
A. Pratama, "Analisis Teknik Kompresi Video pada Media Penyimpanan dan Pengiriman Data", Jurnal Teknologi Informasi dan Komunikasi, vol. 8, no. 2, pp. 100-110, 2016.
D. G. Irianto, "Analisis Perbandingan Format Video MP4 dan FLV Berdasarkan Kualitas dan Ukuran File," Jurnal Teknologi Informasi dan Ilmu Komputer, vol. 4, no. 2, pp. 120-126, Mei 2016.
Arianti Rhamadani, "Analisa Perbandingan Algoritma Taboo Codes dan Algoritma Yamamoto’s Recursive Code untuk Kompresi File Teks Menggunakan Metode Exponential," KOMIK (Konferensi Nasional Teknologi Informasi dan Komputer), vol. 6, no. 1, pp. 123-130, 2018. DOI: 10.30865/komik.v6i1.5728.
M. Y. Alfian, "Implementasi Kode Recursif Yamamoto pada Pengkodean Data Positif," Jurnal Teknologi Informasi dan Komunikasi, vol. 7, no. 2, pp. 123-130, 2016.
D. Salomon dan G. Motta, Handbook of Data Compression 5th, vol. 53, no. 9. 2019.
H. Herdianto, "Perbandingan Metode RLE dan Huffman dalam Kompresi Data Teks," Jurnal Ilmiah Core IT : Community Research Information Technology, vol. 9, no. 3, pp. 1-10, 2017.
M. L. Imani, R. R. Muhima, dan S. Agustini, "Penerapan Metode Huffman dalam Kompresi Data," Prosiding Seminar Nasional Sains dan Teknologi Terapan, 2016.
Ilham Akhsanu Ridlo, “Pedoman Pembuatan Flowchart,” Academia.Edu, hal. 14, 2017, [Daring]. Tersedia pada: https://www.academia.edu/34767055/Pedoman_Pembuatan_Flowchart.
A. S. Sembiring, S. R. Siregar, "Analisa Perbandingan Algoritma Yamamoto’s Recursive Code dan Algoritma Fibonacci Code dalam Mengkompresi File Pptx," KOMIK (Konferensi Nasional Teknologi Informasi dan Komputer), vol. 6, no. 1, pp. 1-10, 2018.
S. B. Ginting, "Perbandingan Algoritma Yamamoto’s Recursive Code dan Additive Code dalam Kompresi File Video," KOMIK (Konferensi Nasional Teknologi Informasi dan Komputer), vol. 5, no. 1, pp. 1-7, 2018.
N. Aftikasyah, "Penerapan Algoritma Yamamoto’s Recursive Code untuk Mengkompresi File Dokumen," KOMIK (Konferensi Nasional Teknologi Informasi dan Komputer), vol. 5, no. 1, pp. 1-8, 2018.
T. A. Kurniawan, “Pemodelan Use Case (UML): Evaluasi Terhadap beberapa Kesalahan dalam Praktik,” J. Teknol. Inf. dan Ilmu Komput., vol. 5, no. 1, hal. 77, 2018, doi: 10.25126/jtiik.201851610.
Bila bermanfaat silahkan share artikel ini
Berikan Komentar Anda terhadap artikel Kompresi File Video Menggunakan Algoritma Yamamoto’s Recursive Code
Pages: 149-159
Copyright (c) 2023 Ronaldo P. Butar-Butar
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).
