| 两个优于分裂法的初始码书设计算法 |
| |
| 引用本文： | 李弼程,文 超,平西建. 两个优于分裂法的初始码书设计算法[J]. 中国图象图形学报, 2000, 5(1): 48-51 |
| |
| 作者姓名： | 李弼程 文 超 平西建 |
| |
| 作者单位： | 解放军信息工程学院信息科学系!郑州450002 |
| |
| 基金项目： | 郑州信息工程学院科研基金项目资助!（YP9832063） |
| |
| 摘 要： | 在矢量量化中，码书起决定性的作用，它决定了量化的性能；一般采用ＬＢＧ算法生成码书，其中一个关键的技术就是初始码书的选取，通常认为分裂法效果显著。该文引入贪婪树生长算法来设计初始码书，得到了两个优于分裂法的初始码书设计算法，减少了整个码书训练的运算时间，提高了码书的性能。
|
| 关 键 词： | 矢量量化 贪婪树生长算法 码书设计算法 |
| 收稿时间： | 1999-01-19 |
| 修稿时间： | 1999-01-19 |
On the Design of Original Codebooks with Two Algorithms Better Than the Splitting Algorithm |
| |
| LI Bi-cheng,WEN Chao and PING Xi-jian. On the Design of Original Codebooks with Two Algorithms Better Than the Splitting Algorithm[J]. Journal of Image and Graphics, 2000, 5(1): 48-51 |
| |
| Authors: | LI Bi-cheng WEN Chao PING Xi-jian |
| |
| Affiliation: | Department of Information Science,Information and Engineering Institute,Zhengzhou 450002;Department of Information Science,Information and Engineering Institute,Zhengzhou 450002;Department of Information Science,Information and Engineering Institute,Zhengzhou 450002 |
| |
| Abstract: | 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. |
| |
| Keywords: | Vector quantization Greedy tree growing algorithm Splitting algorithm |
| 本文献已被 CNKI 维普 等数据库收录！ |
| 点击此处可从《中国图象图形学报》浏览原始摘要信息 |
|
点击此处可从《中国图象图形学报》下载免费的PDF全文 |
