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
Patent
03 Jun 2005
TL;DR: In this paper, a video compression system for compressing a stream of digital video data is disclosed, where 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 corresponding to the two pixel colors as they occur in the consecutive series.
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.

15 citations

Patent
20 Dec 2012
TL;DR: Aligned Run-Length Encoding (ARLE) as mentioned in this paper is an encoding scheme that transforms sets of same-valued consecutive rows into one or more runs, while enforcing boundaries between the runs at set intervals.
Abstract: Techniques for Aligned Run-Length Encoding (ARLE) are described. ARLE is an encoding scheme that transforms sets of same-valued consecutive rows into one or more runs, while enforcing boundaries between the runs at set intervals (e.g. every predetermined number of rows). Consecutive rows that contain the same value, but which cross one or more interval boundaries, are encoded as multiple runs that are divided along those interval boundaries. According to one technique, a database server accelerates query processing by setting the interval size to the word size of the processor performing the predicate comparisons. According to another technique, a database server accelerates row lookup by maintaining an offset array that stores the run offsets into the ARLE data of the run that begins each interval.

15 citations

Journal ArticleDOI
TL;DR: The 3sum-hardness is proved for both the wildcard matching problem and the k-mismatch problem with run-length compressed inputs, which implies that it is very unlikely to devise an o(mn)-time algorithm for either of them.

15 citations

Proceedings ArticleDOI
16 Apr 2018
TL;DR: This work proposes a novel approach for run-length encoding based on newly introduced conflict detection (CD) instructions in Intel's AVX-512 instruction set extension, which has unique properties and outperforms the state-of-the-art RLE approach for data sets with small run lengths.
Abstract: Data as well as hardware characteristics are two key aspects for efficient data management This holds in particular for the field of in-memory data processing Aside from increasing main memory capacities, efficient in-memory processing benefits from novel processing concepts based on lightweight compressed data Thus, an active research field deals with the adaptation of new hardware features such as vectorization using SIMD instructions to speedup lightweight data compression algorithms Following this trend, we propose a novel approach for run-length encoding, a well-known and often applied lightweight compression technique Our novel approach is based on newly introduced conflict detection (CD) instructions in Intel's AVX-512 instruction set extension As we are going to show, our CD-based approach has unique properties and outperforms the state-of-the-art RLE approach for data sets with small run lengths

15 citations

Patent
04 May 1995
TL;DR: In this article, the dictionary ordering of keys after expansion, compression, and concatenation of their key parts is described, where each key part has been expanded through padding, each substring of identical characters of length greater than or equal to three is compressed through run-length encoding algorithm.
Abstract: The present invention provides a system and method for the dictionary ordering of keys after expansion, compression and concatenation of their key parts. After each key part has been expanded through padding, each substring of identical characters of length greater than or equal to three is compressed through run-length encoding algorithm. The substring is replaced by the sequence character, a compression identifying character and a number identifying the number of characters being replaced. After compression and the subsequent concatenation, the keys are compared character by character. At the first instance of a miscomparison, the comparison scheme performs a normal dictionary ordering if neither of the characters are part of a compression sequence. If a character at the point of miscomparison is part of a compression sequence then an ordering decision is made based on the compression character, the length of the compressed substring and the character following the compressed substring.

15 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