On the Design of Original Codebooks with Two Algorithms Better Than the Splitting Algorithm
两个优于分裂法的初始码书设计算法

Codebooks are crucial to vector quantizations (VQs), which determine their performance. LBG algorithm is often used to generate codebooks, where choice of original codebooks is a key technique, and the splitting algorithm is generally considered effective. In this paper, the greedy tree growing algorithm is introduced to design original codebooks, and two better algorithms are derived. Compared to the classical splitting algorithm, the total run time with the proposed algerithm is reduced, and the codebook performance is improved.