The Community for Technology Leaders
Proceedings of 1994 28th Asilomar Conference on Signals, Systems and Computers (1994)
Pacific Grove, CA, USA
Oct. 31, 1994 to Nov. 2, 1994
ISSN: 1058-6393
ISBN: 0-8186-6405-3
pp: 476-481
S.M. Perlmutter , Inf. Syst. Lab., Stanford Univ., CA, USA
R.M. Gray , Inf. Syst. Lab., Stanford Univ., CA, USA
ABSTRACT
An algorithm is described for constructing a finite-state compression code that is both progressive and multiresolution. The codec consists of nested levels of tree-structured vector quantizers (TSVQs) where the codebook for each level of the nested TSVQs is constructed from the terminal leaves of the TSVQ from the previous level. The first level of the TSVQ represents a finite-state next state function. The codeword dimension at the subsequent levels is greater than or equal to those of the previous levels. This property allows the codec to produce a multiresolution output in a progressive manner. Pruning is performed on the nested TSVQs to achieve the bit allocation across the levels. The resulting pruned TSVQ decoder operates entirely by successive table lookups, with no arithmetic computation. Furthermore, it provides superior performance to ordinary pruned TSVQ at low bit rates.<>
INDEX TERMS
image coding, vector quantisation, codecs, table lookup
CITATION

S. Perlmutter and R. Gray, "A finite-state multiresolution approach to image compression using pruned nested tree-structured vector quantization," Proceedings of 1994 28th Asilomar Conference on Signals, Systems and Computers(ACSSC), Pacific Grove, CA, USA, 1995, pp. 476-481.
doi:10.1109/ACSSC.1994.471499
91 ms
(Ver 3.3 (11022016))