On the computational complexity of the LBG and PNN algorithms

J Shanbehzadeh; P O Ogunbona

doi:10.1109/83.563327

On the computational complexity of the LBG and PNN algorithms

IEEE Trans Image Process. 1997;6(4):614-6. doi: 10.1109/83.563327.

Authors

J Shanbehzadeh¹, P O Ogunbona

Affiliation

¹ Dept. of Electr. and Comput. Eng., Wollongong Univ., NSW.

PMID: 18282955
DOI: 10.1109/83.563327

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.