%0 Journal Article
%T Fast codeword search algorithm based onadaptive subvector patitions<br>自适应子矢量划分的快速码字搜索算法
%A Wu Xinpeng
%A Pan Zhibin
%A Li Da
%A <br>吴鑫鹏
%A 潘志斌
%A 李达
%J 中国图象图形学报
%D 2012
%I 
%X In the encoding process of vector quantization (VQ), a great deal of distance computations between vectors are needed, which is computationally expensive and prevents its practical applications. In order to speed up the VQ encoding process, lots of fast codeword search algorithms based on 1-D characteristics have been proposed for reducing the codeword search space. This paper aims at improving the method using inequality proposed by Mu et al by using more effective method based on 1-D characteristics and adaptive subvector povrtitions. The experimental results show that our proposed scheme can reduce the extra memory requirment from N(N-1)/2 to 13N, meanwhile reducing the codeword search space by 33.88%50.94% and reducing the encoding time by 10.82%27.16%.
%K vector quantization
%K fast codeword search
%K 1-D characteristics
%K adaptive subvector patition<br>矢量量化
%K 快速码字搜索
%K 1维特征量
%K 子矢量划分
%K 自适应
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=D06194629680C940ACE75262F54B9D85&aid=0EAA6E0F141A5D8E2AC871AB41DE69EB&yid=99E9153A83D4CB11&vid=BCA2697F357F2001&iid=38B194292C032A66&sid=0C3F9E980968AF79&eid=CA9ED1AB4D9E3E04&journal_id=1006-8961&journal_name=中国图象图形学报&referenced_num=0&reference_num=15