Dynamically Constructing Mixed Pyramid for Fast VQ Encoding

This paper presents a new VQ encoding method using a dynamically constructed mixed pyramid for fast image compression. Our method enhances the speed of VQ encoding by allowing the "nearest" codeword of an input block to be identified without computing the Euclidean distances between the input block and all codewords. Our method is based on, and enhanced from, two recently proposed methods based on mixed pyramid data structure and dynamically constructed subvectors, respectively. Experimental results demonstrated that our method is more efficient than the previous two methods.