基于Hadamard变换和矢量分割的快速搜索算法

乔阳; 潘志斌; 乔瑞萍; 李东平; 蔡骋

doi:10.11834/jig.20091113

图像处理和编码 | 浏览量 : 0 下载量: 222 CSCD: 0

PDF
导出
分享
收藏
专辑

基于Hadamard变换和矢量分割的快速搜索算法
An Improved Fast Search Algorithm Based on Hadamard Transform and Vector Partition
2009年14卷第11期页码：2269
纸质出版：2009
DOI： 10.11834/jig.20091113
稿件说明：

移动端阅览

乔阳, 潘志斌, 乔瑞萍, 李东平, 蔡骋. 基于Hadamard变换和矢量分割的快速搜索算法[J]. 中国图象图形学报, 2009,14(11):2269. DOI： 10.11834/jig.20091113.

An Improved Fast Search Algorithm Based on Hadamard Transform and Vector Partition[J]. Journal of Image and Graphics, 2009, 14(11): 2269. DOI： 10.11834/jig.20091113.

摘要

为了对图像信号进行快速有效压缩，提出了一种改进的基于Hadamard变换和矢量分割的双测试算法。该算法首先在Hadamard域中对空域双测试算法的两个删除准则进行了等效变换；然后在实验的基础上，对变换域码字和输入矢量进行了恰当的矢量分割；最后在码字搜索过程中，利用其中一个最为有效的删除准则来排除大部分的不匹配码字。实验结果表明，改进算法能大大提高码字的搜索效率，搜索范围可减少到原始算法搜索范围的约14%～17%，总体编码时间也减少到原始算法编码时间的约35%～45%。

Abstract

An improved double test algorithm in Hadamard transform(HT)domain is proposed in this paper.First

two kick-out conditions in original DTA method are rewritten properly in HT domain.Then

codewords and input vectors in HT domain are properly partitioned based on the result of the preliminary experiment.Finally

by using the better kick-out condition many unmatched codewords can be eliminated.The simulation shows that the search space of the improved algorithm in this paper is reduced to about 14%～17%

and the encoding time is reduced to about 35%～45% compared to the original algorithm.