Fast full search equivalent encoding algorithms for image compression using vector quantization
- 1 July 1992
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Image Processing
- Vol. 1 (3) , 413-416
- https://doi.org/10.1109/83.148613
Abstract
Three fast search routines to be used in the encoding phase of vector quantization (VQ) image compression systems are presented. These routines, which are based on geometric considerations, provide the same results as an exhaustive (or full) search. Examples show that the proposed algorithms need only 3-20% of the number of mathematical operations required by a full search and fewer than 50% of the operations required by recently proposed alternatives.Keywords
This publication has 15 references indexed in Scilit:
- A high-speed search algorithm for vector quantizationPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2005
- Fast algorithms for vector quantization picture codingPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2005
- Multiple stage vector quantization for speech codingPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2005
- Binary search trees for vector quantisationPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2005
- A fast MMSE encoding technique for vector quantizationIEEE Transactions on Communications, 1989
- An Efficient Nearest Neighbor Search MethodIEEE Transactions on Communications, 1987
- An improvement of the minimum distortion encoding algorithm for vector quantizationIEEE Transactions on Communications, 1985
- Product code vector quantizers for waveform and voice codingIEEE Transactions on Acoustics, Speech, and Signal Processing, 1984
- Voronoi regions of lattices, second moments of polytopes, and quantizationIEEE Transactions on Information Theory, 1982
- An Algorithm for Vector Quantizer DesignIEEE Transactions on Communications, 1980