|
In recent years, vector quantization (VQ) and transform coding have been treated as the most efficient techniques for image compression. The combinations of vector quantization and transformation techniques, including discrete cosine transform VQ, optimal vector transform VQ, and singular value decomposition VQ, achieve better image quality at the expense of computation complexity. In this thesis, we introduce a hierarchical bitmap search method to reduce their computation loads. All the transformations involved with the bitmaps, even for the multiplicationsk, can be performed by simple binary adders. Especially, the singular value decomposition VQ (SVD- VQ) with the proposed bitmap search method can dramatically reduce the computational complexity. In order to avoid the blind deletion problem in the bitmap search method, we further propose a dynamic bitmap search method to reduce the computation and increase the image quality. The simulations show that the dynamic bitmap search method reduces the computation to about one fifth of the original SVD- VQ required, however, achieves invisible distortion in the reconstructed images.
|