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.

Adaptive RLE-Huffman Lossless and Diagnostically Lossless Compression for Pharynx and Esophagus Fluoroscopic Images

Abstract: Diagnostic imaging devices such as fluoroscopy produce a vast number of sequential images, ranging from localization images to functional tracking of the contrast agent moving through anatomical structures such as the pharynx and esophagus. In this paper, an effective method for lossless and diagnostically lossless compression of fluoroscopic images is proposed. The two main contributions are: (1) compression through blockbased subtraction matrix division and adaptive Run Length Encoding (RLE), and (2) range conversion to improve the compression performance. The region of coding (RC) – in this case the pharynx and esophagus, is effectively cropped and compressed using customized correlation and the combination of Run-Length Encoding (RLE) and Huffman Coding (HC), to increase compression efficiency. The experimental results show that the proposed method is able to improve the achieved compression ratio by 488% as compared to that of the benchmark traditional methods.

Method and apparatus for fast and efficient image compression and decompression

Abstract: The invention relates to a method and apparatus for fast and efficient image compression and decompression comprising transform coding of image data to generate an image representation using transform coefficients, bit-plane serialization of the image representation using transform coefficients, and for each bitplane optimal prefix encoding of bits in a bitplane sharing local context, run- length encoding of 0 bit sequences in the bitplane and storing the coefficients received after optimal prefix encoding and 0 run length encoding starting with the sign followed by the bits in the order of significance, starting with the most significant bit to the least significant bit in a seektable in a header section.

Picture data compressing method

Abstract: PURPOSE:To control the data amount after compression by transforming the matrix of a two-dimensional DCT coefficients to a one-dimensional sequence and setting the coefficients of high frequency components after an arbitrary k-th term to zero CONSTITUTION:For the obtained two-dimensional DCT coefficients, quantization is executed by dividing values obtained by multiplying a scale factor to the respective threshold values of a quantizing matrix composed of the 8X8 threshold values Next, for the DC component, difference from the quantized component in the preceding block is calculated and the bit number of the difference is Huffman encoded As to the AC component, zigzag scan is executed and the AC component is transformed to a one-dimensional sequence ap Afterwards, a prescribed value (k) is set to this sequence ap and a processing is executed so that the respective values of a sequence aq equipped with the relation of 'k<=q<=63' can be zero Then, the number of continuous zero is compressed by run length encoding, and two-dimensional Huffman encoding is executed using the number data of continuous zeros and the bit number of the significant coefficients

Image encoder and method, and image decoder and method

Abstract: PROBLEM TO BE SOLVED: To provide an image encoder for reducing the capacity of a line memory and efficiently applying encoding compression to a high resolution image even when the high resolution image includes character information. SOLUTION: The line memory 41 and an exclusive OR circuit 42 sequentially detect a difference between color codes at corresponding pixel positions in a horizontal line and a just preceding horizontal line adjacent to the horizontal line as to each of the horizontal lines in a block every time the block is updated with respect to an image equally divided in M (M: an optional integer of 1 or over) in the horizontal direction. Further, when a code generation / output circuit 44 performs run length encoding after a run end detection circuit 43 detects a run from the difference corresponding to the horizontal lines from the circuit 42, the circuit 44 applies the run length encoding to a code word with respect to the first run, the code word including difference information for the run, and the circuit 44 respectively applies the run length encoding to other code words corresponding to the runs other than the first run, the other code words including transition type information denoting a type of transition to the difference for the concerned run from the difference for its just preceding run in place of the difference information for the concerned run. COPYRIGHT: (C)2004,JPO&NCIPI