Run-length encoding

About: Run-length encoding is a research topic. Over the lifetime, 504 publications have been published within this topic receiving 4441 citations. The topic is also known as: RLE.

Apply Run-length encoding on pixel differences to do image hiding

Abstract: In 2011, Chen used Run Length Coding to record the repetition times of continuous data with the same value. These recorded data were then embedded in cover images by Module-based Substitution. In order to increase the quantity of repetition times of the data with the same value, in this paper, the pixel values are changed into difference values by using Median Edge Predictor (MED). The range of all possible difference values is subsequently divided into two regions. The difference values in the regions are reassigned new positive values, put through Run Length Coding, and embedded into cover images by Modulebased Substitution. According to the experimental results, the quality of the embedded image in the proposed method is better than that in Chen's method.

Compressing Storage for Spectrum Occupancy Data Based on Ameliorated Run-length Encoding

Abstract: To find a solution to compress and store massive electromagnetic spectrum ocuppacy data,the paper ameliorates run-length encoding algorithm.It establishes a mapping between ocuppacy data and bits array based on binary characteristic of the data,and encodes the bits array by Ameliorated run-length encoding algorithm.The practice shows that the compressing efficiency is remarkable and the result is lossless.

VLSI Design of an Efficient Image Encryption-Then-Compression System

Abstract: In many practical scenarios, secure and efficient data transfer plays a vital role and it is the main aspect of the communication system. The classical way of transmitting redundant data over a bandwidth constrained insecure channel is to first compress it and then encrypt. This project investigates the novelty of reversing the order of compression and encryption, without compromising either the information secrecy or the encryption efficiency. This has led to the problem of how to design a pair of image encryption and compression algorithms such that compressing the encrypted images can still be efficiently performed. This image encryption-then-compression (ETC) system proposes an encryption scheme operated in the prediction error clustering and run length encoding, shown to be able to provide a reasonably high level of security. Lossless/lossy image coders can be exploited to efficiently compress the encrypted images, and both techniques have their own advantages. In this paper data compression uses Run Length Encoding (RLE) technique because this method has the ability to generate an exact output with low power consumption and reduced time delay. This entire system is implemented by writing Verilog description and is simulated using Xilinx ISE software simulation tools.

Role of Run Length Encoding on Increasing Huffman Effect in Text Compression

Abstract: Most digital data are not stored in the most compact form. Rather, they are stored in whatever way makes them easiest to use, such as: ASCII text from word processors, binary code that can be executed on a computer, individual samples from a data acquisition system, etc. Typically, these easy-to-use encoding methods require data files about twice as large as actually needed to represent the information. Data compression is the general term for the various algorithms and programs developed to address this problem. A compression program is used to convert data from an easy-to-use format to one optimized for compactness. Likewise, an decompression program returns the information to its original form. This research aims to appear the effect of a simple lossless compression method , RLE or Run Length Encoding , on another lossless compression algorithm which is the Huffman algorithm that generates an optimal prefix codes generated from a set of probabilities. While RLE simply replaces repeated bytes with a short description of which byte to repeat it. 1.

A Study on Compression and Decompression of Bit Map Data by NibbleRLE Code

Abstract: In this paper, a nibble RLE(Run Length Encoding) code for real time compression and decompression of Hanguel bit map font and printer data is proposed. The nibble RLE code shows good compression ratio in complete form Hangeul Myoungjo and Godik style bit map font and printer output bit map data. And two ASICs seperating compression and decompression are designed and simulated on CAD to verify the proposed code. The 0.8 micron CMOS Sea of Gate is used to implement the ASICs in amount of 2, 400 gates, and these are running at 25MHz. Therefore, the proposed code could be implemented with simple hardware and performs 100M bit/sec compression and decomression at maximum, it is good for real time applications.