一种新的混合域矢量量化图像压缩编码算法

为了有效捕获数字图像的重要视觉信息,提出一种新的混合域矢量量化图像编码算法.该算法首先对原始图像进行小波分解,同时对中高频小波子带实施自适应方向分解;然后对最低频子带进行DPCM编码;再结合高频子带系数相关性构造矢量,并采纳竞争学习矢量量化策略训练码书;最后利用Huffman方法对输出进行熵编码并生成比特流.仿真实验表明,本文所提出的混合域矢量量化图像编码算法是一种高效的图像压缩方法,不仅其压缩效果明显优于小波域矢量量化图像压缩方案,而且具有较强的通用性与适应性(小波域矢量量化方法对于Barbata之类纹理图像压缩效果较差,而本文算法的压缩效果却较理想).     

基于最优矢量量化零树编码的多小波图像压缩

提出一种基于多小波变换的矢量量化零树编码方案.利用多小波变换后各个子块之间的相关性,把图像的多小波分解看成是矢量四叉树结构,通过对多小波系数重排来保持小波系数的零树特征.对图像进行压缩仿真试验,结果表明多小波变换的图像压缩结果优于传统的小波变换结果.     

基于小波分析的低比特率图像压缩编码方法

本文提出一种基于小波分析的低比特率图像压缩编码方法.首先对图像进行小波分解,然后对高频子图像进行分类矢量量化(CVQ),对低频子图像采用DPCM加熵编码方法.利用不同分辨率级之间子图像的相似性,将最低分辨率级的子图像矢量编码信息用于高层分辨率级子图像矢量码书的训练,提高了码书生成速度;将最低分辨率级子图像的矢量编码信息作为整个图像的编码数据,提高了压缩比和编码速度,和现有文献给出的结果进行比较,该算法具有良好的性能.     

等误差竞争学习算法在矢量量化中的应用

提出了一种使各区域子误差相等的矢量量化算法,算法利用小波变换后各子带间的相关性,合理构造矢量。采用最优矢量量化器设计原则,通过调整学习过程中各子区域的误差,使之趋于相等,改善总的期望误差,获得更接近全局最优的码书。实验表明,这种算法获得的码本优于其它几种算法。     

自适应补偿矢量量化

提出了一种基于ＬＢＧ码书设计的新的图像矢量量化算法。该算法利用图像信号在正交矢量空间中的能量集中性,有效地减小了码书的搜索范围,加快了矢量量化速度。同时利用原始图像和重建图像之间的差值进行了自适应补偿,在保证较高压缩比的同时,有效地克服了矢量量化的致命缺陷,即重建图像存在严重的方块效应。     

基于小波变换和快速矢量量化的InSAR图像压缩

提出了一种基于小波变换和快速矢量量化的InSAR图像压缩编码方法。在小波变换域内，根据InSAR图像的统计特征进行非线性量化后，再进行小波树快速矢量量化压缩编码；并应用门限技术抑制图像噪音。实验结果表明：该方法对InSAR图像压缩效果明显优于EZW和SPIHT方法。     

一种快速、有效的量化与基于小波的图像压缩

量化是利用小波变换的图像压缩编码技术的关键环节之一。矢量量化和标量量化各有长短,该文将这二者有机地结合起来,称为混合量化(HQ—Hybrid Quantization)。它既有矢量量化的高效率,又具有标量量化的简单性,不需要进行码书训练,不要做乘除法。并用标准测试图像与其它方法的压缩结果进行了比较。     

压缩传感及其在医学图像融合中的应用

为适应压缩传感成像技术的发展,降低融合运算对计算资源的需求,提出一种压缩传感域医学图像融合方法.算法利用双树复数小波变换具有的近似平移不变性、多方向的特性,以其作为稀疏分解基对图像做稀疏分解;分解后得到的系数,经由随机抽取哈达码块矩阵生成观测矢量;对得到的随机观测矢量,采用加权平均的方法进行融合;再经梯度投影重构生成融合图像的小波分解系数;最后,由逆双树复数小波变换生成融合后的图像.实验结果表明:所提算法可获得好的融合质量,并提高融合计算效率.     

关键基于二维小波变换的图像矢量分解消噪方法

介绍了MATLAB二维小波工具箱在含噪图像预处理中的应用,并提出了一种基于二维小波变换的图像消噪的矢量分解方法。仿真结果表明,该矢量分解消噪方法确实可行,达到了理想的效果。     

基于自组织特征映射网络的模糊矢量量化算法

自组织特征映射（SOFM）是一种常用的矢量量化算法，它具有设计码书不依赖于初始码书等优点。模糊矢量量化算法（FVQ）将模糊关系引入码书的设计，训练矢量与码矢之间的模糊关系用隶属函数表示。本文提出了一种基于自组织特征映射网络的模糊矢量量化算法（FSOFM），FSOFM算法将SOFM网络的调节节点邻域看作训练矢量的模糊集，网络权值学习步长的选择依赖于隶属函数。由于设计码书的评价一般采用最小均方误差准则，而隶属函数是训练矢量与码矢之间距离的函数，FSOFM算法保证了网络的全局成优化和网络权值的局部调整一致；因此，FSOFM算法能够优化码书的设计，改善设计码书的性能。此外，FSOOFM算法还具良好的适应性，当网络的将LBG、SOFM、FVQ和FOSOFM算法用于一组具有不同边缘特性的图像的矢量量化中，我们发现采用FSOFM算法进行矢量量化的所有图像都具有最高的峰值信噪比PSNR。     

Evolutionary fuzzy particle swarm optimization vector quantization learning scheme in image compression

This article develops an evolutional fuzzy particle swarm optimization (FPSO) learning algorithm to self extract the near optimum codebook of vector quantization (VQ) for carrying on image compression. The fuzzy particle swarm optimization vector quantization (FPSOVQ) learning schemes, combined advantages of the adaptive fuzzy inference method (FIM), the simple VQ concept and the efficient particle swarm optimization (PSO), are considered at the same time to automatically create near optimum codebook to achieve the application of image compression. The FIM is known as a soft decision to measure the relational grade for a given sequence. In our research, the FIM is applied to determine the similar grade between the codebook and the original image patterns. In spite of popular usage of Linde–Buzo–Grey (LBG) algorithm, the powerful evolutional PSO learning algorithm is taken to optimize the fuzzy inference system, which is used to extract appropriate codebooks for compressing several input testing grey-level images. The proposed FPSOVQ learning scheme compared with LBG based VQ learning method is presented to demonstrate its great result in several real image compression examples.     

Image vector quantization algorithm via honey bee mating optimization

The vector quantization (VQ) was a powerful technique in the applications of digital image compression. The traditionally widely used method such as the Linde–Buzo–Gray (LBG) algorithm always generated local optimal codebook. Recently, particle swarm optimization (PSO) is adapted to obtain the near-global optimal codebook of vector quantization. An alternative method, called the quantum particle swarm optimization (QPSO) had been developed to improve the results of original PSO algorithm. In this paper, we applied a new swarm algorithm, honey bee mating optimization, to construct the codebook of vector quantization. The results were compared with the other three methods that are LBG, PSO–LBG and QPSO–LBG algorithms. Experimental results showed that the proposed HBMO–LBG algorithm is more reliable and the reconstructed images get higher quality than those generated from the other three methods.     

一个基于矢量量化的数字水印算法

文章提出了一个新的基于矢量量化的数字水印算法,与基于DCT(DiscreteCosineTransform)、DFT(DiscreteFourierTransform)及DWT(DiscreteWaveletTransform)等的传统水印算法不同,该算法利用码书分割方法和矢量量化索引的特点,在矢量量化的不同阶段分别嵌入水印来保护原始图像的版权,水印检测不需要原始图像。实验结果表明,该方法实现的水印具有良好的不可见性,并对JPEG压缩、矢量量化压缩、旋转以及剪切等空域操作也具有较好的稳健性。     

矢量量化的初始码书算法

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

Parallel codebook design for vector quantization on a message passing MIMD architecture

Vector quantization (VQ) is a widely used algorithm in speech and image data compression. One of the problems of the VQ methodology is that it requires large computation time especially for large codebook size. This paper addresses two issues. The first deals with the parallel construction of the VQ codebook which can drastically reduce the training time. A master/worker parallel implementation of a VQ algorithm is proposed. The algorithm is executed on the DM-MIMD Alex AVX-2 machine using a pipeline architecture. The second issue deals with the ability of accurately predicting the machine performance. Using communication and computation models, a comparison between expected and real performance is carried out. Results show that the two models can accurately predict the performance of the machine for image data compression. Analysis of metrics normally used in parallel realization is conducted.     

Vector quantization: a review

Vector quantization (VQ) is a very effective way to save bandwidth and storage for speech coding and image coding. Traditional vector quantization methods can be divided into mainly seven types, tree-structured VQ, direct sum VQ, Cartesian product VQ, lattice VQ, classified VQ, feedback VQ, and fuzzy VQ, according to their codebook generation procedures. Over the past decade, quantization-based approximate nearest neighbor (ANN) search has been developing very fast and many methods have emerged for searching images with binary codes in the memory for large-scale datasets. Their most impressive characteristics are the use of multiple codebooks. This leads to the appearance of two kinds of codebook: the linear combination codebook and the joint codebook. This may be a trend for the future. However, these methods are just finding a balance among speed, accuracy, and memory consumption for ANN search, and sometimes one of these three suffers. So, finding a vector quantization method that can strike a balance between speed and accuracy and consume moderately sized memory, is still a problem requiring study.

     

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.     

基于改进的SOFM神经网络的矢量量化方法

基于Kohonen自组织特征映射(SOFM)神经网络的矢量量化图像压缩编码是一种非常高效的方法,但其码字利用不均匀,某些神经元永远无法获胜而产生"死神经元"的问题仍然十分明显。在追求为使各个神经元能以较为均衡的几率获胜,尽量避免"死神经元"过程中,Kohonen SOFM-C很具代表性,它既能保持拓扑不变性映射又能最有效地避免"死神经元",是一种带"良心"的竞争学习方法。本文利用Kohonen SOFM-C码字利用更为均衡的优点,并针对SOFM在胜出神经元的邻域内神经元修改权值方法的不足,提出基于SOFM-C的辅助神经元自组织映射算法,此方法具有开放性,可随时添加入新的有效算法模块以达到更好的效果。并把该矢量量化算法应用于小波变换域,以获得更好的码书。仿真结果表明,该方法优于已有的SOFM方法。     

Image compression by vector quantization: a review focused on codebook generation

Recently, vector quantization (VQ) has received considerable attention, and has become an effective tool for image compression. It provides a high compression ratio and a simple decoding process. However, studies on the practical implementation of VQ have revealed some major difficulties such as edge integrity and codebook design efficiency. After reviewing the state-of-the-art in the field of vector quantization, we focus on iterative and non-iterative codebook generation algorithms.