.png){kind=icon}
返回
IMPROVED TECHNIQUES FOR SINGLE-PASS ADAPTIVE VECTOR QUANTIZATION
.png){kind=icon}
PRE
AI
DOI：10.1109/5.286197.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Constantinescu and Storer [4], [5] present a new single-pass adaptive vector quantization algorithm that learns a codebook of variable size and shape entries; they present experiments on a set of test images showing that with no training or prior knowledge of the data, for a given fidelity, the compression achieved typically equals or exceeds that of the JPEG standard. This paper presents improvements in speed (by employing K-D trees), simplicity of codebook entries, and visual quality with no loss in either the amount of compression or the SNR as compared to the original full-search version.
Keyword:
TREES
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
25.9
论文数:
9.9K
被引数:
4.5W
机构
暂无机构信息
引用论文
.png){kind=icon}
没有更多内容
没有更多内容