Modified Huffman coding - Revision history

Halscode: Adding local short description: "Image encoding for fax machines", overriding Wikidata description "used in fax machines to encode black on white images"

2025-03-04T01:52:04Z

Adding local short description: "Image encoding for fax machines", overriding Wikidata description "used in fax machines to encode black on white images"

← Previous revision		Revision as of 01:52, 4 March 2025
Line 1:		Line 1:
			{{Short description\|Image encoding for fax machines}}
	'''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]].		'''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]].

IznoRepeat: add WP:TEMPLATECAT to remove from template; genfixes

2024-12-06T00:53:12Z

add WP:TEMPLATECAT to remove from template; genfixes

← Previous revision		Revision as of 00:53, 6 December 2024
Line 5:		Line 5:
	A hypothetical scan line, with B representing a black pixel and W representing white, might read as follows:		A hypothetical scan line, with B representing a black pixel and W representing white, might read as follows:

	WWWWWWWWWWWWBWWWWWWWWWWWWBBBWWWWWWWWWWWWWWWWWWWWWWWWBWWWWWWWWWWWWWW		WWWWWWWWWWWWBWWWWWWWWWWWWBBBWWWWWWWWWWWWWWWWWWWWWWWWBWWWWWWWWWWWWWW

	With a run-length encoding (RLE) data compression algorithm applied to the above hypothetical scan line, it can be rendered as follows:		With a run-length encoding (RLE) data compression algorithm applied to the above hypothetical scan line, it can be rendered as follows:
Line 22:		Line 22:

	[[Category:Lossless compression algorithms]]		[[Category:Lossless compression algorithms]]
			[[Category:Data compression]]


	{{computer-stub}}		{{computer-stub}}

Aherjhan at 11:43, 29 November 2024

2024-11-29T11:43:23Z

← Previous revision		Revision as of 11:43, 29 November 2024
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]].		'''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:		A hypothetical scan line, with B representing a black pixel and W representing white, might read as follows:
Line 11:		Line 11:
	12W1B12W3B24W1B14W		12W1B12W3B24W1B14W

	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==		==See also==

Citation bot: Misc citation tidying. | You can use this bot yourself. Report bugs here. | Suggested by Abductive | Category:Computing stubs‎ | via #UCB_Category 51/617

2021-02-11T04:22:20Z

Misc citation tidying. | You can use this bot yourself. Report bugs here. | Suggested by Abductive | Category:Computing stubs‎ | via #UCB_Category 51/617

← Previous revision		Revision as of 04:22, 11 February 2021
Line 17:		Line 17:

	==External links==		==External links==
	* {{cite web \|url=http://www.netnam.vn/unescocourse/computervision/104.htm \|~~archiveurl~~=https://web.archive.org/web/20020628195336/http://www.netnam.vn/unescocourse/computervision/104.htm \|~~archivedate~~=2002-06-28 \|title=Modified Huffman coding from UNESCO}}		* {{cite web \|url=http://www.netnam.vn/unescocourse/computervision/104.htm \|archive-url=https://web.archive.org/web/20020628195336/http://www.netnam.vn/unescocourse/computervision/104.htm \|archive-date=2002-06-28 \|title=Modified Huffman coding from UNESCO}}

	{{Compression methods}}		{{Compression methods}}

Mikhail Ryazanov: punct., style

2020-07-26T23:19:06Z

punct., style

← Previous revision		Revision as of 23:19, 26 July 2020
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]].		'''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 white pixels and black pixels which can be represented directly as a 0 and 1. ~~These~~ two [[symbols]] ~~are~~ too small ~~a list of items~~ 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 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]]:

	A hypothetical scan line, with B representing a black pixel and W representing white, might read as follows:		A hypothetical scan line, with B representing a black pixel and W representing white, might read as follows:

	WWWWWWWWWWWWBWWWWWWWWWWWWBBBWWWWWWWWWWWWWWWWWWWWWWWWBWWWWWWWWWWWWWW		WWWWWWWWWWWWBWWWWWWWWWWWWBBBWWWWWWWWWWWWWWWWWWWWWWWWBWWWWWWWWWWWWWW

	With a run-length encoding (RLE) data compression algorithm applied to the above hypothetical scan line, it can be rendered as follows:		With a run-length encoding (RLE) data compression algorithm applied to the above hypothetical scan line, it can be rendered as follows:

	12W1B12W3B24W1B14W		12W1B12W3B24W1B14W

	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, 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.

	==See also==		==See also==
Line 17:		Line 17:

	==External links==		==External links==
	*{{cite web \|url=http://www.netnam.vn/unescocourse/computervision/104.htm \|archiveurl=https://web.archive.org/web/20020628195336/http://www.netnam.vn/unescocourse/computervision/104.htm \|archivedate=2002-06-28 \|title=Modified Huffman coding from UNESCO}}		* {{cite web \|url=http://www.netnam.vn/unescocourse/computervision/104.htm \|archiveurl=https://web.archive.org/web/20020628195336/http://www.netnam.vn/unescocourse/computervision/104.htm \|archivedate=2002-06-28 \|title=Modified Huffman coding from UNESCO}}

	{{Compression methods}}		{{Compression methods}}

	[[Category:Lossless compression algorithms]]		[[Category:Lossless compression algorithms]]


	{{computer-stub}}		{{computer-stub}}

Jellysandwich0 at 12:40, 5 May 2020

2020-05-05T12:40:17Z

← Previous revision		Revision as of 12:40, 5 May 2020
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]].		'''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 ~~a lot of~~ 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 a 0 and 1. These two [[symbols]] are too small a list of items 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 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 white pixels and black pixels which can be represented directly as a 0 and 1. These two [[symbols]] are too small a list of items 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]]:

	A hypothetical scan line, with B representing a black pixel and W representing white, might read as follows:		A hypothetical scan line, with B representing a black pixel and W representing white, might read as follows:

2001:B07:A70:A49D:2239:56FF:FE45:3EBB at 06:54, 22 November 2019

2019-11-22T06:54:14Z

← Previous revision		Revision as of 06:54, 22 November 2019
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]].		'''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 a lot of 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 a 0 and 1. These two [[symbols]] are too small a list of items to directly apply the [[Huffman coding]]. But if we first use run-length encoding we ~~have~~ can 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 that have a lot of 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 a 0 and 1. These two [[symbols]] are too small a list of items 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]]:

	A hypothetical scan line, with B representing a black pixel and W representing white, might read as follows:		A hypothetical scan line, with B representing a black pixel and W representing white, might read as follows:
Line 11:		Line 11:
	12W1B12W3B24W1B14W		12W1B12W3B24W1B14W

	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, 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.

	==See also==		==See also==

R'n'B: Disambiguate link to Huffman

2019-05-01T10:18:34Z

Disambiguate link to Huffman

← Previous revision		Revision as of 10:18, 1 May 2019
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]].		'''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 a lot of 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 a 0 and 1. These two [[symbols]] are too small a list of items to directly apply the [[Huffman]] coding. But if we first use run-length encoding we have can 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 that have a lot of 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 a 0 and 1. These two [[symbols]] are too small a list of items to directly apply the [[Huffman coding]]. But if we first use run-length encoding we have can 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:		A hypothetical scan line, with B representing a black pixel and W representing white, might read as follows:

96.64.16.213: Clarified that theere is only black and white. However each 'scan line' contains several of those symbols. Also linked a couple of related subjects

2019-04-29T19:51:40Z

Clarified that theere is only black and white. However each 'scan line' contains several of those symbols. Also linked a couple of related subjects

← Previous revision		Revision as of 19:51, 29 April 2019
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]].		'''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 a lot of 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 a black pixels which can be represented directly as a 0 and 1. ~~This~~ is too small a list of items to directly apply the Huffman coding. But if we first use run-length encoding we have can 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 that have a lot of 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 a 0 and 1. These two [[symbols]] are too small a list of items to directly apply the [[Huffman]] coding. But if we first use run-length encoding we have can 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:		A hypothetical scan line, with B representing a black pixel and W representing white, might read as follows:

96.64.16.213 at 19:49, 29 April 2019

2019-04-29T19:49:54Z

← Previous revision		Revision as of 19:49, 29 April 2019
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]].		'''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 a lot of repeating data, like a file containing text where the alphabet letters are the repeating objects. However a single scan line contains only two ~~elements~~ a white and a black ~~pixel~~ which can be represented directly as a 0 and 1. This is too small a list of items to directly apply the Huffman coding. But if we first use run-length encoding we have can 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 that have a lot of 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 a black pixels which can be represented directly as a 0 and 1. This is too small a list of items to directly apply the Huffman coding. But if we first use run-length encoding we have can 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:		A hypothetical scan line, with B representing a black pixel and W representing white, might read as follows: