arrow
返回

A fast exact GLA based on code vector activity detection

delete2000-01-01
delete50
PRE
AI
T
Timo Kaukoranta *
P
Pasi Fränti
O
Olli Nevalainen
DOI:10.1109/83.855429delete
delete原文链接
delete原文求助
delete分享
delete收藏
摘要

摘要

En 中文
This paper introduces a new method for reducing the number of distance calculations in the generalized Lloyd algorithm (GLA), which is a widely used method to construct a codebook in vector quantization, Reduced comparison search detects the activity of the code vectors and utilizes it on the classification of the training vectors. For training vectors whose current code vector has not been modified, we calculate distances only to the active code vectors. Large proportion of the distance calculations can be omitted without sacrificing the optimality of the partition, The new method is included in several fast GLA variants reducing their running times over 50% on average.
Keyword:
clustering algorithms
codebook generation
image compression
vector quantization
AI总结

AI总结

对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。

期刊

IEEE Transactions on Image Processing 封面图
IEEE Transactions on Image Processing
IF:
13.7
论文数:
1.0W
被引数:
8.4W

机构

暂无机构信息
引用论文

引用论文

err分享
err收藏
学者 查看更多内容