基于子矢量技术的矢量量化码字快速搜索算法

针对矢量量化编码过程中,码书搜索计算量较大的问题,提出一种基于子矢量技术的矢量量化码字快速搜索算法.算法使用小波变换后的系数合理构造矢量,在码字搜索过程中将输入矢量和码字划分为几个互不重合的子矢量,利用各个子矢量的2范数建立码字排除不等式,最终实现快速排除不匹配码字的目的.实验结果表明,该算法比EEENNS(equal-average equal-variance equal-norm nearest neiohbor search)算法在失真计算次数和计算复杂度上分别减少了51%～63%和25%～40%.相比Pan的算法减少了28%～41%的失真计算次数和31%～44%的计算量,而比Chen的算法则减少了8%～22%的失真计算次数和11%～19%的计算量.     

Hadamard域中结合矢量特征值和子矢量和值的码字快速搜索算法

研究了一种基于Hadamard变换的结合矢量特征值和子矢量和值的快速码字搜索算法.该算法充分利用矢量特征量和子矢量和值在空域和Hadamard域间的联系,建立了一种4步高效排除不等式,再结合部分失真PDS(partial distortion search)排除法,有效地排除了大量不匹配码字.实验结果表明,算法相比于其...     

Fast encoding algorithm for vector quantization based on subvector L2-norm

A fast encoding algorithm based on the mean square error （MSE） distortion for vector quantization is introduced. The vector, which is effectively constructed with wavelet transform （WT） coefficients of images, can simplify the realization of the non-linear interpolated vector quantization （NLIVQ） technique and make the partial distance search （PDS） algorithm more efficient. Utilizing the relationship of vector L2-norm and its Euclidean distance, some conditions of eliminating unnecessary codewords are obtained. Further, using inequality constructed by the subvector L2-norm, more unnecessary codewords are eliminated. During the search process for code, mostly unlikely codewords can be rejected by the proposed algorithm combined with the non-linear interpolated vector quantization technique and the partial distance search technique. The experimental results show that the reduction of computation is outstanding in the encoding time and complexity against the full search method.     

关于正态分布的一个注记

推广了高维分布的正态性由低维分布检验问题的有关结论，得到一簇任意Ｎ（１＜Ｎ＜ｎ）维子向量服从正态分布而本身非正态的ｎ维分布密度；并给出判定ｎ维正态分布的一个充分条件。     

Fast encoding algorithm for vector quantization based on subvector L2-norm

A fast encoding algorithm based on the mean square error (MSE) distortion for vector quantization is introduced. The vector, which is effectively constructed with wavelet transform (WT) coefficients of images, can simplify the realization of the non-linear interpolated vector quantization (NLIVQ) technique and make the partial distance search (PDS) algorithm more efficient. Utilizing the relationship of vector L2-norm and its Euclidean distance, some conditions of eliminating unnecessary codewords are obtained. Further, using inequality constructed by the subvector L2-norm, more unnecessary codewords are eliminated. During the search process for code, mostly unlikely codewords can be rejected by the proposed algorithm combined with the non-linear interpolated vector quantization technique and the partial distance search technique. The experimental results show that the reduction of computation is outstanding in the encoding time and complexity against the full search method.