We use a few cookies

Essential cookies keep the library working. With your permission, we'd also like to use analytics to see what's useful and improve the experience. Read our Privacy Policy or Cookie Policy.

Skip to main content
Home/e-Resources/Artificial Intelligence & Machine Learning/Implementasi Algoritma Yamamoto’s Recursive Code Dalam Mengkompresi File Gambar
PeriodicalsArtificial Intelligence & Machine Learning

Implementasi Algoritma Yamamoto’s Recursive Code Dalam Mengkompresi File Gambar

Checking your access to this record.

Abstract & Overview

The size of the data stored whether it is stored on a computer or in cloud storage is one of the problems in the computer world. One of the best solutions to overcome this problem is to use compression techniques. In this study, the author uses Yamamoto's Recursive Code Algorithm to compress image files. Image files with bitmap (bmp) extension have a smaller size than those in jpeg format, this causes problems if the recipient's download speed is slow or the internet connection is unstable, information, information cannot be processed immediately because the data transfer time is too long. For that we need a technique to change the size of the data to be smaller . This technique is known as data compression. 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 Image Files is made in order to help computer users compress image files that are initially large into their smallest size.

Cite this record

Lulu Nurhidayanti Nasution (2023). Implementasi Algoritma Yamamoto’s Recursive Code Dalam Mengkompresi File Gambar. Bulletin of Artificial Intelligence., 2(2), 112–117. https://doi.org/10.62866/buai.v2i2.105

Copy in another style

Nasution, L. N. (2023). Implementasi Algoritma Yamamoto’s Recursive Code Dalam Mengkompresi File Gambar. Bulletin of Artificial Intelligence., 2(2), 112–117. https://doi.org/10.62866/buai.v2i2.105
Author names are used as deposited, so check their order before you submit.

Metadata is harvested from open-access indexes and can be incomplete. Check a citation against the published version before relying on it — see our open access & attribution policy.