adaptive[1]

adaptive[1] - # 16 ECE 253a Digital Image Processing Pamela...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon
# 16 ECE 253a Digital Image Processing Pamela Cosman 11/11/11 Adaptive Huffman Coding Each node of the tree is assigned a weight . For a leaf node, the weight is the number of times that the symbol corresponding to that leaf has been encountered. For an internal node of the tree, the weight is the sum of the weights of the offspring (children nodes). Each node of the tree is also assigned a number . If we have an alphabet of size n , there will be 2 n - 1 nodes total ( n leaf nodes and n - 1 internal nodes) once the tree reaches its full size (meaning that every symbol in the input alphabet has been encountered at least once). We will number them from 1 to 2 n - 1 . Sibling nodes will get adjacent numbers. Nodes with higher weight get higher numbers. Parents have higher numbers than their children. Encoding: At the start, the tree at both the encoder and the decoder consists of a single node which corresponds to all symbols N ot Y et T ransmitted (NYT). Before encoding begins, encoder and decoder agree on a fixed-length codeword for every symbol in the input alphabet. These codewords will be used for the first time a given symbol appears. The very first symbol is encoding using its fixed-length codeword.
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 2
This is the end of the preview. Sign up to access the rest of the document.

This document was uploaded on 01/20/2012.

Page1 / 5

adaptive[1] - # 16 ECE 253a Digital Image Processing Pamela...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online