Modified Huffman
From Just Solve the File Format Problem
(Difference between revisions)
(→Specifications) |
Dan Tobias (Talk | contribs) |
||
| Line 1: | Line 1: | ||
{{FormatInfo | {{FormatInfo | ||
|formattype=electronic | |formattype=electronic | ||
| − | |subcat= | + | |subcat=Graphics |
}} | }} | ||
'''Modified Huffman''', sometimes called '''MH''', is a data compression algorithm used in 1-dimensional [[CCITT Group 3]] to compress bi-level images. The data is first [[Run-length encoding|run-length encoded]], and then [[Huffman coding]] is applied to the run lengths. | '''Modified Huffman''', sometimes called '''MH''', is a data compression algorithm used in 1-dimensional [[CCITT Group 3]] to compress bi-level images. The data is first [[Run-length encoding|run-length encoded]], and then [[Huffman coding]] is applied to the run lengths. | ||
| Line 9: | Line 9: | ||
== Specifications == | == Specifications == | ||
See [[CCITT Group 3#Specifications|CCITT Group 3]]. | See [[CCITT Group 3#Specifications|CCITT Group 3]]. | ||
| + | |||
| + | [[Category:Compression]] | ||
Revision as of 16:31, 27 February 2013
Modified Huffman, sometimes called MH, is a data compression algorithm used in 1-dimensional CCITT Group 3 to compress bi-level images. The data is first run-length encoded, and then Huffman coding is applied to the run lengths.
It's not clear whether "Modified Huffman" can also refer to the general concept of RLE combined with Huffman coding.
Specifications
See CCITT Group 3.
