Comparing Freeman Chain Code 4 Adjacency Algorithm and LZMA Algorithm in Binary Image Compression
Year: 2021
Type: conference-paper
Abstract: Image is one product that has experienced a significant increase in quality. Insufficient internet capacity makes it difficult to access large images. Image compression is one way to solve this problem, but image compression can make image quality degrade. This research uses lossless compression algorithms, namely Chain Code Algorithm and LZMA Algorithm, to reduce the quality of the image and can be adjusted the tolerance value manually. In the application that will be created, the user can select the image to be compressed, then compress it according to the tolerance value that has been set and with the compression result of a text file, where the text file can be extracted and reconstructed into an image. There will be a preview of the results of the image compression and a description of the size and quality reduction levels. The conclusion of this research is that Chain Code Algorithm and LZMA Algorithm are able to compress image file sizes / images with extensions .jpg, .png. .bmp with a success rate of 90% from 50 tests.
Authors: Resdiansyah, Justin Darmawan, Adrian Hartanto Wijaya, Lukman Hakim, Hendy Tannady
Institutions: Universitas Pembangunan Jaya, University of Bunda Mulia
Language: English
Subfield: Computer Vision and Pattern Recognition
Field: Computer Science
Domain: Physical Sciences
Open Access status: diamond
OpenAlex ID: W3163298587
