Title :
On the computational complexity of the LBG and PNN algorithms
Author :
Shanbehzadeh, J. ; Ogunbona, P.O.
Author_Institution :
Dept. of Electr. & Comput. Eng., Wollongong Univ., NSW, Australia
fDate :
4/1/1997 12:00:00 AM
Abstract :
This correspondence compares the computational complexity of the pair-wise nearest neighbor (PNN) and Linde-Buzo-Gray (LBG) algorithms by deriving analytical expressions for their computational times. It is shown that for a practical codebook size and training vector sequence, the LBG algorithm is indeed more computationally efficient than the PNN algorithm
Keywords :
computational complexity; image coding; vector quantisation; LBG algorithm; Linde-Buzo-Gray algorithm; PNN algorithm; codebook size; computational complexity; computational time; image compression; pair-wise nearest neighbor algorithm; training vector sequence; vector quantisation; Algorithm design and analysis; Clustering algorithms; Computational complexity; Distortion measurement; Iterative algorithms; Iterative decoding; Mean square error methods; Merging; Nearest neighbor searches;
Journal_Title :
Image Processing, IEEE Transactions on
