On the computational complexity of the LBG and PNN algorithmsFaculty of Informatics - Papers (Archive)
AbstractThis 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 InformationJamshid 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/