Design and performance of tree-structured vector quantizers

This paper considers optimal vector quantizers which minimize the expected distortion subject to a cost such as the number of leaves (storage cost), the leaf entropy (lossless encoding rate), the expected depth (average quantization time), or the maximum depth (maximum quantization time). It analyze...

Full description

Saved in:
Bibliographic Details
Published inData Compression Conference pp. 292 - 301
Main Authors Lin, J., Storer, J.A.
Format Conference Proceeding
LanguageEnglish
Published IEEE Comput. Soc. Press 1993
Subjects
Algorithm design and analysis
Computer science
Cost function
Design methodology
Heuristic algorithms
Image coding
Partitioning algorithms
Shape
Tree data structures
Vector quantization
Online AccessGet full text

Cover

More Information
Summary:This paper considers optimal vector quantizers which minimize the expected distortion subject to a cost such as the number of leaves (storage cost), the leaf entropy (lossless encoding rate), the expected depth (average quantization time), or the maximum depth (maximum quantization time). It analyzes the heuristic of successive partitioning, and develops a class of strategies subsuming most of those used in the past. Experimental results show that these strategies are more efficient than existing methods, and achieve comparable or better compression. The relationship among different cost functions is considered and ways of combining multiple cost constraints are proposed.< >
ISBN:9780818633928
0818633921
DOI:10.1109/DCC.1993.253120