A fast Linde-Buzo-Gray algorithm in image vector quantization

This paper presents a novel algorithm for speeding up the codebook design in image vector quantization that exploits the correlation among the pixels in an image block to compress the computational complexity of calculating the squared Euclidean distortion measures, and uses the similarity between t...

Full description

Saved in:
Bibliographic Details
Published inIEEE transactions on circuits and systems. 2, Analog and digital signal processing Vol. 45; no. 3; pp. 432 - 435
Main Authors LIN, Y.-C, TAI, S.-C
Format Journal Article
LanguageEnglish
Published New York, NY IEEE 01.03.1998
Institute of Electrical and Electronics Engineers
Subjects
Online AccessGet full text

Cover

Loading…
More Information
Summary:This paper presents a novel algorithm for speeding up the codebook design in image vector quantization that exploits the correlation among the pixels in an image block to compress the computational complexity of calculating the squared Euclidean distortion measures, and uses the similarity between the codevectors in the consecutive code-books during the iterative clustering-process to reduce the number of codevectors necessary to be checked for one codebook search. Verified test results have shown that the proposed algorithm can provide almost 98% reduction of the execution time when compared to the conventional Linde-Buzo-Gray (LBG) algorithm.
Bibliography:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:1057-7130
1558-125X
DOI:10.1109/82.664257