Topic
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.
Papers published on a yearly basis
Papers
More filters
TL;DR: A multi-agent system dedicated to the compression of digital images using a labeling table which contains all the values of the pixels of the image and inspired from the RLE (Run Length Encoding) method.
Abstract: describe, in this paper, a multi-agent system (MAS) dedicated to the compression of digital images. An Image may be considered as a matrix of N lines and of M columns, that is to say a size of NxM pixels. To each line, we associate an agent. Our approach is inspired from the RLE (Run Length Encoding) method but instead of storing the occurrences of the pixels having a same value followed by the value of these pixels, we use a labeling table which contains all the values of the pixels of the image. We obtain a compressed image as a list of color labels followed by the number of successive occurrences of this color. We observe, that, an image is made up of about thirty different colors approximately, this mean that the label of color can be coded on five bits. This method is very effective for images where the color is coded on several bytes. The algorithm is as follow: each agent traverses the image line with which it is associated by seeking for each detected color the number of its successive occurrences. The agent thus draws up a set of lists for each color found including the number of its occurrences. All the other agents carry out these tasks in parallel. It is possible to obtain images compressed without or with loss of information according to the desired quality of the compressed image. This approach allows a very great improvement of the performances in storage capacity of information (the compressed images thus obtained occupy less memory space) and in execution time (the parallel execution allows very high accelerations of the algorithms).
3 citations
Patent•
30 May 2002
TL;DR: In this paper, a method for compressing and storing information by the genetic code is provided to compress, record and display information in a continuous pair type like the configuration of the genetic codes, using 4 fundamental elements composed of 2 bits.
Abstract: PURPOSE: A method for compressing and storing information by the genetic code is provided to compress, record and display information in a continuous pair type like the configuration of the genetic code, using 4 fundamental elements composed of 2 bits. CONSTITUTION: Source data are inputted(S10). The source data are compressed by sequentially using an RLE(Run Length Encoding) compression algorithm, an LZ(Lempel Ziv) compression algorithm, and a Huffman compression algorithm(S20). The compressed information is converted into the genetic code, to generate temporary or intermediate data(S30). Each surface of a Rubik's Cubic pyramid is repetitively rotated for sorting the compressed genetic code(S40). The sorted and compressed genetic code is compressed again by using the RLE compression algorithm, to generate a final compressed file(S50). Whether to compress the genetic code is decided(S60). If so, the initial step(S10) is returned, and if not, the steps are ended.
3 citations
18 Nov 2004
TL;DR: It is shown that at the same compression rate a lower loss of information can be obtained by using fully 3D wavelets as compared to iterated 2D methods.
Abstract: This paper deals with the implementation of 3D wavelets techniques for compression of medical images, specifically in the MRI modality. We show that at the same compression rate a lower loss of information can be obtained by using fully 3D wavelets as compared to iterated 2D methods. An adaptive thresholding step is performed in each sub-band and a simple Run Length Encoding (RLE) method for compression is finally used. A reconstruction algorithm is then implemented and a comparison study of the reconstructed image is then proposed, showing the high performance of the proposed algorithm.
3 citations
Journal Article•
TL;DR: This paper improved an algorithm based on scan line theory, which includes 2 critical steps to reduce the loss of position accuracy in the process of rasterization, and common operations of run-length encoding system.
Abstract: Run-length encoding system(RLE) is a common technique of raster data compressing and expressing,it is used on occasion for area features rasterizing in GIS.Focused on the rasterizing method of area objects with RLE data structure,this paper improved an algorithm based on scan line theory,which includes 2 critical steps.Firstly,figure out all points of intersection between scanning line and area boundary curve,save these breakpoints in form of ordered linked list;Secondly,according to the parity of breakpoint sequence number in scanning line,to build up ordered run-length list.In order to reduce the loss of position accuracy in the process of rasterization,a method about run-length boundary recorded by real-value is introduced.In additional,this paper presented common operations of run-length encoding system,advantages and applications in GIS area operation are also illuminated by some examples.
3 citations
01 Jan 2010
TL;DR: Modified Set Partitioning in Hierarchical Tree with Run Length Encoding is a new framework for fingerprint image compression that uses Peak Signal to noise ratio and Mean Square Error to compute the picture quality of fingerprint images.
Abstract: Modified Set Partitioning in Hierarchical Tree with Run Length Encoding is a new framework proposed for fingerprint image compression. The Proposed method is better because more number of images related to the fingerprint image are retrieved. Experiments on an image database of grayscale bitmap images show that the proposed technique performs well in compression and decompression. We use Peak Signal to noise ratio [3] and Mean Square Error [3] to compute the picture quality of fingerprint images.
3 citations