采用空间矢量组合的小波图像分类矢量量化

该文提出了采用空间矢量组合对小波图像进行分类矢量量化的新方法。该方法充分利用了各高频子带系数的频率相关性和空间约束性将子带系数重组，依据组合矢量能量和零树矢量综合判定进行分类，整幅图像只需单一量化码书，分类信息占用比特数少，并采用了基于人眼视觉特性的加权均方误差准则进行矢量量化，提高了量化增益。仿真结果表明，该方法实现简单，在较低的编码率下，可达到很好的压缩效果。     

采用树结构矢量组合的小波图像分类矢量量化

本文提出了采用树结构矢量组合对小波图像进行分类矢量量化的新方法.该方法充分利用了子带系数的带间和带内的相关性,分类信息占用比特数少,并采用了基于人眼视觉特性的加权均方误差准则进行矢量量化,提高了量化增益.仿真结果表明,该方法实现简单,可达到很好的压缩效果.     

基于方向树结构矢量分类的小波图像网格编码矢量量化

本文提出了采用方向树结构矢量组合并分类对小波图像进行网格编码矢量量化（ＴＣＶＱ）的新方法。该方法矢量构成结合了子带系数的方向性，充分利用了子带系数带间和带内相关性，按能量和活跃度进行两级分类，降低了类中矢量的内部离散度，对活跃和非活跃类矢量实行加权ＴＣＶＱ，利用卷积编码扩展信号空间，用维特比算法搜索最优量化序列，比使用加权 ＶＱ提高了 ０．７ｄｂ左右。该方法编码计算复杂度适中，解码简单，有较好的压缩效果。     

基于空间组合矢量分类的小波图像网格编码矢量量化

本文基于零树编码、矢量分类和网格编码量化的思想,提出了对小波图像采用空间矢量组合和分类后进行网格编码矢量量化的新方法.该方法充分利用了各高频子带系数频率相关性和空间约束性,依据组合矢量能量和零树矢量综合判定进行分类,整幅图像只需单一量化码书,分类信息占用比特数少.对重要类矢量实行加权网格编码矢量量化,利用卷积编码扩展信号空间以增大量化信号间的欧氏距离,用维特比算法搜索最优量化序列,比使用矢量量化提高了0.6db左右.该方法编码计算复杂度适中,解码简单,可达到很好的压缩效果.     

基于树结构矢量分类的小波图像图编码矢量量化

本文基于零树编码,矢量分类和网络编码量化的思想,提出了对小波图象采用树结构矢量组合和分类后进行网络编码矢量量化的新方法,该方法充分利用了带系统的带间和带内的相关性,分类信息上中用比特数少,对重要类矢量实行加权网络编码矢量量化,利用卷积编码扩展信号空间以增大量化信号间的欧氏距离,用维特比算法搜索最优量化序列,并采用基于人眼视觉性特性的加权均方误差准则作为失真度量和码字匹配,提高了量化增益,仿真结果表明,该方法编码计算复杂度适中,解码简单,可达到很好的压缩效果。     

非对称树结构矢量量化方法研究

文章介绍一种图像低频子带编码的矢量量化方法—非对称树结构矢量量化。     

宽带ISF参数的转换分类乘积码锥形矢量量化

本文提出了一种新的应用于宽带导抗谱频率参数量化的转换分类乘积码锥形矢量量化方案.该量化器基于转换分类与乘积码锥形矢量量化原理,首先对待量化的ISF参数矢量进行分类,然后按类进行乘积码锥形矢量量化.该算法具有低存储量及低复杂度的特点.实验表明,该算法在每帧编码比特数为46时,平均谱失真比乘积码锥形矢量量化低,且达到了透明量化标准.     

图像子波／分类矢量量化及其在指纹识别中的应用

提出了适用于子波变换系数的矢量量化方法－－子波／分类矢量量化（Ｗ／ＣＶＱ）。以子波变换系数中对应于图像边缘信息的零交叉片段的具体情况为依据，将子波变换图像矢量分为不同的类别，然后为各类矢量建立码本。初步实验结果表明，该方法能克服传统矢量量化编码子波交换系数不能准确恢复有关边缘信息的缺点，此结果在光学实时指纹识别系统中的应用表明，它能够充分保留原因图像的信息，保证识别系统的准确识别。     

一种基于双正交小波变换和格型矢量量化的视频编码算法

本文提出了基于双正交小波变换（ｂｉｏｒｔｈｏｇｏｎａｌｗａｖｅｌｅｔｔｒａｎｓｆｏｒｍ）和格型矢量量化（ＬＶＱｌａｔｔｉｃｅｖｅｃｔｏｒｑｕａｎｔｉｚａｔｉｏｎ）的视频编码算法。在该方案中，小波变换将图像分解成多分辨率（ｍｕｌｔｉｒｅｓｏｌｕｔｉｏｎ）的子带图像，多分辨率运动估值（ＭＲＭＥ，ｍｕｌｔｉｒｅｓｏｌｕｔｉｏｎｍｏｔｉｏｎｅｓｔｉｍａｔｉｏｎ）技术实现子带图像的帧间预测，格型矢量量化对预测差值子带图像进行编码，从而获得了性能较好的活动图像编码新算法。     

图像编码的多分辨率分类矢量量化算法

本文结合小波多级变换后不同方向,不同尺度的系数要关性,提出了一种多分辨率的分类矢量量化方案,对由不同分辨率水平、不同方向的小波系数组成的矢量块分类量化编码,并设计了相应的性能良好的分类器,给出不同条件下的实验结果和数据,从而证明了该编码方案不但提高了图像的质量,同时计算复杂度也有一定的降低。     

Vector quantization with hierarchical classification of sub-blocks

A hierarchical classified vector quantization (HCVQ) method is described. In this method, the image is coded in several steps, starting with a relatively large block size, and successively dividing the block into smaller sub-blocks in a quad-tree fashion. The initial block is first vector quantized in the normal way. Classified vector quantization is then performed for its sub-blocks using the vector index of the initial block, i.e. rough information of the image, and the location of the sub-block within the initial block as classifiers. The coding proceeds in a similar way, adding more information of the fine details at each level. The method is found to be effective and to give a good subjective quality. It is also simple to implement, leading to coding speeds typical to a tree search VQ.     

基于小波变换的空间约束矢量量化方法

图像的小波变换能同时提供空间－频率局部化信息，而且小波变换域内矢量量化数据压缩已得到广泛应用，经过小波变换后，各子带小波分量存在相关性和空间约束，同时考虑到人类视觉对水平和垂直方向高频分量比对角方向更加敏感，本文提出了基于空间约束的矢量量化方法，该算法能同时提高编码效率和改善重构图像质量。     

小波变换在图象压缩中的应用

文章从实际应用角度出发,提出了一种基于小流变换和改进LBG向量量化的有损图象压缩算法。该算法首先利用小波变换对图象进行分解,然后根据各子带（子图象）特点对小波系数进行相应的改进LBG向量量化编码,从而实现图象压缩目的。实验结果表明：该图象压缩算法的使用,可以在图象质量几乎不下降的条件下,极大地提高压缩比,改善恢复图象质量。     

Image Compression Based on Multistage Vector Quantization

This paper presents a new three-stage vector quantization system for the compression of images. It uses some simple schemes including error block classifier, search order coding (SOC), and index vector coding. The error block classifier preserves the edge blocks and discards the psychovisually redundant texture blocks in the last stage. The index vector coding encodes the combination of quantization indexes of the last two stages, and the SOC is used for encoding the quantization index of the first stage. The proposed system can achieve better compression performance than the conventional multistage vector quantization systems.     

Fast competitive learning with classified learning rates for vector quantization

In this paper, we present a new competitive learning algorithm with classified learning rates, and apply it to vector quantization of images. The basic idea is to assign a distinct learning rate to each reference vector. Each reference vector is updated independently of all the other reference vectors using its own learning rate. Each learning rate is changed only when its corresponding reference vector wins the competition, and the learning rates of the losing reference vectors are not changed. The experimental results obtained with image vector quantization show that the proposed method learns more rapidly and yields better quality of the coded images than conventional competitive learning method with a scalar learning rate.     

Vector quantization with complexity costs

Vector quantization is a data compression method by which a set of data points is encoded by a reduced set of reference vectors: the codebook. A vector quantization strategy is discussed that jointly optimizes distortion errors and the codebook complexity, thereby determining the size of the codebook. A maximum entropy estimation of the cost function yields an optimal number of reference vectors, their positions, and their assignment probabilities. The dependence of the codebook density on the data density for different complexity functions is investigated in the limit of asymptotic quantization levels. How different complexity measures influence the efficiency of vector quantizers is studied for the task of image compression. The wavelet coefficients of gray-level images are quantized, and the reconstruction error is measured. The approach establishes a unifying framework for different quantization methods like K-means clustering and its fuzzy version, entropy constrained vector quantization or topological feature maps, and competitive neural networks