Analisis Perbandingan Kompresi Citra Menggunakan Algoritma Run Length Encoding dan Algoritma Fixed Length Binary Encoding

Images are among the most common and popular representations of data. Digital images are used for professional and personal use ranging from official documents to social media. Thus, any Organization or individual needs to store and share a large number of images. One of the most common issues associated with using images is the potentially large file-size of the image. Advancements in image acquisition technology and an increase in the popularity of digital content means that images now have very high resolutions and high quality, inevitably leading to an increase in size. Image compression has become one of the most important parts of image processing these days due to this. The goal is to achieve the least size possible for an image while not compromising on the quality of the image, that gives us the perfect balance. Therefore, to achieve this perfect balance many compression techniques have been devised and it is not possible to pinpoint the best one because it is really dependent on the type of image to be compressed. So here we are going to elaborate on converting images into binary images and the Run length Encoding (RLE) algorithm used for compressing binary images. Now, RLE is itself a very effective and simple approach for compression of images but, sometimes, the size of an image actually increases after RLE algorithm is applied to the image and this is one of the major drawbacks of RLE. In this research paper we are going to propose an extension or maybe an upgradation to RLE method which will ensure that the size of an image never exceeds beyond its original size, even in the worst possible scenario.

The increase of data usage causes problems in data storage, indirectly making the need for data storage also to increase. One alternative solution that can be done is to compress the file so that the file becomes smaller in size so it saves storage space. The algorithm used in this research is the Run Length Encoding algorithm, the Even Rodeh Code algorithm, and the Variable Length Binary Encoding algorithm which are the types of lossless compression. The algorithm will calculate its performance based on Compression Ratio, Ratio of Compression, Redundancy, Compression Time, and Decompression Time. The file that will be used in the data compression process is the file extension *.txt. This study used homogeneous strings (strings that have the same character) and heterogeneous strings (strings that have different characters) in testing the algorithm. In the compression process with a homogeneous string, the combination of the Run Length Encoding algorithm with the Variable Length Binary Encoding algorithm is better than the combination of the Run Length Encoding algorithm and the Even Rodeh Code algorithm with a Compression Ratio of 18.84% and a decompression time of 0.01295 ms. While the compression process on heterogeneous strings from the combination of the Run Length Encoding algorithm with the Even Rodeh Code algorithm is better than the combination of the Run Length Encoding algorithm with Variable Length Binary Encoding algorithms with Compression Ratio of an average of 52.45% and fewer decompression times of 4.93002 ms

Virtual tour is one of the rapidly growing applications of multimedia technology which is used for various purposes, including the dissemination of information in an interesting way. The education sector is also not spared from using virtual tour media for promotional purposes, and campuses are no exception to this rule. Large virtual tour content causes high access speed, ultimately reducing the level of comfort experienced by users. This study aims to compress panoramic images displayed on a campus virtual tour using a lossless compression method and the Run Length Encoding (RLE) algorithm. First, panoramic images are combined into one, then individual images are compressed. When recreating a virtual campus tour, compressed images are used so that the amount of data transferred is smaller. The load access speed index increases from 7,233 seconds to 3,789 seconds when images are compressed from 64 bits to 8 bits, with a compression percentage of 27%. The findings from this research are that the RLE algorithm has not been able to compress large files effectively even though it is quite successful in increasing the load access of the virtual tour website.

Compression purpose to reduce the redundancy data as small as possible and speed up the data transmission process. To solve the size problem in saving data and transmission process, we use Run Length Encoding and Fibonacci Code algorithm to do compression process. Run Length Encoding and Fibonacci Code algorithm is a type of lossless data compression used in this research, which performance will be measured by comparison parameters of the Compression Ratio (CR), Redundancy (RD), Space Saving (SS) and Compression Time. The compression process is only done on image files with Bitmap format (*.bmp) and encode using Run Length Encoding or Fibonacci Code, then perform the compression process. The final result of the compression is file with extension *.rle or *.fib which contains compressed information that can be decompressed back. The output of the decompression result is an original image file that is stored with *.bmp extension. Fibonacci algorithm will give a better compressed size on image color, while in a grayscale image Run Length Encoding will give a better compressed size. Based on the results of research at two different types of images, each algorithm has its own advantages. Fibonacci Code algorithm is better for color image compression while Run-Length algorithm Encoding is better for grayscale image compression.

One method of using data compression is by using a method called Run Length Encoding (RLE), especially image data. The RLE method is one of the simplest lossless types of data compression schemes and is based on the simple principle of data encoding. The RLE method is very suitable for compressing data containing repetitive characters such as simple graphic images. The compressed data are 28 RGB (Red, Green, Blue) images and 28 grayscale images in jpg, png, bmp, and tiff formats, respectively. Image data is compressed with an encoder and decoder program using the RLE algorithm in the matlab application. The RLE method is said to be effective in compressing image data if the compression ratio is less than 100% because it has a lot of color repetition in the pixels. The RLE method is said to be ineffective if the compression ratio is more than 100% because it has a little repetition of colors in the pixels. Of the 28 RGB images tested, it was found that the RLE method was effective on 1 image and not effective on 27 images. For the 28 grayscale images tested, it was found that the RLE method was effective on 6 images and not effective on 22 images

This paper presents a dataset-level evaluation of six lossless compression and data transformation techniques applied to visual-cryptographic (VC) shares derived from QR codes. We processed 40,000 QR samples, comprising 10,000 QR images (Versions 1-4, 2,500 per version), 10,000 QR images (Versions 1-10, 1,000 per version across ten application domains), and 20,000 augmented QR images (with noise, rotation, shear, cropping, and brightness variations). Each QR image is converted to VC share (share1), flattened to a bitstream, and evaluated under traditional compression techniques such as Run Length Encoding (RLE), Huffman Coding, Lempel Ziv-Welch (LZW), and data transformation techniques such as Binary-to-Integer, Base64 Encoding, and (BWT + MTF + Huffman Coding) Burrows Wheeler Transform (BWT), Move-To-Front (MTF), and Huffman Coding as a combined pipeline. Our experiments report Shannon entropy, compressed character count, compressed character count percentage, compression time, decompression time, memory usage, peak memory, lossless fidelity, metadata, payload size, storage size, and compression ratio. Empirical results show near-maximal entropy in QR-derived VC data (∼0.99), providing constraints on compression performance for traditional algorithms. Base64 consistently yields the best compression performance across both clean and augmented datasets, with an average compression rate of 499%. This work contributes a reproducible pipeline, a generalized dataset, and a benchmark reference for compression research on a highly randomized binary dataset.

SummaryThe ability to design smarter, more predictive healthcare solutions for use in the community (at work and at home) and in healthcare facilities has been greatly enhanced by recent developments in the Internet of Health Things (IoHT) and cyber physical systems (CPS). These data collected by such medical sensors will be sent in a large quantity to the fog gateway of IoHT networks. These data should be forwarded to far cloud for further analysis and processing. Therefore, sending all of these data over the IoHT network to the data center will impose a significant burden on the IoHT network. This paper proposed a new lossless electroencephalogram (EEG) compression technique (NeLECoT) for fog computing‐based IoHT networks. It encodes the data of the patient at the fog gateway prior to sending it to the data center, thereby reducing the data's size. In the fog node, the NeLECoT combines three efficient techniques: clustering based on density‐based spatial clustering of applications with noise (DBSCAN), RLE (run length encoding), and Huffman encoding (HE). The clustering based on DBSCAN separates a massive volume of captured data into small groups of closely related (or similar) data. RLE encodes clustered EEG data, and the resulting file is encoded with HE. The fog gateway then transmits the encoded file to the cloud. Numerous simulation experiments were carried out, and the findings demonstrated that the suggested NeLECoT achieved better results than the competing techniques in terms of transmitted data size, compression ratio, compression power, compression time, decompression time, and average compression power.

In recent years, the exponential growth of data has posed significant challenges in managing and processing large-scale datasets, commonly referred to as Big Data.Cloud computing has emerged as a promising platform for storing and analyzing Big Data due to its scalability and cost-effectiveness.However, the storage and transmission of enormous volumes of data in the cloud require efficient compression techniques to reduce storage space, minimize bandwidth consumption, and enhance data processing efficiency.This research paper investigates various data compression techniques specifically tailored for Big Data in cloud computing environments.The study evaluates the effectiveness and efficiency of different compression algorithms, considering factors such as compression ratio, compression time, decompression time, and computational overhead.The findings of this research provide valuable insights into selecting appropriate data compression techniques for optimizing storage and transmission of Big Data in cloud computing architectures. VIII. CONCLUSIONIn this paper, we have presented a comparative study of various data compression techniques for big data in cloud computing.We have shown that hybrid compression techniques, specifically the Burrows-Wheeler transform combined with RLE, provide the best balance between compression ratio, compression speed, and decompression speed while minimizing energy consumption and cost.This technique can be used for efficient data storage and transfer in cloud computing environments.

Dynamic simulations based on time-varying inputs are extremely I/O intensive. This is shown by industrial appli cations generating environmental projections based on seasonal-to-interannual climate forecasts that have a compute to data access ratio of O(n) leading to significant performance degradation. Exploitation of compression techniques such as run length encoding (RLE) signifi cantly reduces the I/O bottleneck and storage require ments. Unfortunately, traditional RLE algorithms do not perform well in a parallel vector platform such as the Cray architecture. This paper describes the design and imple mentation of a new RLE algorithm based on data chunking and packing that exploits the Cray gather-scatter vector hardware and multiple processors. This approach reduces I/O and file storage requirements on average by an order of magnitude. Data intensive applications such as the integration of environmental and global climate models now become practical in a realistic time frame.

The exponential growth in remote sensing, coupled with advancements in integrated circuits (IC) design and fabrication technology for communication, has prompted the progress of Wireless Sensor Networks (WSN). WSN comprises of sensor nodes and hubs fit for detecting, processing, and communicating remotely. Sensor nodes have limited resources such as memory, energy and computation capabilities restricting their ability to process large volume of data that is generated. Compressing the data before transmission will help alleviate the problem. Many data compression methods have been proposed but mainly for image processing and a vast majority of them are not pertinent on sensor nodes because of memory impediment, energy utilization and handling speed. To overcome this issue, authors in this research have chosen Run Length Encoding (RLE) and Adaptive Huffman Encoding (AHE) data compression techniques as they can be executed on sensor nodes. Both RLE and AHE are capable of balancing compression ratio and energy utilization. In this paper, a hybrid method comprising RLE and AHE, named as H-RLEAHE, is proposed and further investigated for sensor nodes. In order to verify the efficacy of the data compression algorithms, simulations were run, and the results compared with the compression techniques employing RLE, AHE, H-RLEAHE, and without the use of any compression approach for five distinct scenarios. The results demonstrate the RLE’s efficiency, as it surpasses alternative data compression methods in terms of energy efficiency, network speed, packet delivery rate, and residual energy throughout all iterations.

A real-time data processing algorithm based on run-length encoding (RLE) for an intelligent racing vehicle is introduced in this paper. In order to improve the achievement of the intelligent racing vehicle's running in the second loop by recoding route information, a new method based on RLE is provided by setting an optimal calculus threshold. Simulated by Matlab/Simulink, the route memorization algorithm shows the obvious advantage in the data compression, which makes the compression ratio up to 22.3. In the meantime, the calculus threshold can be constructed in a certain range, which qualifies the algorithm with a good robustness. Compared with the optimal results achieved by Matlab's genetic algorithm and direct search toolbox, the RLE algorithm can satisfy the requirements very well. When the embedded system has to face the flood for the data increasing geometrically, this high-quality real-time algorithm has been demonstrated with great practical potential.

With the advancement of wireless technology, Wireless Body Sensor Networks, such as Electrocardiograms (ECGs) will serve as state-of-the-art method for electronic-healthcare systems and applications. Like other digital communications, however, ECGs highlight power consumption as the main design constraint and bottleneck as it affects device lifespan and data accuracy. Hence, power reduction and power management techniques and schemes have been developed to eliminate this constraint such as hardware optimization, source and channel coding, signal conditioning, and resolution control. This paper proposes a lossless ECG encoder that combines existing data compression techniques specifically the adaptive fuzzy predictor based on fuzzy decision making and an enhanced entropy encoding that utilizes algorithms in both run length encoding (RLE) and incremental prefix encoding. Simulation results that the proposed scheme outperforms the entropy encoding using Huffman, RLE, and predictive encoding schemes in compression ratio (CR), with the enhanced entropy encoding leading the pre-existing compression techniques by 24.0907 on RLE and 23.6580 on Huffman.

In the recent days, the importance of image compression techniques is exponentially increased due to the generation of massive amount of data which needs to be stored or transmitted. Numerous approaches have been presented for effective image compression by the principle of representing images in its compact form through the avoidance of unnecessary pixels. Vector quantization (VA) is an effective method in image compression and the construction of quantization table is an important process is an important task. The compression performance and the quality of reconstructed data are based on the quantization table, which is actually a matrix of 64 integers. The quantization table selection is a complex combinatorial problem which can be resolved by the evolutionary algorithms (EA). Presently, EA became famous to resolve the real world problems in a reasonable amount of time. This chapter introduces Firefly (FF) with Teaching and learning based optimization (TLBO) algorithm termed as FF-TLBO algorithm for the selection of quantization table. As the FF algorithm faces a problem when brighter FFs are insignificant, the TLBO algorithm is integrated to it to resolve the problem. This algorithm determines the best fit value for every bock as local best and best fitness value for the entire image is considered as global best. When these values are found by FF algorithm, compression process takes place by efficient image compression algorithm like Run Length Encoding and Huffman coding. The proposed FF-TLBO algorithm is evaluated by comparing its results with existing FF algorithm using a same set of benchmark images in terms of Mean Square Error (MSE), Peak Signal to Noise Ratio (PSNR), Structural Similarity index (SSIM), Compression Ratio (CR) and Compression Time (CT). The obtained results ensure the superior performance of FF-TLBO algorithm over FF algorithm and make it highly useful for real time applications.

Compression is the specialty of presenting the data in a conservative structure as opposed to its unique or uncompressed structure. Moreover, utilizing information compression, the size of a specific document can be decreased. This is extremely helpful when preparing, putting away, or moving a gigantic document, which needs huge resources. The speed of transmission relies on the number of pieces sent, the time needed for the encoder to create the coded message, and the time needed for the decoder to recoup the primary ensemble. In an information storage application, the level of compression is the essential concern. Compression can be named either lossless or lossy. Lossless compression methods remake the primary data from the compacted record with no loss of information. In this manner, the data does not alter during the decompression and compression measures. These sorts of compression calculations are called reversible compressions since the primary message is recreated by the decompression cycle. This paper analyzes the exhibition of the Huffman Encoding Algorithm, Lempel Zev Welch Algorithm, Arithmetic Encoding Algorithm, Adaptive Huffman Encoding Algorithm, Shannon Fano Algorithm, and Run Length Encoding Algorithm. Specifically, the efficiency of these calculations in compacting text information is compressed and assessed.

Image compression plays a crucial role in optimising storage and transmission efficiency. This paper evaluates the performance of Run-Length Encoding (RLE), Huffman Coding, and Lempel-Ziv-Welch (LZW) algorithms for compressing grayscale PNG and JPG images. The study analyses their effectiveness using compression ratio, bits per pixel, and compression time as key performance metrics. Results indicate that LZW achieved the highest compression ratio, ranging from 1.0113 to 2.4020, making it the most efficient for file size reduction. RLE performed moderately, with compression ratios between 0.5456 and 2.3895, while Huffman Coding exhibited the lowest ratios, ranging from 0.2646 to 1.0680. In terms of bits per pixel, LZW recorded the lowest values, highlighting its ability to reduce data while preserving image quality. Compression time analysis revealed that RLE was the fastest, with processing times between 0.0019 and 0.0468 seconds, making it suitable for real-time applications. LZW and Huffman Coding demonstrated a trade-off between compression efficiency and speed. These findings establish LZW as the most effective algorithm for high compression with minimal quality loss, while RLE remains the best option for speed-critical applications.