.png){kind=icon}
返回
Two fast nearest neighbor searching algorithms for image vector quantization
.png){kind=icon}
PRE
AI
DOI：10.1109/26.545888.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this paper, two efficient codebook searching algorithms for vector quantization (VQ) are presented, The first fast search algorithm utilizes the compactness property of signal energy on transform domain and the geometrical relations between the input vector and every codevector to eliminate those codevectors that have no chance to be the closest codeword of the input vector, It achieves a full search equivalent performance, As compared with other fast methods of the same kind, this algorithm requires the fewest multiplications and the least total times of distortion measurements, Then, a suboptimal searching method, which sacrifices the reconstructed signal quality to speed up the search of nearest neighbor, is presented, This algorithm performs the search process on predefined small subcodebooks instead of the whole codebook for the closest codevector, Experimental results show that this method not only needs less CPU time to encode an image but also encounter less loss of reconstructed signal quality than tree-structured VQ does.
Keyword:
ENCODING ALGORITHM
CODEBOOK SEARCH
IMPROVEMENT
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
8.3
论文数:
1.2W
被引数:
3.6W
机构
暂无机构信息
引用论文
分享收藏分享收藏Origin of the ω-Strengthening and Embrittlement in β-Titanium Alloys: Insight from First Principles
PREAI
分享收藏A Novel Load Extrapolation Method for Multiple Non-Stationary Loads on the Drill Pipe of a Rotary Rig.png)
Machines
OAAI
MachinesIF0
OAAI分享收藏 没有更多内容
没有更多内容