JOURNAL ARTICLE
A better tree-structured vector quantizer
Abstract
A new vector quantizer permits logarithmic-time encoding and yet performs better than the locally optimal quantizers generated by the LBG algorithm. The success is credited to an elaborated tree-structured optimization process in the codebook design.< >
Keywords:
Codebook Tree (set theory) Encoding (memory) Linde–Buzo–Gray algorithm Logarithm Computer science Vector quantization Process (computing) Artificial intelligence Algorithm Theoretical computer science Mathematics Combinatorics Programming language
Metrics
65
Cited By
2.95
FWCI (Field Weighted Citation Impact)
17
Refs
0.92
Citation Normalized Percentile
Is in top 1%
Is in top 10%
Citation History
Topics
Advanced Data Compression Techniques
Physical Sciences → Computer Science → Computer Vision and Pattern Recognition
Algorithms and Data Compression
Physical Sciences → Computer Science → Artificial Intelligence
Error Correcting Code Techniques
Physical Sciences → Computer Science → Computer Networks and Communications
Related Documents
JOURNAL ARTICLE
Entropy-constrained tree-structured vector quantizer design
Kenneth RoseDavid J. MillerA. Gersho
Journal: IEEE Transactions on Image Processing Year: 1996 Vol: 5 (2)Pages: 393-398
JOURNAL ARTICLE
K-tree: a height balanced tree structured vector quantizer
Year: 2002 Vol: 1 Pages: 271-280
JOURNAL ARTICLE
Multi-subspace tree-structured vector quantizer design algorithms
Journal: IEEE International Conference on Acoustics Speech and Signal Processing Year: 1993 Vol: 2 Pages: 257-260 vol.5