%0 Journal Article
%T On the Design of Original Codebooks with Two Algorithms Better Than the Splitting Algorithm<br>两个优于分裂法的初始码书设计算法
%A LI Bi-cheng
%A WEN Chao
%A PING Xi-jian
%A <br>李弼程
%A 文 超
%A 平西建
%J 中国图象图形学报
%D 2000
%I 
%X 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.
%K Vector quantization
%K Greedy tree growing algorithm
%K Splitting algorithm<br>矢量量化
%K 贪婪树生长算法
%K 码书设计算法
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=D06194629680C940ACE75262F54B9D85&aid=7B38D40136387021&yid=9806D0D4EAA9BED3&vid=94C357A881DFC066&iid=CA4FD0336C81A37A&sid=B6DA1AC076E37400&eid=987EDA49D8A7A635&journal_id=1006-8961&journal_name=中国图象图形学报&referenced_num=0&reference_num=0