LBG algorithm is a classical algorithm for vector quantization.
LBG算法是矢量量化码书设计的经典算法。
The local minimum problem is a much important factor which restricts the performance of the classic LBG algorithm.
经典LBG算法的局部极小值问题是制约其性能的重要因素。
At last, some improved methods aimed at the defects of the sensitivity to the initial codebook of LBG algorithm are presented in the paper.
最后，针对LBG算法对初始码书敏感这一缺陷给出了一些改进方向。
Tests show that the proposed two algorithms based on the tabu search approach can greatly improve the codebook performance compared to the conventional LBG algorithm.
结果表明，基于禁止搜索的两种码书设计方案所生成的码书性能都比LBG算法有明显提高。
In the process of codebook design, traditional LBG algorithm owns the advantage of fast convergence, but it is easy to get the local optimal result and be influenced by initial codebook.
在矢量量化的码本设计过程中，经典的LBG算法收敛速度快，但极易陷入局部最优，且初始码本的生成对最佳码本的设计影响很大。
To alleviate the blindness of Linde-Buzo-Gray algorithm(LBG algorithm) while generating initial codebook, a new code word splitting method based on covariance of training vector is proposed.
针对LBG算法中初始码书生成存在盲目性的问题，提出了一种基于训练向量集合分量之间的相关性进行码向量分割的方法。
To alleviate the blindness of Linde-Buzo-Gray algorithm(LBG algorithm) while generating initial codebook, a new code word splitting method based on covariance of training vector is proposed.
针对LBG算法中初始码书生成存在盲目性的问题，提出了一种基于训练向量集合分量之间的相关性进行码向量分割的方法。
应用推荐