arrow
返回

Hierarchy-oriented searching algorithms using alternative duplicate codewords for vector quantization mechanism

delete2005-03-01
delete4
PRE
AI
S
Shiuh-Jeng Wang *
C
Cheng-Hsing Yang
DOI:10.1016/j.amc.2003.12.134delete
delete原文链接
delete原文求助
delete分享
delete收藏
摘要

摘要

En 中文
In this paper, we will show those algorithms that speed Up the search of a closest codeword over a given codebook, The mechanism is based on a multilevel concept constructed as a hierarchical organization. For a given codebook with size N (existing N codewords), there are only [log(k) N] levels that need to be constructed in order to find the closest codeword, where k is a parameter selection to optimize the comparisons in the course of the searching, Theoretically, the comparisons required to find the closest codeword are on average k[log(k) N], which is substantially faster than that of a full search job. Besides, in order to approach the perfect match with the exact one among the codewords, a duplicate mechanism is also applied to Our algorithm so that tile lowest possible distortion is achieved. As is observed from the results of the experiments, the estimation of comparisons in our execution, Without codeword duplicate, is on average about k[log(k) N]/N times the full search method. It is worth noting that tile larger the size of the codebook, the more the speed increases. In particular, there are two classifications, non-duplicate and duplicate method which are associated with tile codewords distribution in tile dominated set, which were experimented on some tables. The duplicate is manipulated by the training set containing six popular image data, to demonstrate the efficiency of our scheme. Also, the time requirement to find the closest codeword is effectively reduced, especially in the case of a large sized codebook. Therefore, our scheme offers a novel exploration and achieves a faster performance ill the closest codeword searching for vector quantization of image data. (C) 2004 Elsevier Inc. All rights reserved.
Keyword:
codeword
duplicate
VQ search
hierarchy

期刊

Applied Mathematics and Computation 封面图
Applied Mathematics and Computation
IF:
3.4
论文数:
2.3W
被引数:
3.3W

机构

暂无机构信息
引用论文

引用论文

A performance model for an asynchronous optical buffer
err2005-10-01
err0
errOAAI
errW. Rogiest; K. Laevens; D. Fiems; H. Bruneel
err分享
err收藏
Potential Antitumor Agents IX: Synthesis and Antitumor Activity of Two Analogues of Ketocaine
err1983-07-01
err0
PREAI
errAldo Andreanix; Giancarlo Scapini; Iraklis Galatulas; Rosaria Bossa
err分享
err收藏
Towards a Lightweight Security Solution for User-Friendly Management of Distributed Sensor Networks
err2009-01-01
err0
PREAI
errPentti Tarvainen; Mikko Ala-Louko; Marko Jaakola; Ilkka Uusitalo; Spyros Lalis; Tomasz Paczesny; Markus Taumberger; Pekka Savolainen
err分享
err收藏
学者 查看更多内容