Title :
A fast searching technique for multistage residual vector quantizers
Author :
Kossentini, Faouzi ; Smith, Mark J T
Author_Institution :
Sch. of Electr. & Comput. Eng., Georgia Inst. of Technol., Atlanta, GA, USA
fDate :
7/1/1994 12:00:00 AM
Abstract :
The encoding procedure for multistage residual vector quantizers consists of searching a tree to find the codeword that best matches the input. Many techniques have been proposed for searching such trees, ranging from the slow and faithful to the fast and inaccurate. The present authors introduce a simple method, which they call dynamic M-search, that is both fast and effective for searching the residual vector quantization tree. The new method is applied to image coding, performance results are presented, and advantages are shown over conventional M-search.<>
Keywords :
image coding; search problems; tree data structures; vector quantisation; dynamic M-search; encoding procedure; fast searching technique; image coding; multistage residual vector quantizers; performance results; residual vector quantization tree; Annealing; Bit rate; Design methodology; Encoding; Image coding; Impedance matching; Rate-distortion; Search methods; Tree data structures; Vector quantization;
Journal_Title :
Signal Processing Letters, IEEE
