Modified Huffman
From Just Solve the File Format Problem
(Difference between revisions)
m |
|||
| Line 1: | Line 1: | ||
{{FormatInfo | {{FormatInfo | ||
|formattype=electronic | |formattype=electronic | ||
| − | |subcat= | + | |subcat=Compression |
}} | }} | ||
'''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. | ||
| − | + | For more information, see [[CCITT Group 3]]. | |
| − | + | ||
== Editors' notes == | == Editors' notes == | ||
It's not clear whether "Modified Huffman" can also refer to the general concept of RLE combined with Huffman coding. | It's not clear whether "Modified Huffman" can also refer to the general concept of RLE combined with Huffman coding. | ||
| − | [[Category: | + | [[Category:Graphics]] |
Revision as of 19:02, 11 November 2015
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.
For more information, see CCITT Group 3.
Editors' notes
It's not clear whether "Modified Huffman" can also refer to the general concept of RLE combined with Huffman coding.
