归一化自适应预测矢量量化算法压缩SAR原始数据

该文提出归一化自适应预测矢量量化(NAPVQ)算法压缩SAR原始数据。NAPVQ算法先采用矢量线性预测器对输入矢量进行预测,再对原矢量与预测矢量之间的残差矢量进行矢量量化。该算法可视为差分脉冲调制在矢量量化中的拓展,其性能优于块自适应量化(BAVQ)算法以及归一化预测自适应量化(NPAQ)算法。对算法复杂度的进一步分析表明,NAPVQ算法能获得复杂度和性能之间比较合理的折衷,具有实用价值。     

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

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

应用神经网络的图像分类矢量量化编码

矢量量化作为一种有效的图像数据压缩技术，越来越受到人们的重视。设计矢量量化器的经典算法ＬＢＧ算法，由于运算复杂，从而限制了矢量量化的实用性。本文讨论了应用神经网络实现的基于边缘特征分类的矢量量化技术。它是根据人的视觉系统对图象的边缘的敏感性，应用模式识别技术，在对图像编码前，以边缘为特征对图像内容分类，然后再对每类进行矢量量化。除特征提取是采用离散余弦变换外，图像的分类和矢量量化都是由神经网络完成     

一种针对ISF参数的量化算法

宽带语音编码中普遍使用导抗谱频率描述声道。利用转换分类差矢量分裂矢量量化方法对导抗谱频率进行量化,该方法基于转换分类矢量量化及差值分裂矢量量化。IsF矢量先按照给出的码书分类,然后每一类中的差矢量再进行分裂矢量量化。实验结果表明,该算法可在每帧编码比特数为37时达到透明量化要求,并且码书存储量明显少于StephenSo等人给出的转换分类分裂矢量量化方法。     

一种快速模糊矢量量化图像编码算法

本文在学习矢量量化和模糊矢量量化算法的基础上,设计了一种新的训练矢量超球体收缩方案和码书学习公式,提出了一种快速模糊矢量量化算法。该算法具有对初始码书选取信赖性小,不会陷入局部最小和运算最小的优点。实验表明,ＦＦＶＱ设计的图像码书性能与ＦＶＡ算法相比,训练时间大大缩短,峰值信噪比也有改善。     

基于改进SMVQ的图像压缩算法

在图像编码方法中,矢量量化被认为是一种有效的低比特率图像编码方法.边匹配有限状态矢量量化利用相邻图像块之间的相关性避免了图像块边界之间大的灰度跃变.本文提出了一种改进的边匹配有限状态矢量量化,即双向低复杂度基于改进梯度的边匹配有限状态矢量量化.在双向低复杂度基于改进梯度的边匹配有限状态矢量量化中,第一次量化的状态码书尺寸由相邻图像块的梯度确定,第二次量化对第一次量化后的矢量中梯度值大于设定门限的矢量重新进行量化以提高图像质量.此外,和传统边匹配有限状态矢量量化利用上邻矢量和左邻矢量确定状态码书不同,新算法利用上、下、左、右四个相邻矢量来确定状态码书.试验结果表明,该算法的第二层编码在峰值信噪比上有1.5dB的改善;和传统的边匹配矢量量化相比较,在比特率相同时峰值信噪比平均有1.54dB的改善.     

一种提高矢量量化器性能的方法

矢量量化技术是一种既能高效压缩数码率，又能保持语音质量在编码方法，它不但能用于波形编码，而且能用于参数编码，本文主要论述了矢量量化在参数压缩编码中的应用，即应用模拟退火方法设计矢量量化器，对语音ｃｅｐ参数库进行压缩，通过语音倒谱参数库压缩前后，语音正确识别率听变化来评价所设计矢量量化器的性能，文章中提出了适用于语音倒谱参数的模拟退火时间表，对于所涉及的扰动范围，扰动次数方面主要参数进行了一定的探讨     

量化方法及其统计特征量用于图像检索的性能比较

分别对标量量化,矢量量化以及分类矢量量化等不同量化方法及其统计特征量用于图像检索的性能进行了分析和比较,对进一步实现支持检索的图像压缩算法具有一定的指导意义。     

矢量量化在语音信箱中的应用

本文讨论了矢量量化应用于实际数据压缩系统中的几个关键技术，并介绍在语音信箱中应用矢量量化技术时，如何设计码书与快速搜索算法。     

一种基于神经网络的矢量量化零冗余度信道编码方法

本文提出一种新的基于神经网络的矢量量化零冗余度信道编码方法,该方法能有效地降低矢量量化编码系统在有噪信道下的平均失真。     

A vector quantizer for the Laplace source

The low complexity, nearly optimal vector quantizer (VQ) is a generalization of T. R. Fischer's (1986) pyramid VQ and is similar in structure to the unrestricted polar quantizers previously presented for the independent Gaussian source. An analysis of performance is presented with results for both the product code pyramid VQ and the unrestricted version. This analysis, although asymptotic in nature, helps to demonstrate the performance advantages of the VQ. Implementation issues of the VQ are discussed. Nonasymptotic results are considered. In particular, the author presents an approximate design algorithm for finite bit rate and demonstrates the usefulness of this VQ through several example designs with Monte Carlo simulations of performance. For the restricted form (the pyramid VQ), the author provides further implementational information and low dimension analytical results     

Conditional entropy coding of VQ indexes for image compression

Block sizes of practical vector quantization (VQ) image coders are not large enough to exploit all high-order statistical dependencies among pixels. Therefore, adaptive entropy coding of VQ indexes via statistical context modeling can significantly reduce the bit rate of VQ coders for given distortion. Address VQ was a pioneer work in this direction. In this paper we develop a framework of conditional entropy coding of VQ indexes (CECOVI) based on a simple Bayesian-type method of estimating probabilities conditioned on causal contexts, CECOVI is conceptually cleaner and algorithmically more efficient than address VQ, with address-VQ technique being its special case. It reduces the bit rate of address VQ by more than 20% for the same distortion, and does so at only a tiny fraction of address VQ's computational cost.     

Gain-Adaptive Vector Quantization with Application to Speech Coding

The generalization of gain adaptation to vector quantization (VQ) is explored in this paper and a comprehensive examination of alternative techniques is presented. We introduce a class of adaptive vector quantizers that can dynamically adjust the "gain" or amplitude scale of code vectors according to the input signal level. The encoder uses a gain estimator to determine a suitable normalization of each input vector prior to VQ encoding. The normalized vectors have reduced dynamic range and can then be more efficiently coded. At the receiver, the VQ decoder output is multiplied by the estimated gain. Both forward and backward adaptation are considered and several different gain estimators are compared and evaluated. Gain-adaptive VQ can be used alone for "vector PCM" coding (i.e., direct waveform VQ) or as a building block in other vector coding schemes. The design algorithm for generating the appropriate gain-normalized VQ codebook is introduced. When applied to speech coding, gain-adaptive VQ achieves significant performance improvement over fixed VQ with a negligible increase in complexity.     

Multipurpose speech watermarking based on multistage vector quantization of linear prediction coefficients

To make speech watermarking achieve both copyright protection and integrity verification, a novel multipurpose speech watermarking algorithm based on the multistage vector quantization (MSVQ) of linear prediction coefficients (LPCs) is presented in this article. The property of natural speech that the vector quantization (VQ) indices of the LPCs amongst neigh- boring frames tend to be very similar is utilized to embed the robust watermark in the indices of the first-stage VQ (VQ1). Then, the semi-fragile watermark is embedded in the indices of the second-stage VQ (VQ2) with index constrained VQ encoding scheme. Both the robust watermark and the semi-fragile water- mark can be extracted without host speech. Simulation results verify the effectiveness of the proposed algorithm in terms of robustness and semi-fragility.     

Fractal curves to improve the reversible data embedding for VQ-indexes based on locally adaptive coding

The VQ reversible data embedding technology allows an original VQ coding to be completely restored after the extraction of embedded data. In this paper, we propose a new reversible scheme based on locally adaptive coding for VQ-compressed images. The fractal Hilbert curve is applied to replace the traditional trace of processing the VQ index table. The VQ index table is pre-processed to create a fractal Hilbert curve. Following the curve to process the VQ index table can get better compression rates in the data embedding procedure. Besides, compared to Chang et al.’s scheme, which compressed the inputted VQ index value only when the to-be-embedded bit b is 0, our method performs compressing operations in both cases that the to-be-embedded bits b are 0 and 1. The experimental results show that the proposed method has the best compression rate and the highest embedding capacity compared with other reversible VQ embedding methods.     

Index-compressed vector quantisation based on index mapping

The authors introduce a novel coding technique which significantly improves the performance of the traditional vector quantisation (VQ) schemes at low bit rates. High interblock correlation in natural images results in a high probability that neighbouring image blocks are mapped to small subsets of the VQ codebook, which contains highly correlated codevectors. If, instead of the whole VQ codebook, a small subset is considered for the purpose of encoding neighbouring blocks, it is possible to improve the performance of traditional VQ schemes significantly. The performance improvement obtained with the new method is about 3 dB on average when compared with traditional VQ schemes at low bit rates. The method provides better performance than the JPEG coding standard at low bit rates, and gives comparable results with much less complexity than address VQ     

Compression of color facial images using feature correctiontwo-stage vector quantization

A feature correction two-stage vector quantization (FC2VQ) algorithm was previously developed to compress gray-scale photo identification (ID) pictures. This algorithm is extended to color images in this work. Three options are compared, which apply the FC2VQ algorithm in RGB, YCbCr, and Karhunen-Loeve transform (KLT) color spaces, respectively. The RGB-FC2VQ algorithm is found to yield better image quality than KLT-FC2VQ or YCbCr-FC2VQ at similar bit rates. With the RGB-FC2VQ algorithm, a 128x128 24-b color ID image (49152 bytes) can be compressed down to about 500 bytes with satisfactory quality. When the codeword indices are further compressed losslessly using a first order Huffman coder, this size is further reduced to about 450 bytes.     

Incremental-search fast vector quantiser using triangularinequalities for multiple anchors

A new fast vector quantiser (VQ) is proposed which reduces computational complexity by searching the intersection of search regions defined by triangular inequalities for multiple anchors. A greedy algorithm which selects an anchor set is also proposed. The proposed VQ reduces the number of multiply operations by 24.4% compared to Li's VQ [1995] while preserving the same encoding quality as the full-search VQ     

基于VC6.0开发平台的矢量量化算法实现及优化

矢量量化是一种高效的有损压缩技术,但其存在编码算法实现实时性不高的问题.为了提高编码算法在PC机上的执行效率,文中从现有的成熟矢量量化有效算法(基于不等式删除准则)入手,针对PC机上intel CPU的工作特点,分析了矢量量化算法优化的特点,提出了采用MMX指令等有效的优化方法.     

Image compression using VQ-BTC

Vector quantization (VQ) and block truncation coding (BTC) are successful image compression techniques. However, a reproduced image using VQ or BTC suffers from edge degradation. A new technique that combines the advantages of both VQ and BTC to combat this degradation is presented and is referred to as VQ-BTC. In VQ-BTC, a low-detail block is encoded using VQ. For a high-detail block, a modification of BTC is used to determine the locations of the relatively lighter and relatively darker pixels inside the block and VQ is then used to encode each. VQ-BTC provides improved edge reproduction and much lower bit rates than those obtained by BTC