Abstract
We study codeword index assignment to allow for progressive image transmission of fixed rate full-search vector quantization (VQ). We develop three new methods of assigning indices to a vector quantization codebook and formulate these assignments as labels of nodes of a full-search progressive transmission tree. The tree is used to design intermediate codewords for the decoder so that full-search VQ has a successive approximation character. The binary representation for the path through the tree represents the progressive transmission code. The methods of designing the tree that we apply are the generalized Lloyd algorithm, minimum cost perfect matching from optimization theory, and a method of principal component partitioning. Our empirical results show that the final method gives intermediate signal-to-noise ratios (SNR’s) that are close to those obtained with tree-structured vector quantization, yet they have higher final SNR’s.
Original language | English |
---|---|
Pages (from-to) | 307-312 |
Number of pages | 6 |
Journal | IEEE Transactions on Image Processing |
Volume | 3 |
Issue number | 3 |
DOIs | |
State | Published - May 1994 |