IEEE Transactions on Information Theory · 1989 · 198 citations · 39 references
ComputingComputer ScienceData StructuresInformation TheoryTheory Of ComputationData CompressionDigital Signal ProcessingDimensionality ReductionSource CodingQuantizationQuantization TheoryScalar QuantizationVector Quantization
The authors consider how much performance advantage a fixed-dimensional vector quantizer can gain over a scalar quantizer. They collect several results from high-resolution or asymptotic (in rate) quantization theory and use them to identify source and system characteristics that contribute to the vector quantizer advantage. One well-known advantage is due to improvement in the space-filling properties of polytopes as the dimension increases. Others depend on the source's memory and marginal density shape. The advantages are used to gain insight into product, transform, lattice, predictive, pyramid, and universal quantizers. Although numerical prediction consistently overestimated gains in low rate (1 bit/sample) experiments, the theoretical insights may be useful even at these rates.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">></ETX>
39
Least squares quantization in PCM
Sheelagh Lloyd · IEEE Transactions on Information Theory · 1982 · 15.6K citations · Full text
An Algorithm for Vector Quantizer Design
Y. Linde, A. Buzo, Robert M. Gray · IEEE Transactions on Communications · 1980 · 7.2K citations
Spectral Analysis and Time Series
David B. Preston · Technometrics · 1983 · 4.9K citations
Robert M. Gray · Elsevier eBooks · 1984 · 2.4K citations · Full text
Introduction to matrix analysis
Henri Amar · Journal of the Franklin Institute · 1960 · 2.3K citations