Modified Huffman
From Just Solve the File Format Problem
(Difference between revisions)
Dan Tobias (Talk | contribs) |
|||
| (2 intermediate revisions by one user not shown) | |||
| 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. | + | '''Modified Huffman''', sometimes called '''MH''', is a data compression algorithm used in 1-dimensional [[CCITT Group 3]] to compress bi-level images. It uses a combination of [[run-length encoding]], and [[Huffman coding]] with a predefined Huffman code. |
| − | + | For more information, see [[CCITT Group 3]]. | |
| − | + | [[Category:Graphics]] | |
| − | + | ||
| − | + | ||
| − | [[Category: | + | |
Latest revision as of 14:27, 20 January 2021
Modified Huffman, sometimes called MH, is a data compression algorithm used in 1-dimensional CCITT Group 3 to compress bi-level images. It uses a combination of run-length encoding, and Huffman coding with a predefined Huffman code.
For more information, see CCITT Group 3.
