Skip to main content
Article
On the computational complexity of the LBG and PNN algorithms
Faculty of Informatics - Papers (Archive)
  • Jamshid Shanbehzadeh, Tarbiat Moalem University, Islamic Republic of Ira
  • Philip Ogunbona, University of Wollongong
RIS ID
65859
Publication Date
1-1-1997
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.
Citation Information
Jamshid Shanbehzadeh and Philip Ogunbona. "On the computational complexity of the LBG and PNN algorithms" (1997) p. 614 - 616
Available at: http://works.bepress.com/p_ogunbona/61/