.png){kind=icon}
返回
Vector quantization based on genetic simulated annealing
.png){kind=icon}
PRE
AI
DOI：10.1016/S0165-1684(01)00048-2.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Genetic algorithm (GA) has been successfully applied to codebook design for vector quantization (VQ). However, most conventional GA-based codebook design methods need long runtime because candidate solutions must be fine tuned by LBG. In this paper, a partition-based GA is applied to codebook design, which is referred to as genetic vector quantization (GVQ). In addition, simulated annealing (SA) algorithm is also used in GVQ to get more promising results and the corresponding method is referred to as GSAVQ. Both GVQ and GSAVQ use the linear scaling technique during the calculation of objective functions and use special crossover and mutation operations in order to obtain better codebooks in much shorter CPU time. Experimental results show that both of them save more than 71-87% CPU time compared to LEG. For different codebook sizes, GVQ outperforms LEG by 1.1-2.1 dB in PSNR, and GSAVQ outperforms LBG by 1.2-2.2 dB in PSNR. In addition, GVQ and GSAVQ need a little longer CPU time than, the maximum decent (MD) algorithm, but they outperform MD by 0.2-0.5 dB in PSNR. (C) 2001 Elsevier Science B.V. All rights reserved.
Keyword:
vector quantization
codebook design
genetic algorithm
simulated annealing
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.6
论文数:
10.0K
被引数:
1.7W
机构
暂无机构信息
引用论文
Deterministic annealing for clustering, compression, classification, regression, and related optimization problems.png)
PROCEEDINGS OF THE IEEE
PROCEEDINGS OF THE IEEEIF25.9
PREAI
分享收藏分享收藏 没有更多内容
没有更多内容