.png){kind=icon}
返回
Fast tree-structured nearest neighbor encoding for vector quantization
.png){kind=icon}
PRE
AI
DOI：10.1109/83.480778.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This work examines the nearest neighbor encoding problem with an unstructured codebook of arbitrary size and vector dimension, We propose a new tree-structured nearest neighbor encoding method that significantly reduces the complexity of the full-search method without any performance degradation in terms of distortion, Our method consists of efficient algorithms for constructing a binary tree for the codebook and nearest neighbor encoding by using this tree, Numerical experiments are given to demonstrate the performance of the proposed method.
Keyword:
ALGORITHM
SEARCH
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
13.7
论文数:
1.0W
被引数:
8.4W
机构
暂无机构信息
引用论文
分享收藏Origin of the ω-Strengthening and Embrittlement in β-Titanium Alloys: Insight from First Principles
PREAI
分享收藏
分享收藏Molecular relationships between Pseudomonas INC P-9 degradative plasmids TOL, NAH, and SAL.png)
Plasmid
PlasmidIF0
PREAI
分享收藏分享收藏
查看更多内容