DocumentCode :
1112229
Title :
Fast full search equivalent encoding algorithms for image compression using vector quantization
Author :
Huang, C.-M. ; Bi, Q. ; Stiles, G.S. ; Harris, R.W.
Author_Institution :
Dept. of Electr. Eng., Utah State Univ., Logan, UT, USA
Volume :
1
Issue :
3
fYear :
1992
fDate :
7/1/1992 12:00:00 AM
Firstpage :
413
Lastpage :
416
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 :
data compression; encoding; picture processing; search problems; equivalent encoding algorithms; fast search routines; geometric considerations; image compression; vector quantization; Bismuth; Books; Data compression; Euclidean distance; Image coding; Image reconstruction; Lattices; Rate-distortion; Vector quantization;
fLanguage :
English
Journal_Title :
Image Processing, IEEE Transactions on
Publisher :
ieee
ISSN :
1057-7149
Type :
jour
DOI :
10.1109/83.148613
Filename :
148613
Link To Document :
بازگشت