.png){kind=icon}
返回
Constrained-storage multistage vector quantization based on genetic algorithms
.png){kind=icon}
PRE
AI
DOI：10.1016/j.patcog.2007.05.011.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Multistage vector quantization (MSVQ) and their variants have been recently proposed. Before MSVQ is designed, the user must artificially determine the number of codewords in each VQ stage. However, the users usually have no idea regarding the number of codewords in each VQ stage, and thus doubt whether the resulting MSVQ is optimal. This paper proposes the genetic design (GD) algorithm to design the MSVQ. The GD algorithm can automatically find the number of codewords to optimize each VQ stage according to the rate-distortion performance. Thus, the MSVQ based on the GD algorithm, namely MSVQ(GD), is proposed here. Furthermore, using a sharing codebook (SC) can further reduce the storage size of MSVQ. Combining numerous similar codewords in the VQ stages of MSVQ produces the codewords of the sharing codebook. This paper proposes the genetic merge (GM) algorithm to design the SC of MSVQ. Therefore, the constrained-storage MSVQ using a SC, namely CSMSVQ, is proposed and outperforms other MSVQs in the experiments presented here. (c) 2007 Pattern Recognition Society. Published by Elsevier Ltd. All rights reserved.
Keyword:
multistage vector quantizer
genetic algorithm
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7.6
论文数:
1.4W
被引数:
4.5W
机构
暂无机构信息
引用论文
.png){kind=icon}
分享收藏Development of top-level requirements for regional aircraft based on the needs of the Russian market
OAAI
OAAI分享收藏
查看更多内容