Paper
30 May 2000 Subregion search algorithm for efficient VQ encoding of images
Man-Yee Lee Anson, Jian Feng
Author Affiliations +
Proceedings Volume 4067, Visual Communications and Image Processing 2000; (2000) https://doi.org/10.1117/12.386682
Event: Visual Communications and Image Processing 2000, 2000, Perth, Australia
Abstract
In this paper, we new sub-region search algorithm is proposed for fast encoding of image vector quantization. In the proposed scheme, we will only search a portion of the codebook to locate the best match vector of each input vector according to the state of its neighboring blocks. A block transition criterion is developed for selecting the subset of codebook for searching. Simulation results show that the encoding time required by the proposed algorithm is just about 10 - 20% of that required by the full search with almost the same output image quality.
© (2000) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Man-Yee Lee Anson and Jian Feng "Subregion search algorithm for efficient VQ encoding of images", Proc. SPIE 4067, Visual Communications and Image Processing 2000, (30 May 2000); https://doi.org/10.1117/12.386682
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Computer programming

Quantization

Bridges

Computer simulations

Image compression

Algorithm development

Image quality

RELATED CONTENT

Entropy-constrained predictive residual vector quantization
Proceedings of SPIE (December 08 1995)
Edge-preserving vector quantization using a neural network
Proceedings of SPIE (September 30 1996)
Enhancement of transform coding by nonlinear interpolation
Proceedings of SPIE (November 01 1991)
Interpolative Adaptive Vector Quantization
Proceedings of SPIE (July 18 1988)

Back to Top