Run-length encoding
Form of lossless data compression
- 6 min read
- 4 chapters
Related on Lably
Through Patent, Icon (computing) and Online service provider
Run-length encoding is most efficient on data that contains many such runs, for example, simple graphic images such as icons, line drawings, games, and animations. For files that do not have many runs, encoding them with RLE could increase the file size.
RLE may also refer to particular image formats that use the encoding. RLE is an early graphics file format supported by CompuServe for compressing black and white images, that was widely supplanted by their later Graphics Interchange Format (GIF). It is also the name of a little-used image format in Windows 3.x that is saved with the file extension rle, consisting of a run-length encoded bitmap; it was used as the format for the Windows 3.x startup screen.
History and applications
Run-length encoding (RLE) schemes were employed in the transmission of analog television signals as far back as 1967. In 1983, run-length encoding was patented by Hitachi. RLE is particularly well suited to palette-based bitmap images (which use relatively few colors) such as computer icons, and was a popular image compression method on early online services such as CompuServe before the advent of more sophisticated formats such as GIF. It does not work well on continuous-tone images (which use very many colors) such as photographs, although JPEG uses it on the coefficients that remain after transforming and quantizing image blocks.
Common formats for run-length encoded data include Truevision TGA, PackBits (by Apple, used in MacPaint), PCX and ILBM. The International Telecommunication Union also describes a standard to encode run-length color for fax machines, known as T.45. That fax color coding standard, which along with other techniques is incorporated into Modified Huffman coding, is relatively efficient because most faxed documents are primarily white space, with occasional interruptions of black.
Sign in to keep reading
3 more chapters are free with a Lably account.
Algorithm
RLE has a space complexity of , where n is the size of the input data.
Encoding algorithm
Run-length encoding compresses data by reducing the physical size of a repeating string of characters. This process involves converting the input data into a compressed format by identifying and counting consecutive occurrences of each character. The steps are as follows:
- Traverse the input data.
- Count the number of consecutive repeating characters (run length).
- Store the character and its run length.
Python implementation
<span id="mweA"></span><span class="k" id="mweQ">def</span><span class="w" id="mweg"> </span><span class="nf" id="mwew">rle_encode</span><span class="p" id="mwfA">(</span><span class="n" id="mwfQ">iterable</span><span class="p" id="mwfg">,</span> <span class="o" id="mwfw">*</span><span class="p" id="mwgA">,</span> <span class="n" id="mwgQ">length_first</span><span class="o" id="mwgg">=</span><span class="kc" id="mwgw">True</span><span class="p" id="mwhA">):</span> <span class="w" id="mwhQ"> </span><span class="sd" id="mwhg">"""</span> <span class="sd" id="mwhw"> >>> "".join(rle_encode("AAAABBBCCDAA"))</span> <span class="sd" id="mwiA"> '4A3B2C1D2A'</span> <span class="sd" id="mwiQ"> >>> "".join(rle_encode("AAAABBBCCDAA", length_first=False))</span> <span class="sd" id="mwig"> 'A4B3C2D1A2'</span> <span class="sd" id="mwiw"> """</span> <span class="k" id="mwjA">return</span> <span class="p" id="mwjQ">(</span> <span class="sa" id="mwjg">f</span><span class="s2" id="mwjw">"</span><span class="si" id="mwkA">{</span><span class="n" id="mwkQ">ilen</span><span class="p" id="mwkg">(</span><span class="n" id="mwkw">g</span><span class="p" id="mwlA">)</span><span class="si" id="mwlQ">}{</span><span class="n" id="mwlg">k</span><span class="si" id="mwlw">}</span><span class="s2" id="mwmA">"</span> <span class="k" id="mwmQ">if</span> <span class="n" id="mwmg">length_first</span> <span class="k" id="mwmw">else</span> <span class="sa" id="mwnA">f</span><span class="s2" id="mwnQ">"</span><span class="si" id="mwng">{</span><span class="n" id="mwnw">k</span><span class="si" id="mwoA">}{</span><span class="n" id="mwoQ">ilen</span><span class="p" id="mwog">(</span><span class="n" id="mwow">g</span><span class="p" id="mwpA">)</span><span class="si" id="mwpQ">}</span><span class="s2" id="mwpg">"</span> <span class="c1" id="mwpw"># ilen(g): length of iterable g</span> <span class="k" id="mwqA">for</span> <span class="n" id="mwqQ">k</span><span class="p" id="mwqg">,</span> <span class="n" id="mwqw">g</span> <span class="ow" id="mwrA">in</span> <span class="n" id="mwrQ">groupby</span><span class="p" id="mwrg">(</span><span class="n" id="mwrw">iterable</span><span class="p" id="mwsA">)</span> <span class="p" id="mwsQ">)</span>Decoding algorithm
The decoding process involves reconstructing the original data from the encoded format by repeating characters according to their counts. The steps are as follows:
- Traverse the encoded data.
- For each count-character pair, repeat the character count times.
- Append these characters to the result string.
Python implementation
<span id="mwzw"></span><span class="k" id="mw0A">def</span><span class="w" id="mw0Q"> </span><span class="nf" id="mw0g">rle_decode</span><span class="p" id="mw0w">(</span><span class="n" id="mw1A">iterable</span><span class="p" id="mw1Q">,</span> <span class="o" id="mw1g">*</span><span class="p" id="mw1w">,</span> <span class="n" id="mw2A">length_first</span><span class="o" id="mw2Q">=</span><span class="kc" id="mw2g">True</span><span class="p" id="mw2w">):</span> <span class="w" id="mw3A"> </span><span class="sd" id="mw3Q">"""</span> <span class="sd" id="mw3g"> >>> "".join(rle_decode("4A3B2C1D2A"))</span> <span class="sd" id="mw3w"> 'AAAABBBCCDAA'</span> <span class="sd" id="mw4A"> >>> "".join(rle_decode("A4B3C2D1A2", length_first=False))</span> <span class="sd" id="mw4Q"> 'AAAABBBCCDAA'</span> <span class="sd" id="mw4g"> """</span> <span class="k" id="mw4w">return</span> <span class="n" id="mw5A">chain</span><span class="o" id="mw5Q">.</span><span class="n" id="mw5g">from_iterable</span><span class="p" id="mw5w">(</span> <span class="n" id="mw6A">repeat</span><span class="p" id="mw6Q">(</span><span class="n" id="mw6g">b</span><span class="p" id="mw6w">,</span> <span class="nb" id="mw7A">int</span><span class="p" id="mw7Q">(</span><span class="n" id="mw7g">a</span><span class="p" id="mw7w">))</span> <span class="k" id="mw8A">if</span> <span class="n" id="mw8Q">length_first</span> <span class="k" id="mw8g">else</span> <span class="n" id="mw8w">repeat</span><span class="p" id="mw9A">(</span><span class="n" id="mw9Q">a</span><span class="p" id="mw9g">,</span> <span class="nb" id="mw9w">int</span><span class="p" id="mw-A">(</span><span class="n" id="mw-Q">b</span><span class="p" id="mw-g">))</span> <span class="k" id="mw-w">for</span> <span class="n" id="mw_A">a</span><span class="p" id="mw_Q">,</span> <span class="n" id="mw_g">b</span> <span class="ow" id="mw_w">in</span> <span class="n" id="mwAQA">batched</span><span class="p" id="mwAQE">(</span><span class="n" id="mwAQI">iterable</span><span class="p" id="mwAQM">,</span> <span class="mi" id="mwAQQ">2</span><span class="p" id="mwAQU">)</span> <span class="p" id="mwAQY">)</span>Example
Consider a screen containing plain black text on a solid white background. There will be many long runs of white pixels in the blank space, and many short runs of black pixels within the text. A hypothetical scan line, with B representing a black pixel and W representing white, might read as follows:
WWWWWWWWWWWWBWWWWWWWWWWWWBBBWWWWWWWWWWWWWWWWWWWWWWWWBWWWWWWWWWWWWWW
With a run-length encoding (RLE) data compression algorithm applied to the above hypothetical scan line, it can be rendered as follows:
12W1B12W3B24W1B14W
This can be interpreted as a sequence of twelve Ws, one B, twelve Ws, three Bs, etc., and represents the original 67 characters in only 18. While the actual format used for the storage of images is generally binary rather than ASCII characters like this, the principle remains the same. Even binary data files can be compressed with this method; file format specifications often dictate repeated bytes in files as padding space. However, newer compression methods such as DEFLATE often use LZ77-based algorithms, a generalization of run-length encoding that can take advantage of runs of strings of characters (such as BWWBWWBWWBWW).
Run-length encoding can be expressed in multiple ways to accommodate data properties as well as additional compression algorithms. For instance, one popular method encodes run lengths for runs of two or more characters only, using an "escape" symbol to identify runs, or using the character itself as the escape, so that any time a character appears twice it denotes a run. On the previous example, this would give the following:
WW12BWW12BB3WW24BWW14
This would be interpreted as a run of twelve Ws, a B, a run of twelve Ws, a run of three Bs, etc. In data where runs are less frequent, this can significantly improve the compression rate.
One other matter is the application of additional compression algorithms. Even with the runs extracted, the frequencies of different characters may be large, allowing for further compression; however, if the run lengths are written in the file in the locations where the runs occurred, the presence of these numbers interrupts the normal flow and makes it harder to compress. To overcome this, some run-length encoders separate the data and escape symbols from the run lengths, so that the two can be handled independently. For the example data, this would result in two outputs, the string "WWBWWBBWWBWW" and the numbers (12,12,3,24,14).
Variants
- Sequential RLE: This method processes data one line at a time, scanning from left to right. It is commonly employed in image compression. Other variations of this technique include scanning the data vertically, diagonally, or in blocks.
- Lossy RLE: In this variation, some bits are intentionally discarded during compression (often by setting one or two significant bits of each pixel to 0). This leads to higher compression rates while minimally impacting the visual quality of the image.
- Adaptive RLE: Uses different encoding schemes depending on the length of runs to optimize compression ratios. For example, short runs might use a different encoding format than long runs.