改进的分形矢量量化编码

为了提高图象的分形矢量量化编码效果，在利用四叉树对图象进行自适应分割的基础上，基于正交基三维分量投影准则，提出了图象块非平面近似方法，进而形成一种新的静态图象分形矢量量化编码方法。该方法首先通过对投影参数进行DPCM编码来构造粗糙图象，然后由此来构成差值图象编码的码书。由于该方法把分形和矢量量化编码结合起来，因此解码时只需查找码书，并仅进行对比度变换。计算机编、解码实验结果表明，该编码方法具有码书不需外部训练，解码也不需迭代等优点，且与其他同类编码器相比，该方法在压缩比和恢复图象质量（PSRN）方面均有明显改善。     

矢量量化的初始码书算法

矢量量化的初始码书设计是很重要的,影响或决定着其后码书形成算法的迭代次数和最终的码书质量。针对原有的初始码书算法在性能上随机性强与信源匹配程度不高的问题,提出一种对于训练矢量实施基于分量的和值排序,然后做分离平均的初始码书形成算法。算法使用了矢量的特征量,脱离了对于图像结构因数的依赖,能产生鲁棒性较好的初始码书。实验证明了该方法的有效性,与LBG算法结合可进一步提高码书质量。     

基于自组织特征映射神经网络的矢量量化

近年来,许多学者已经成功地将Ｋｏｈｏｎｅｎ的自组织特征映射（ＳＯＦＭ）神经网络应用于矢量量化（ＶＱ）图象压缩编码,相对于传统的ＫＬＢＧ算法,基于的ＳＯＦＭ算法的两个主要缺点是计算量大和生成的码书性能较差因此为了改善码书性能,对基本的ＳＯＦＭ算法的权值调整方法作了一些改进,同时为了降低计算量,又在决定获得胜神经元的过程中,采用快速搜索算法,在将改进的算法用于矢量量化码书设计后,并把生成的码书用于图象     

A novel approach for fast codebook re-quantization

In this paper, we present a fast codebook re-quantization algorithm (FCRA) using codewords of a codebook being re-quantized as the training vectors to generate the re-quantized codebook. Our method is different from the available approach, which uses the original training set to generate a re-quantized codebook. Compared to the traditional approach, our method can reduce the computing time dramatically, since the number of codewords of a codebook being re-quantized is usually much smaller than the number of original training vectors. Our method first classifies codewords of a re-quantized codebook into static and active groups. This approach uses the information of codeword displacements between successive partitions to reject impossible candidates in the partition process of codebook re-quantization. By implementing a fast search algorithm used for vector quantization encoding (MFAUPI) in the partition step of FCRA, the computational complexity of codebook re-quantization can be further reduced significantly. Using MFAUPI, the computing time of FCRA can be reduced by a factor of 1.55–3.78. Compared with the available approach OARC (optimization algorithm for re-quantization codebook), our proposed method can reduce the codebook re-quantization time by a factor of about 8005 using a training set of six real images. This reduction factor is increased when the re-quantized codebook size and/or training set size are increased. It is noted that our proposed algorithm can generate the same re-quantized codebook as that produced by the OARC.     

基于主分量分析的相关矢量量化编码算法

在编码前,首先计算码书中所有码字在主轴上的投影值,然后按照这些投影值从小到大对码字进行排序;在编码过程中,利用邻近图像块的高度相关性和当前输人矢量在主轴上的投影值共同确定相应的码字搜索范围．实验结果表明,与传统穷尽搜索矢量量化编码法相比,虽然文中算法的编码质量略有下降,但编码速度和压缩效率都有了显著的提高．     

模糊聚类在自适应矢量量化码本训练中的应用

自适应矢量量化在语音处理中有广泛的应用,提出了一种基于ＳＦＣＭ算法的自适应矢量量化码本的训练方法,其特点是通过模糊聚类方法,重新调整训练样本与码字之间的隶属度,达到最小编码失真,使码本更适合新说话人,且计算简单,方法的实验结果表明,可以使编码平均失真下降。     

Energy-Based Split Vector Quantizer Employing Signal Representation in Multiple Transform Domains

Mikhael, W., and Krishnan, V., Energy-Based Split Vector Quantizer Employing Signal Representation in Multiple Transform Domains, Digital Signal Processing11 (2001) 359–370Vector quantization schemes are widely used for waveform coding of one- and multidimensional signals. In this contribution, a novel energy-based, split vector quantization technique is presented, which represents digital signals efficiently as measured by the number of bits per sample for a predetermined signal reconstruction quality. In this approach, each signal vector is projected into multiple transform domains. In the learning mode, for a given transform domain representation, the transformed vector is split into subvectors (subbands) of equal average energy estimated from the transformed training vector ensemble. An equal number of bits is assigned to each subvector. A codebook is then designed for each equal energy subband of each transform domain representation. In the running mode, the coder selects codes from the domain that best represents the signal vector. The proposed multiple transform, split vector quantizer is developed and its performance is evaluated for both single-stage and multistage implementations. Several single transform vector quantizers for waveform coding exist, some of which employ energy-based bit allocation. Sample results using one-dimensional speech signals confirm the superior performance of the proposed scheme over existing single transform vector quantizers for waveform coding.     

基于空间—色工多维向量模糊量化的彩色图象压缩

在Ｆｕｚｚｙｋ－ｍｅａｎｓ算法的基础上,考虑到真空蝇的色度信息与空间相关性,提出了空间一色度复合的多维向量模糊聚类量化方法它能有效地压缩彩色图象信息,量化失真小,并在不使图象边缘钝化的条件下去除图象的高频噪声。该方法在彩色图象在实验中取得了良好的效果。     

Fast additive quantization for vector compression in nearest neighbor search

Vector quantization has been widely employed in nearest neighbor search because it can approximate the Euclidean distance of two vectors with the table look-up way that can be precomputed. Additive quantization (AQ) algorithm validated that low approximation error can be achieved by representing each input vector with a sum of dependent codewords, each of which is from its own codebook. However, the AQ algorithm relies on computational expensive beam search algorithm to encode each vector, which is prohibitive for the efficiency of the approximate nearest neighbor search. In this paper, we propose a fast AQ algorithm that significantly accelerates the encoding phase. We formulate the beam search algorithm as an optimization of codebook selection orders. According to the optimal order, we learn the codebooks with hierarchical construction, in which the search width can be set very small. Specifically, the codewords are firstly exchanged into proper codebooks by the indexed frequency in each step. Then the codebooks are updated successively to adapt the quantization residual of previous quantization level. In coding phase, the vectors are compressed with learned codebooks via the best order, where the search range is considerably reduced. The proposed method achieves almost the same performance as AQ, while the speed for the vector encoding phase can be accelerated dozens of times. The experiments are implemented on two benchmark datasets and the results verify our conclusion.     

基于空间-色度多维向量模糊量化的彩色图象压缩

在Ｆｕｚｚｙｋ－ｍｅａｎｓ算法的基础上,考虑到真实图象中的色度信息与空间相关性,提出了空间－色度复合的多维向量模糊聚类量化方法。它能有效地压缩彩色图象信息,量化失真小,并在不使图象边缘钝化的条件下去除图象的高频噪声。该方法在彩色图象处理的实验中取得了良好的效果     

一种新颖的基于哈德码变换的码字搜索算法

针对图像矢量量化编码的复杂性,提出了一种新颖的快速最近邻码字搜索算法。该算法首先计算出每个码字和输入矢量的哈德码变换,然后为输入矢量选取范数距离最近的初始匹配码字,利用多控制点的三角不等式和两条有效的码字排除准则,把不匹配的码字排除,最后选取与输入矢量最匹配的码字。实验结果表明,新算法相比于其他算法,在保证编码质量的前提下,码字搜索时间和计算量均有了明显降低。     

一种低码率彩色人脸图像编码方法

提出了一种适合低码率信道传输的嵌入式彩色人脸图像编码方法,不仅把握了人脸图像的特点,而且充分利用了彩色图像小波变换后的多种相关性。该方法将联合色彩分量矢量量化和零块、零树编码方法巧妙结合,把彩色图像的三个色彩分量单独扫描,单独编码的过程简化为联合扫描和联合编码的过程。实验结果表明该算法在低码率下,相比JPEG,获得了在视觉效果和峰值信噪比方面更好的恢复图像质量。     

Image restoration of compressed image using classified vector quantization

To reduce communication bandwidth or storage space, image compression is needed. However, the subjective quality of compressed images may be unacceptable and the improvement of quality for compressed images may be desirable. This paper extends and modifies classified vector quantization (CVQ) to improve the quality of compressed images. The process consists of two phases: the encoding phase and the decoding phase. The encoding procedure needs a codebook for the encoder, which transforms a compressed image to a set of codeword-indices. The decoding phase also requires a different codebook for the decoder, which enhances a compressed image from a set of codeword-indices. Using CVQ to improve a compressed image's quality is different from the existing algorithm, which cannot reconstruct the high frequency components for compressed images. The experimental results show that the image quality is improved dramatically. For images in the training set, the improvement of PSNR is about 3 dB. For images, which are outside the training set, the improvement of PSNR is about 0.57 dB, which is comparable to the existing method.     

A novel encoding algorithm for vector quantization using transformed codebook

In this paper, a novel encoding algorithm for vector quantization is presented. Our method uses a set of transformed codewords and partial distortion rejection to determine the reproduction vector of an input vector. Experimental results show that our algorithm is superior to other methods in terms of the computing time and number of distance calculations. Compared with available approaches, our method can reduce the computing time and number of distance calculations significantly. Compared with the available best method of reducing the number of distance computations, our approach can reduce the number of distance calculations by 32.3-67.1%. Compared with the best encoding algorithm for vector quantization, our method can also further reduce the computing time by 19.7-23.9%. The performance of our method is better when a larger codebook is used and is weakly correlated to codebook size.     

基于模糊矢量量化图象编码的研究

分析了模糊矢量量化（ＦＶＱ）图象编码的原理，给出了ＦＶＱ设计三要素。提出了用于图象编码的指数型模糊矢量量化算法（ＦＶＱＥ）。实验结果表明，ＦＶＱＥ的图象编码性能与ＦＶＱ相当，但收敛速度要略快于ＦＶＱ算法。     

Adaptive hierarchical vector quantization for image coding

In this paper an adaptive hierarchical algorithm of vector quantization for image coding is proposed. First the basic codebook is generated adaptively, then the codes are coded into higher-level codes by creating an index codebook using the redundance presented in the codes. This hierarchical scheme lowers the bit rate significantly and causes little more computation and no more distortion than the single-layer adaptive VQ algorithm does which is used to create the basic codebook.     

说话人识别中基于聚类特征的矢量量化技术

为解决采用矢量量化的方法进行说话人识别时出现的失真问题,根据汉语语音的发音特性,提出了将矢量量化与语音特征的聚类技术相结合的方法,在进行矢量量化码书训练之前,先对特征矢量进行聚类筛选。实验结果表明,当测试语音片段长度为4 s时,在保持95％左右识别率下,采用普通矢量量化方法需64码本数,而采用该文方法只需8码本数,降低了8倍。结果说明该方法不但在一定程度上解决了因训练样本不足而引起的失真问题,而且通过方法的改进,实现了采用较低码字数产生较好的识别结果,从而提高识别效率。     

应用多索引加法量化编码的近邻检索算法

目的 海量图像检索技术是计算机视觉领域研究热点之一,一个基本的思路是对数据库中所有图像提取特征,然后定义特征相似性度量,进行近邻检索。海量图像检索技术,关键的是设计满足存储需求和效率的近邻检索算法。为了提高图像视觉特征的近似表示精度和降低图像视觉特征的存储空间需求,提出了一种多索引加法量化方法。方法 由于线性搜索算法复杂度高,而且为了满足检索的实时性,需把图像描述符存储在内存中,不能满足大规模检索系统的需求。基于非线性检索的优越性,本文对非穷尽搜索的多索引结构和量化编码进行了探索新研究。利用多索引结构将原始数据空间划分成多个子空间,把每个子空间数据项分配到不同的倒排列表中,然后使用压缩编码的加法量化方法编码倒排列表中的残差数据项,进一步减少对原始空间的量化损失。在近邻检索时采用非穷尽搜索的策略,只在少数倒排列表中检索近邻项,可以大大减少检索时间成本,而且检索过程中不用存储原始数据,只需存储数据集中每个数据项在加法量化码书中的码字索引,大大减少内存消耗。结果 为了验证算法的有效性,在3个数据集SIFT、GIST、MNIST上进行测试,召回率相比近几年算法提升4%~15%,平均查准率提高12%左右,检索时间与最快的算法持平。结论 本文提出的多索引加法量化编码算法,有效改善了图像视觉特征的近似表示精度和存储空间需求,并提升了在大规模数据集的检索准确率和召回率。本文算法主要针对特征进行近邻检索,适用于海量图像以及其他多媒体数据的近邻检索。     

采用位平面直方图特征向量的图像检索方法

首先将图像分解为8个位平面,选择前4个重要位平面,求出其灰度码表示,根据每个灰度码位平面的颜色直方图,计算均值、标准偏差、偏斜度、能量、熵;综合这些特征构成名为位平面直方图特征向量的组合特征,进行图像检索。实验中采用Tonimoto相似度量函数计算图像间的相似度。该方法计算速度快,避免了图像量化造成的误检。实验结果显示了该方法的检索性能。     

Improved batch fuzzy learning vector quantization for image compression

In this paper, we develop a batch fuzzy learning vector quantization algorithm that attempts to solve certain problems related to the implementation of fuzzy clustering in image compression. The algorithm’s structure encompasses two basic components. First, a modified objective function of the fuzzy c-means method is reformulated and then is minimized by means of an iterative gradient-descent procedure. Second, the overall training procedure is equipped with a systematic strategy for the transition from fuzzy mode, where each training vector is assigned to more than one codebook vectors, to crisp mode, where each training vector is assigned to only one codebook vector. The algorithm is fast and easy to implement. Finally, the simulation results show that the method is efficient and appears to be insensitive to the selection of the fuzziness parameter.