29 December 2000 Fractal-based gradient-match and side-match vector quantization for image coding
Author Affiliations +
Abstract
In this paper, we propose the fractal-based gradient match vector quantizers (FGMVQs) and the fractal-based side match vector quantizers (FSMVQs) for the image coding framework. The proposed schemes are based upon the non-iterative fractal block coding (FBC) technique and the concepts of the gradient match vector quantizers (GMVQs) and the side match vector quantizers (SMVQs). Unlike the ordinary GMVQs and SMVQs, the super codebooks in the proposed FGMVQs and FSMVQs are generated from the affine-transformed domain blocks in the non-iterative FBC technique. The codewords in the state codebook are dynamically extracted from the super codebook with the side-match and gradient-match criteria. The redundancy in affine-transformed domain blocks is greatly reduced and the compression ratio can be significantly increased. Our simulation results show that about 10% - 20% bit rates in the non-iterative FBC techniques are saved by using the proposed FGMVQs and FSMVQs.
© (2000) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Hsuan-Ting Chang, Hsuan-Ting Chang, Tuan Yung Han, Tuan Yung Han, "Fractal-based gradient-match and side-match vector quantization for image coding", Proc. SPIE 4310, Visual Communications and Image Processing 2001, (29 December 2000); doi: 10.1117/12.411869; https://doi.org/10.1117/12.411869
PROCEEDINGS
10 PAGES


SHARE
RELATED CONTENT


Back to Top