On the computational complexity of the LBG and PNN algorithms

Authors

Jamshid Shanbehzadeh, Tarbiat Moalem University, Islamic Republic of Ira
Philip Ogunbona, University of WollongongFollow

RIS ID

65859

Publication Details

Shanbehzadeh, J. & Ogunbona, P. (1997). On the computational complexity of the LBG and PNN algorithms. IEEE Transactions on Image Processing, 6 (4), 614-616.

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.