模拟退火多级VQ编码方案及实现

在查阅和分析多级矢量量化和模拟退火技术有关文献资料的基础上,阐述了矢量量化最优码书的形成条件,并以多级矢量量化和模拟退火技术为基础,提出了一种基于模拟退火技术的多级矢量量化编码方案,该方案充分弥补了多级矢量量化和模拟退火技术在图象编码中应用的各自不足,并且发挥了多级矢量量化和模拟火技术在图象编码中应用的各自优点,理论和实验都证明,该算法不仅能 码书存储量,而且图象恢复效果较好。     

线谱对参数预测多级矢量量化联合优化算法

提出了一种线谱对参数预测多级矢量量化联合优化算法.该算法对预测系数和多级矢量量化采用渐进闭环设计,通过迭代实现预测系数和多级矢量量化设计的联合优化.在多级矢量量化设计过程中,采用迭代优化实现多级码本的联合优化.采用语音线谱对参数对量化算法进行测试.测试结果表明,与传统算法相比,该量化算法可以减小线谱对参数量化失真.提高编码语音质量.     

一种基于小波变换新型的图像压缩算法

提出基于一种基于小渡变换的新型图像压缩算法,该算法在对图像进行多级小波变换后,利用3个方向上各自小波系数之间的相关性,构造符合图像特征的跨频带矢量,依据矢量能量和零树矢量综合判定进行矢量分类,并采用了基于人眼视觉特性的加权均方误差准则和基于成对最近邻算法(PNN)的LBG算法进行矢量量化,提高了图像的编码效率和重构质量.仿真结果表明,该算法实现简单,在较低的编码率下,可达到较好的压缩效果.     

语音谱参数的增强双预测多级矢量量化的码本设计方法

表征语音谱参数的线性预测编码(LPC)参数被广泛用于各种语音编码算法。甚低位率语音编码算法要求使用尽可能少的位率编码语音谱参数。文章提出了语音谱参数的增强双预测多级矢量量化算法(EDPMSVQ)的码本设计方法。这种改进的多级矢量量化方法充分利用语音谱参数的短时相关和长时相关特性,采用了有记忆的多级矢量量化算法(MSVQ),对语音谱参数的每一维分别使用不同的预测系数;并且通过利用相邻语音帧间语音谱参数的强相关和弱相关的不同特点,采用了分别对应于强相关和弱相关的两个预测值集合,进一步减小了语音谱参数编码位率。增强双预测多级矢量量化方法能够实现20位的语音谱参数近似“透明”量化,同时能够使语音谱参数量化时的计算复杂度略有减少,所需的存储空间大为减少。     

一种新的图像地址矢量量化编码算法

提出一种新的图像矢量量化编码算法。该算法结合相关矢量量化编码算法与地址矢量量化编码算法,首先根据相邻块状态进行编码地址的相关预测,对相关预测失败的图像块采用地址码匹配编码,并采用自适应算术编码进行。测试结果表明,相对于无记忆矢量量化编码算法,比特率约下降３８％－６８％,相对于安平提出的矢量量化地址编码算法以及王卫等提出的相关矢量量化编码算法,比特率约下降２５％以上。     

基于DSMVQ和S+P变换的图像压缩算法

提出了一种用于图像压缩的动态边匹配有限状态矢量量化(DSMVQ)算法，该算法通过S+P变换方法，对图像进行多级小波变换，利用3个方向上各自小波系数之间的相关性，构造符合图像特征的跨频带矢量，利用DSMVQ进行量化，采样了基于人眼视觉特性的加权均方误差准则，提高了图像的编码效率和重构质量。试验结果表明，该算法实现简单，在较低的编码率下，可达到较好的压缩效果。     

语音谱参数的切换双预测多级矢量量化的码本设计方法

提出了语音谱参数的切换双预测多级矢量量化算法（DPMSVQ） 的码本设计方法。这种改进的多级矢量量化方法充分利用语音谱参数的短时相关和长时相关特性，采用了有记忆的多级矢量量化算法（MSVQ）；并且通过利用相邻语音帧间语音谱参数的强相关和弱相关的不同特点，采用了分别对应于强相关和弱相关的两个预测值，进一步减小了语音谱参数编码位率。切换双预测多级矢量量化方法能够实现21位的语音谱参数近似“透明”量化，同时能够使语音谱参数量化时的计算复杂度略有减少，所需的存储空间大为减少。     

小波树结构快速矢量量化编码方法

提出了基于人眼视觉属性和应用小波树结构２快速图象编码的矢量量化图象编码方法，简称为树结构快速矢量量化编码。在分析此方法矢量量化特点之后，设计产生码本的统计方法，并提出了矢量量化编码的快速算法。     

神经网络矢量量化技术在语音编码中的应用

讨论了在语音编码中,应用神经网络技术进行矢量量化的算法。神经网络矢量量化算法可以压缩码本维数,提高码本搜索速度,从而优化矢量量化的效果。将这种优化的矢量量化算法应用于语音编码中,能降低运算复杂度,提高编码质量。     

基于改进边缘匹配矢量量化的图象编码算法

边缘匹配（Side-Match）矢量量化器（SMVQ）是有限状态矢量量化器（FSVQ）的一个分支。该量化器适合于对图象块间相关性高的图象进行压缩编码,其优点是在比特率相近 的情况下,编码质量高于传统的穷尺搜索矢量量化编码器,但其缺点是计算量大和比特率固定。本文提出了一种改进的边缘匹配矢量量化器。测试结果表明,该算法是变比特率编码算法,它比边缘匹配矢量量化器的比特率低,编码速度快,编码质量有所提高。     

视频图像高压缩比编码算法研究

提出了一种基于DCT变换的矢量自适应分类的全局矢量量化编码算法。为降低码矢的维数和计算复杂度，提高搜索速度和压缩比，将变换的DCT矢量自适应分类为平滑类、边缘类和纹理类，根据矢量的类别构造不同长度的变换矢量和根据矢量的类别分别采用改进的全局矢量量化算法进行相应的码书设计。为提高光照变化时相邻帧间矢量运动补偿的匹配率，在矢量构造中将DC系数单独进行编码。实验结果表明：该算法在信噪比和压缩比方面具有良好的视频压缩性能，比较适合于智能视频监控系统以及水下视频等光照随时间有较大变化的场合。     

Vector-quantization-based video codec for software-only playback on personal computers

This paper discusses a video compression and decompression method based on vector quantization (VQ) for use on general purpose computer systems without specialized hardware. After describing basic VQ coding, we survey common VQ variations and discuss their impediments in light of the target application. We discuss how the proposed video codec was designed to reduce computational complexity in every principal task of the video codec process. We propose a classified VQ scheme that satisfies the data rate, image quality, decoding speed, and encoding speed objectives for software-only video playback. The functional components of the proposed VQ method are covered in detail. The method employs a pseudo-YUV color space and criteria to detect temporal redundancy and low spatial frequency regions. A treestructured-codebook generation algorithm is proposed to reduce encoding execution time while preserving image quality. Two separate vector codebooks, each generated with the treestructured search, are employed for detail and low spatial frequency blocks. Codebook updating and sharing are proposed to further improve encoder speed and compression.     

Image and video indexing using vector quantization

Visual (image and video) database systems require efficient indexing to enable fast access to the images in a database. In addition, the large memory capacity and channel bandwidth requirements for the storage and transmission of visual data necessitate the use of compression techniques. We note that image/video indexing and compression are typically pursued independently. This reduces the storage efficiency and may degrade the system performance. In this paper, we present novel algorithms based on vector quantization (VQ) for indexing of compressed images and video. To start with, the images are compressed using VQ. In the first technique, for each codeword in the codebook, a histogram is generated and stored along with the codeword. We note that the superposition of the histograms of the codewords, which are used to represent an image, is a close approximation of the histogram of the image. This histogram is used as an index to store and retrieve the image. In the second technique, the histogram of the labels of an image is used as an index to access the image. We also propose an algorithm for indexing compressed video sequences. Here, each frame is encoded in the intraframe mode using VQ. The labels are used for the segmentation of a video sequence into shots, and for indexing the representative frame of each shot. The proposed techniques not only provide fast access to stored visual data, but also combine compression and indexing. The average retrieval rates are 95% and 94% at compression ratios of 16:1 and 64:1, respectively. The corresponding cut detection rates are 97% and 90%, respectively.     

均值与矢量量化复合快速图像编码算法

矢量量化是一种有效的数据压缩技术,由于其算法简单,具有较高的压缩率,因而被广泛应用于数据压缩编码领域。通过对图像块灰度特征的研究,根据图像的平滑与否,提出了对图像进行均值和矢量量化复合编码算法,该算法对平滑图像块采用均值编码,对非平滑块采用矢量量化编码。这不仅节省了平滑码字的存储空间,提高了码书存储效率,并且编码速度大大提高。同时采用码字旋转反色（2R）压缩算法将码书的存储容量减少到1/8,并结合最近邻块扩展搜索算法（EBNNS）对搜索算法进行优化。在保证图像画质的前提下,整个系统的图像编码速度比全搜索的普通矢量量化平均提高约7.7倍。     

应用主成分分析和KL变换的体育视频压缩算法

当前体育视频压缩算法存在压缩率低,丢失信息严重等缺陷,为了获得理想的体育视频压缩效果,提出了基于主成分分析和KL变换的体育视频压缩算法。首先分析当前体育视频压缩的研究现状,找到各种体育视频压缩算法的不足,然后采用主成分分析算法对体育视频关键帧投影,得到多个子空间,并采用KL变换对体育视频关键帧的子空间进行编码,使子空间的KL变换系数相关性最小,从而最大限度的实现体育视频压缩,最后与其它体育视频压缩算法进行仿真测试,测试结果表明,主成分分析和KL变换提升了体育视频压缩率,不仅能够去掉体育视频关键帧之间的冗余信息,而且体育视频压缩效率高,获得了比传统算法更好的体育视频压缩效果,具有更加广泛的实际应用价值。     

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.     

一种压缩比自适应的快速矢量量化算法

提出了一种压缩比自适应的矢量量化(VQ)编解码算法,将图像预先分为16×16的分块,根据图像块的平滑程度,减少重复搜索的运算量,大幅提高压缩比和编码速度,而解码图像的峰值信噪比(PSNR)只有很少下降。对于10幅标准图像的测试结果表明,与普通VQ相比,该文算法的压缩比平均提高54%,PSNR平均仅降低0.86%。对于单纯背景的图像,压缩比可达到200∶1左右。算法简单,适合硬件实现。     

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

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

A fast VQ codebook search with initialization and search order

Vector quantization (VQ), a lossy image compression, is widely used for many applications due to its simple architecture, fast decoding ability, and high compression rate. Traditionally, VQ applies the full search algorithm to search for the codeword that best matches each image vector in the encoding procedure. However, matching in this manner consumes a lot of computation time and leads to a heavy burden for the VQ method. Therefore, Torres and Huguet proposed a double test algorithm to improve the matching efficiency. However, their scheme does not include an initiation strategy to choose an initially searched codeword for each image vector, and, as a result, matching efficiency may be affected significantly. To overcome this drawback, we propose an improved double test scheme with a fine initialization as well as a suitable search order. Our experimental results indicate that the computation time of the double test algorithm can be significantly reduced by the proposed method. In addition, the proposed method is more flexible than existing schemes.     

Constrained-storage multistage vector quantization based on genetic algorithms

Multistage vector quantization (MSVQ) and their variants have been recently proposed. Before MSVQ is designed, the user must artificially determine the number of codewords in each VQ stage. However, the users usually have no idea regarding the number of codewords in each VQ stage, and thus doubt whether the resulting MSVQ is optimal. This paper proposes the genetic design (GD) algorithm to design the MSVQ. The GD algorithm can automatically find the number of codewords to optimize each VQ stage according to the rate–distortion performance. Thus, the MSVQ based on the GD algorithm, namely MSVQ(GD), is proposed here. Furthermore, using a sharing codebook (SC) can further reduce the storage size of MSVQ. Combining numerous similar codewords in the VQ stages of MSVQ produces the codewords of the sharing codebook. This paper proposes the genetic merge (GM) algorithm to design the SC of MSVQ. Therefore, the constrained-storage MSVQ using a SC, namely CSMSVQ, is proposed and outperforms other MSVQs in the experiments presented here.