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.

A proposed technique for improving run length encoding

Abstract: Image compression, is used to reduce the quantity of pixels used in image representation without excessively change image visualization. Reducing image size enhance images sharing, transmitting and storing. Data compression has become more important than ever, due to the increasing demand for internet use and exchange of a huge amount of images, videos, audio and documents as well as growing demand for electronic archiving by government departments that produce thousands of documents per day. In this paper, a proposed technique for improving run length encoding results will be presented. The proposed technique is a lossless and completed technique, it is consisting of two parts the compression part and decompression part. The compression part contains some basic stages such as: pre-processing, run length encoding, replace maximum values by unused values, minimize levels, delta encoding, while the decompression part is the revers of compression part. This technique is applied on twenty documents and compared with RLE. The experimental results showed that the proposed technique gives a higher compression ratio than the RLE

Intra correlation destruction technique for encryption data

Abstract: The need for efficient technique for data encryption is clear. Our attention will be devoted to design hybrid technique which, consists of simple and efficient methods such as RLE, vector substitution, and matrix operations. The adopted technique consists of three stages. Each stage contains a specific tool that is suitable for varied type of data such as text, image, and video .In first stage, different methods could be applied depending on the source data format: applying Run Length Encoding (RLE) and Addition Neighboring Element (ANE) to the image, audio and video, while pattern matching is applied to text file format . Stage two involves matrix manipulation and rotation. Element substitution is implemented to the matrix in third stage; a key substitution matrix is used for the process of substituting elements of the matrix. The key matrix will be sent to the destination receiver in order to enable him or her to reconstruct the original data. Finally it must be mentioned that a good result have been obtained using arbitrary plain text and standard image (Leena), where some investigations proved that it is so hard to break the encrypted data.

Efficient Run-length Encoding Of Binary Sources With Unknown Statistics

Abstract: This paper describes an efficient run-length encoding of binary sources with unknown statistics. Binary entropy coders are used in many multimedia codec standards, which uses adaptive Golomb-Rice coders. Using a maximum-likelihood approach, an excess rate for the Golomb-like coder when compared to an adaptive Rice coder is up to 4.2% for binary sources with unknown statistics with respect to the source entropy.

Run-length encoding with further compression of "run" and "data" parts of encoded data

Abstract: An encoder (10) takes input data (D1) and generates corresponding encoded output data (D2) as a run-length encoded (RLE) representation of the input data (D1). The encoder also splits the RLE representation into a plurality of parts (A, B), wherein at least one part is associated with original symbols and at least another part is associated with counts of occurrence of those symbols. The encoder then further compresses the parts (A, B) separately to generate the encoded output data (D2), using e.g. Huffman, Golomb, arithmetic coding etc. A corresponding decoder (50) generates corresponding decoded output data (D3). Optionally, the original symbols include at least one of: characters, alphabetic elements, numbers, bits, bytes, words.