Modified Huffman coding: Difference between revisions

Content deleted Content added

Inline

Revision as of 11:43, 29 November 2024

Modified Huffman coding is used in fax machines to encode black-on-white images (bitmaps). It combines the variable-length codes of Huffman coding with the coding of repetitive data in run-length encoding.

The basic Huffman coding provides a way to compress files with much repeating data, like a file containing text, where the alphabet letters are the repeating objects. However, a single scan line contains only two kinds of elements – white pixels and black pixels – which can be represented directly as 0 and 1. This "alphabet" of only two symbols is too small to apply the Huffman coding directly. But if we first use run-length encoding, we can have more objects to encode. Here is an example taken from the article on run-length encoding:

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

Here we see that we have several different numbers in addition to the two items "white" and "black." These numbers provide plenty of additional items to use, so the Huffman coding can be directly applied to the sequence above to reduce the size even more.

External links

"Modified Huffman coding from UNESCO". Archived from the original on 2002-06-28.

This computing article is a stub. You can help Wikipedia by expanding it.

@@ Line 1: / Line 1: @@
 '''Modified Huffman coding''' is used in [[fax]] machines to encode black-on-white images ([[bitmap]]s). It combines the variable-length codes of [[Huffman coding]] with the coding of repetitive data in [[run-length encoding]].
-The basic Huffman coding provides a way to compress files that have much repeating data, like a file containing text, where the alphabet letters are the repeating objects. However, a single scan line contains only two kinds of elements{{snd}} white pixels and black pixels{{snd}} which can be represented directly as a 0 and 1. This "alphabet" of only two [[symbols]] is too small to directly apply the [[Huffman coding]]. But if we first use run-length encoding, we can have more objects to encode. Here is an example taken from the article on [[run-length encoding]]:
+The basic Huffman coding provides a way to compress files with much repeating data, like a file containing text, where the alphabet letters are the repeating objects. However, a single scan line contains only two kinds of elements{{snd}} white pixels and black pixels{{snd}} which can be represented directly as 0 and 1. This "alphabet" of only two [[symbols]] is too small to apply the [[Huffman coding]] directly. But if we first use run-length encoding, we can have more objects to encode. Here is an example taken from the article on [[run-length encoding]]:
 A hypothetical scan line, with B representing a black pixel and W representing white, might read as follows:
@@ Line 11: / Line 11: @@
 W1B12W3B24W1B14W
-Here we see that we have, in addition to the two items "white" and "black", several different numbers. These numbers provide plenty of additional items to use, so the Huffman coding can be directly applied to the sequence above to reduce the size even more.
+Here we see that we have several different numbers in addition to the two items "white" and "black." These numbers provide plenty of additional items to use, so the Huffman coding can be directly applied to the sequence above to reduce the size even more.
 ==See also==