LBG 和 PNN 算法的计算复杂性。

On the computational complexity of the LBG and PNN algorithms.

机构信息

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

出版信息

IEEE Trans Image Process. 1997;6(4):614-6. 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.

摘要

这封通信通过推导出它们的计算时间的解析表达式来比较成对最近邻（PNN）和 Linde-Buzo-Gray（LBG）算法的计算复杂度。结果表明，对于实际的码字大小和训练向量序列，LBG 算法确实比 PNN 算法具有更高的计算效率。