.png){kind=icon}
返回
Complexity-constrained tree-structured vector quantizers
.png){kind=icon}
PRE
AI
DOI：10.1016/S0165-1684(02)00253-0.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
We present a new algorithm for complexity-distortion optimization in tree-structured vector quantizers (TSVQ). The algorithm allows the user to specify the average rate and computational complexity budgets R and C, measured in bits and multiplications per sample, respectively. The output is an optimal-in a sense to be specified-TSVQ satisfying the constraints. The complexity budget is lower-bounded by the complexity of a binary TSVQ and upper-bounded by the complexity of a full-search entropy-constrained vector quantizer. Experimental results for synthetic and natural sources are given. (C) 2002 Elsevier Science B.V. All rights reserved.
Keyword:
tree-structured vector quantizer
complexity
optimization
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.6
论文数:
9.9K
被引数:
1.7W
机构
暂无机构信息
引用论文
Wildfire activity and land use drove 20th‐century changes in forest cover in the Colorado front range.png)
Ecosphere
OAAI
EcosphereIF0
OAAI分享收藏Highly Selective Continuous‐Flow Synthesis of Potentially Bioactive Deuterated Chalcone DerivativesChemPlusChem
ChemPlusChemIF0
PREAI
分享收藏
分享收藏 没有更多内容
没有更多内容