Physical Sciences and Mathematics Commons^™

On The Computational Complexity Of The Lbg And Pnn Algorithms, Jamshid Shanbehzadeh, Philip Ogunbona

Faculty of Informatics - Papers (Archive)

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.