Showing papers on "Run-length encoding published in 2005"

RL-huffman encoding for test compression and power reduction in scan applications

Abstract: This article mixes two encoding techniques to reduce test data volume, test pattern delivery time, and power dissipation in scan test applications. This is achieved by using run-length encoding followed by Huffman encoding. This combination is especially effective when the percentage of don't cares in a test set is high, which is a common case in today's large systems-on-chips (SoCs). Our analysis and experimental results confirm that achieving up to an 89% compression ratio and a 93% scan-in power reduction is possible for scan-testable circuits such as ISCAS89 benchmarks.

Compressing bitmap indices by data reorganization

Abstract: Many scientific applications generate massive volumes of data through observations or computer simulations, bringing up the need for effective indexing methods for efficient storage and retrieval of scientific data. Unlike conventional databases, scientific data is mostly read-only and its volume can reach to the order of petabytes, making a compact index structure vital. Bitmap indexing has been successfully applied to scientific databases by exploiting the fact that scientific data are enumerated or numerical. Bitmap indices can be compressed with valiants of run length encoding for a compact index structure. However even this may not be enough for the enormous data generated in some applications such as high energy physics. In this paper, we study how to reorganize bitmap tables for improved compression rates. Our algorithms are used just as a preprocessing step, thus there is no need to reuse the current indexing techniques and the query processing algorithms. We introduce the tuple reordering problem, which aims to reorganize database tuples for optimal compression rates. We propose Gray code ordering algorithm for this NP-Complete problem, which is an in-place algorithm, and runs in linear time in the order of the size of the database. We also discuss how the tuple reordering problem can be reduced to the traveling salesperson problem. Our experimental results on real data sets show that the compression ratio can be improved by a factor of 2 to 10.

Fast Algorithms for Binary Dilation and Erosion Using Run-Length Encoding

Abstract: Fast binary dilation and erosion algorithms using run-length encoding (RLE) are proposed. RLE is an alternative way of representing a binary image using a run, which is a sequence of '1' pixels. First, we derive the run-based representation of dilation and erosion and then present the full steps of the proposed algorithms in detail.

Digital video compression command priority

Abstract: A video compression system for compressing a stream of digital video data is disclosed. Known run-length encoding is applied whenever possible to the digital video data stream. When a run is not identified, the encoder determines whether a consecutive series of pixels are identified from only two different colors, and if so creates a make-series command to create bytes with bits encoded as a stream of binary values corresponding to the two pixel colors as they occur in the consecutive series. The make series command continues for as many bytes as the consecutive series of bits will fill, except that, when a make series command applies again to a byte of make-series bits, the make series command is preempted by the applicable run length encoding.

Succinct suffix arrays based on run-length encoding

Abstract: A succinet full-text self-index is a data structure built on a text T = t1t2...tn, which takes little space (ideally close to that of the compressed text), permits efficient search for the occurren...

Using run length encoding to detect target images

Abstract: An image detection manager uses run length encoding to detect a target image in a candidate image. The image detection manager extracts run length encoding data from the candidate image. The image detection manager distinguishes between a foreground and background of the candidate image and target image, and takes into account an interval of scale factors for matching color runs in the foreground and length runs in the background. The image detection manager treats background pixels as wildcards, and utilizes fuzzy color matching in which color levels of adjacent pixels in the foreground are allowed a specified variation. Using such functionality, the image detection manager compares rows of the run length encoding data from the candidate image to rows of run length encoding data from the target image, and determines whether the target image is present in the candidate image.

Method, apparatus, and program for image processing

Abstract: PROBLEM TO BE SOLVED: To enable rotational transform of a run-length-encoded image with a less working area, low processing load and an arbitrary rotational angle. SOLUTION: Lines SY, EY of a destination where both ends of black run appearing in an original image are shifted by rotational transform are obtained. Also, the straight line of a destination is obtained where the line along the black run of the original image are shifted. Pixels through which this straight line passes in one line of a target image are obtained for each line of SY-EY. A series of pixels obtained for each line are subjected to run length encoding as black runs 32-36 of the target image, and are stored in buffers for every line. When processing for all the black runs of the original image is completed, the buffers are read sequentially from the top, thereby outputting the target image data which are subjected to run-length encoding. COPYRIGHT: (C)2005,JPO&NCIPI

Image compression and decompression using adaptive run length encoding

Abstract: A compressor can compress an image by reducing the amount of data while preserving the information. Some compressors use run length coding wherein image data is converted into a series of run length code words. The efficiency of run length coding can be increased with the introduction of differential run length code words. The differential run length code words can augment the original set of run length codes. Differential run length codes vary from current run length codes by encoding runs of differences.

Image encoding device and method and storage medium with program recorded thereon

Abstract: PROBLEM TO BE SOLVED: To solve the problem that since a(the number of image pixels)/64} bit JPEG position information 302 is required, and another value is inserted into a block, which is determined to be a JPEG block, to execute run length encoding in a printing system, thus it is necessary to finally add non-use data in order to execute encoding/decoding processing. SOLUTION: This hybrid compression system is configured to insert the other data into a block whose JPEG compression is not executed among JPEG planes for executing encoding, and to insert a JUMP command, that is, a jump command of block unit into a run length plane. Thus, it is possible to reduce the amounts of data necessary for decoding. COPYRIGHT: (C)2005,JPO&NCIPI