scispace - formally typeset
Search or ask a question
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
More filters
Proceedings ArticleDOI
12 Nov 2007
TL;DR: The application of the algorithm to a wide range of standard images shows that the scheme, while having low computational complexity, is competitive with other near-lossless image compression methods.
Abstract: In this paper an algorithm is proposed which performs near-lossless image compression. For each pixel in a row of the image a group of value-states are considered, which have values close to that of the pixel. A trellis is constructed for every row of the image where the nodes of the trellis are the states of the pixels of that row. The goal of the algorithm is to find a path on this trellis that creates a sequence which can be efficiently coded using run length encoding (RLE). For sections of the pixels of the row that suitable RLE cannot be achieved then minimization of the entropy is employed to complete a path on the trellis. The application of the algorithm to a wide range of standard images shows that the scheme, while having low computational complexity, is competitive with other near-lossless image compression methods.

9 citations

Patent
05 Nov 1998
TL;DR: In this paper, the authors propose a method for encoding a digital video image stream, which includes spatial compression of still images in the video stream and temporal compression between the still images.
Abstract: Method and encoder for encoding a digital video image stream. The encoding includes spatial compression of still images in the video stream and temporal compression between the still images. The spatial compression is carried out by converting a time domain image of a macroblock to a frequency domain image of the macroblock, taking the discrete cosine transform of the frequency domain image, transforming the discrete cosine transformed macroblock image by a quantization factor, and run length encoding the quantized discrete cosine transformed macroblock image. The temporal compression is carried out by reconstructing the run length encoded, quantized, discrete cosine transformed image of the macroblock, searching for a best match macroblock, and constructing a motion vector between them. This forms a bitstream of run length encoded, quantized, discrete cosine transform macroblocks and of motion vectors. This bitstream is passed to and through an external buffer to a transmission medium. The number encoded bits read by a host from the external buffer is fed back to the encoder for calculation in real time of a dynamic buffer level indicator indicative of the fullness of the external buffer. The encoder may generate a BUFFER — EMPTY flag, BUFFER — ALMOST — FULL flag and/or BUFFER — FULL flag for the host.

9 citations

Proceedings ArticleDOI
03 Apr 2014
TL;DR: A DPCM based approach for real-time compression of ECG data for real time telemonitoring application and the computational simplicity of the algorithm provides an opportunity to implement the coder using a low cost microcontroller.
Abstract: This paper illustrates a DPCM based approach for real-time compression of ECG data for real time telemonitoring application. For real time implementation a ‘frame’ is considered with one original sample followed by 64 first difference elements. The coder compresses the non-QRS regions of an ECG data stream through stages of first difference, joint sign and magnitude coding, and run length encoding. A hard thresholding at the equipotential regions have been applied to enhance the RLE efficiency. For testing 10 second ECG data from Physionet has been used with 10-bit quantization level. The CR, PRD and PRDN achieved with PTB Database (ptbdb) are 6.42, 9.77 and 9.77 respectively. With MIT-BIH arrhythmia data (mitdb), these values are 5.92, 8.19 and 8.19 respectively. With MIT-BIH ECG Compression test data (cdb), these values are 4.25, 5.37 and 6.65 respectively. The frame wise compression rises to a value of 12–14 in flat (TP) segments and low 1–2 in QRS regions. The computational simplicity of the algorithm provides an opportunity to implement the coder using a low cost microcontroller.

9 citations

Proceedings ArticleDOI
10 May 2009
TL;DR: This article proposes an efficient bitmask-based compression technique to drastically reduce the control word size while keeping the decompression overhead minimal and demonstrates that this approach improves compression efficiency by an average of 20% over the best known control word compression.
Abstract: Implementing a custom hardware is not always feasible due to cost and time considerations. No instruction set computer (NISC) architecture is one of the promising direction to design a custom datapath for each application using its execution characteristics. A major challenge with NISC control word is that they tend to be at least 4 to 5 times larger than regular instruction size, thereby imposing higher memory requirement. A promising approach is to compress these control words to reduce the code size of the application. This article proposes an efficient bitmask-based compression technique to drastically reduce the control word size while keeping the decompression overhead minimal. The main contributions of our approach are: i) efficient don't care resolution for maximum bitmask coverage using limited dictionary entries, ii) run length encoding to significantly reduce repetitive control words, and iii) smart encoding of constant and less frequently changing bits. Our experimental results demonstrate that our approach improves compression efficiency by an average of 20% over the best known control word compression, giving a compression ratio of 25% to 35%.

9 citations

Patent
Amitabh Saran1
29 Dec 1976
TL;DR: In this paper, a block length multiple plus run length residue code format was proposed for binary video signals with a raster scan format with some scan lines of difference modulated picture elements.
Abstract: Black terminated white runs of a binary video signal having a raster scan format with some scan lines of difference modulated picture elements and other scan lines of unmodulated picture elements are run length encoded using a block length multiple plus run length residue code format, whereby runs in excess of a predetermined block length are represented by block length multiple codes plus, for any runs which are not integer multiples of the block length, run length residue codes. Shorter black terminated white runs are converted into run length residue codes, and unterminated white runs are converted into end-of-line codes which distinguish between scan lines of difference modulated and unmodulated picture elements.

9 citations

Network Information
Related Topics (5)
Network packet
159.7K papers, 2.2M citations
76% related
Feature extraction
111.8K papers, 2.1M citations
75% related
Convolutional neural network
74.7K papers, 2M citations
74% related
Image processing
229.9K papers, 3.5M citations
74% related
Cluster analysis
146.5K papers, 2.9M citations
74% related
Performance
Metrics
No. of papers in the topic in previous years
YearPapers
202123
202020
201920
201828
201727
201624