Vector set-partitioning with successive refinement Voronoi lattice VQ for embedded wavelet image coding

Abstract

While lattice vector quantization (LVQ) can solve the complexity problem of LBG based vector quantizers, and also yield very general codebooks, a single stage lattice VQ, when applied to high variance vectors result in very large and unwieldy indices, making it unsuitable for applications requiring successive refinement. The goal of this work is to develop a unified framework for progressive uniform quantization of vectors, without having to sacrifice the mean-squared-error advantage of lattice quantization. A successive refinement uniform vector quantization paradigm is developed, where the codebooks in successive stages are all lattice codebooks, each in the shape of the Voronoi region of the lattice at the previous stage. The Voronoi shaped lattice codebook at each stage is called Voronoi lattice VQ (VLVQ). Measures of efficiency of successive refinement are developed. The developed methodology is applied to successively refine vectors of wavelet coefficients in the vector set-partitioning (VSPIHT) framework to obtain an embedded bitstream. The results are compared against the previous successive approximation wavelet vector quantization (SA-W-VQ) results of Sampson, da Silva, and Ghanbari (see IEEE Trans. Image Processing, vol.5, no.2, p.299-310, 1996) for image coding.