image-processing
Entropy coding: Huffman and arithmetic coding
taught
Building an optimal prefix-free code from a symbol's own frequency table, and why arithmetic coding can beat Huffman's whole-bit-per-symbol limit.
Taught in
-
Entropy coding: Huffman and arithmetic coding
Digital Image Processing
Requires
- run-length-coding required
Required by
- The discrete cosine transform required
Local knowledge map
Local knowledge map
Click to expand
Solid arrows are required prerequisites; dashed are recommended or helpful. Lower rows are more foundational. Click any box to jump to that concept.