Improved PNN algorithm for initial codebook design of LBG
Libin Wu
Abstract
Libin Wu
Abstract
In vector quantization(VQ),the initial codebook design is very important for VQ codebook.This paper introduces two improved PNN algorithms for the design of the initial codebook of LBG algorithm in order to promote the performance and quality of final codebook.The improved algorithm uses sorting training vectors and to the sum of each training vector components and merging multiple training vector iteration.The improved PNN algorithm effectively reduces the complexity and convergence time.Experiments show that the algorithm is reasonable and effective.The proposed method can be combined with the LBG algorithm to further improve the quality of codebook.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
In vector quantization(VQ),the initial codebook design is very important for VQ codebook.This paper introduces two improved PNN algorithms for the design of the initial codebook of LBG algorithm in order to promote the performance and quality of final codebook.The improved algorithm uses sorting training vectors and to the sum of each training vector components and merging multiple training vector iteration.The improved PNN algorithm effectively reduces the complexity and convergence time.Experiments show that the algorithm is reasonable and effective.The proposed method can be combined with the LBG algorithm to further improve the quality of codebook.
Key concepts: Codebook, Linde–Buzo–Gray algorithm, Vector quantization, Algorithm, Sorting, Computer science, Convergence (economics), Economic growth