A novel algorithm is described for constructing a progressive, multiresolution compression code. 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. In order to generate a multiresolution output in a progressive manner, the codeword dimension at each level's TSVQ is greater than or equal to those of the previous levels. Pruning is performed on the nested TSVQs to achieve the bit allocation across the levels. The resulting pruned TSVQ provides a multiresolution output with low computational complexity at the decoder while simultaneously providing superior performance to ordinary pruned TSVQ at low bit rates.<>


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    A low complexity multiresolution approach to image compression using pruned nested tree-structured vector quantization


    Contributors:


    Publication date :

    1994-01-01


    Size :

    468082 byte




    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English



    A Low Complexity Multiresolution Approach to Image Compression using Pruned Nested Tree-Structured Vector Quantization

    Perlmutter, S. M. / Gray, R. M. / IEEE; Signal Processing Society | British Library Conference Proceedings | 1994



    Efficient Image Coding Using Multiresolution Wavelet Transform and Vector Quantization

    Pemmaraju, S. / Mitra, S. / IEEE; Signal Processing Society | British Library Conference Proceedings | 1996


    Image compression using transformed vector quantization

    Li, R. Y. / Kim, J. / Al-Shamakhi, N. | British Library Online Contents | 2002


    Fast encoding algorithms for tree-structured vector quantization

    Lai, J. Z. C. | British Library Online Contents | 1997