Predictive residual vector quantization [image coding]

This paper presents a new vector quantization technique called predictive residual vector quantization (PRVQ). It combines the concepts of predictive vector quantization (PVQ) and residual vector quantization (RVQ) to implement a high performance VQ scheme with low search complexity. The proposed PRVQ consists of a vector predictor, designed by a multilayer perceptron, and an RVQ that is designed by a multilayer competitive neural network. A major task in our proposed PRVQ design is the joint optimization of the vector predictor and the RVQ codebooks. In order to achieve this, a new design based on the neural network learning algorithm is introduced. This technique is basically a nonlinear constrained optimization where each constituent component of the PRVQ scheme is optimized by minimizing an appropriate stage error function with a constraint on the overall error. This technique makes use of a Lagrangian formulation and iteratively solves a Lagrangian error function to obtain a locally optimal solution. This approach is then compared to a jointly designed and a closed-loop design approach. In the jointly designed approach, the predictor and quantizers are jointly optimized by minimizing only the overall error. In the closed-loop design, however, a predictor is first implemented; then the stage quantizers are optimized for this predictor in a stage-by-stage fashion. Simulation results show that the proposed PRVQ scheme outperforms the equivalent RVQ (operating at the same bit rate) and the unconstrained VQ by 2 and 1.7 dB, respectively. Furthermore, the proposed PRVQ outperforms the PVQ in the rate-distortion sense with significantly lower codebook search complexity.     

Design, performance, and complexity analysis of residualtrellis-coded vector quantizers

Multistage trellis-coded vector quantization (MS-TCVQ) is developed as a constrained trellis source-coding technique. The performance of the two-stage TCVQ is studied for Gaussian sources. Issues of stage-by-stage design, output alphabet selection, and complexity are addressed with emphasis on selecting and partitioning the stage codebooks. For a given rate, MS-TCVQ achieves low encoding and storage complexity compared to TCVQ, and comparisons with same-dimensional multistage vector quantization indicate a 0.5-3-dB improvement in signal-to-quantization-noise ratio     

Trellis-coded vector quantization

Trellis-coded quantization is generalized to allow a vector reproduction alphabet. Three encoding structures are described, several encoder design rules are presented, and two design algorithms are developed. It is shown that for a stationary ergodic vector source, if the optimized trellis-coded vector quantization reproduction process is jointly stationary and ergodic with the source, then the quantization noise is zero-mean and of a variance equal to the difference between the source variance and the variance of the reproduction sequence. Several examples illustrate the encoder design procedure and performance     

Trellis-coded quantization designed for noisy channels

Trellis-coded quantization (TCQ) of memoryless sources is developed for transmission over a binary symmetric channel. The optimized TCQ coder can achieve essentially the same performance as Ayanoglu and Gray's (1987) unconstrained trellis coding optimized for the binary symmetric channel, but with a much lower implementation complexity for transmission rates above 1 b/sample. In most cases, the optimized TCQ coder also provides larger signal-to-noise ratio than Farvardin and Vaishampayan's (1991) channel-optimized vector quantization. Algorithms are developed for the joint design of trellis-coded quantization/modulation (TCQ/TCM). The jointly designed TCQ/TCM system outperforms the straightforward cascade of separately designed TCQ and TCM systems. The improvement is most significant at low channel signal-to-noise ratio. For a first-order Gauss-Markov source, the predictive TCQ/TCM performance can exceed that of optimum pulse amplitude modulation     

Residual vector quantization using a multilayer competitive neuralnetwork

This paper presents a new technique for designing a jointly optimized residual vector quantizer (RVQ). In conventional stage-by-stage design procedure, each stage codebook is optimized for that particular stage distortion and does not consider the distortion from the subsequent stages. However, the overall performance can be improved if each stage codebook is optimized by minimizing the distortion from the subsequent stage quantizers as well as the distortion from the previous stage quantizers. This can only be achieved when stage codebooks are jointly designed for each other. In this paper, the proposed codebook design procedure is based on a multilayer competitive neural network where each layer of this network represents one stage of the RVQ. The weight connecting these layers form the corresponding stage codebooks of the RVQ. The joint design problem of the RVQ's codebooks (weights of the multilayer competitive neural network) is formulated as a nonlinearly constrained optimization task which is based on a Lagrangian error function. This Lagrangian error function includes all the constraints that are imposed by the joint optimization of the codebooks. The proposed procedure seeks a locally optimal solution by iteratively solving the equations for this Lagrangian error function. Simulation results show an improvement in the performance of an RVQ when designed using the proposed joint optimization technique as compared to the stage-by-stage design, where both generalized Lloyd algorithm (GLA) and the Kohonen learning algorithm (KLA) were used to design each stage codebook independently, as well as the conventional joint-optimization technique     

Block Constrained Trellis Coded Vector Quantization of LSF Parameters for Wideband Speech Codecs

In this paper, block constrained trellis coded vector quantization (BC‐TCVQ) is presented for quantizing the line spectrum frequency parameters of the wideband speech codec. Both a predictive structure and a safety‐net concept are combined into BC‐TCVQ to develop the predictive BC‐TCVQ. The performance of this quantization is compared with that of the linear predictive coding vector quantizer used in the AMR‐WB codec, demonstrating reductions in spectral distortion.     

Trellis coded vector quantization

A vector generalization of trellis coded quantization (TCQ), called trellis coded vector quantization (TCVQ), and experimental results showing its performance for an i.i.d. Gaussian source are presented. For a given rate, TCVQ yields a lower distortion that TCQ at the cost of an increase in implementation complexity. In addition, TCVQ allows fractional rates, which TCQ does not     

Trellis-coded vector quantisation based on modified set partitionmethod and partial vector search scheme

An efficient trellis-coded vector quantisation (TCVQ) algorithm based on the modified set partition method and partial distance search scheme is presented. Using the modified set partition method, the minimum distance within a subset can be maximised as much as possible, thus improving the performance of the TCVQ. A novel partial distance search method based on the codebook structure of TCVQ is also proposed to reduce the computational complexity of the minimum distortion encoding for TCVQ. Experimental results show that it can reduce the computational complexity by ~60-90% depending on the codebook size     

Advances in residual vector quantization: a review

Advances in residual vector quantization (RVQ) are surveyed. Definitions of joint encoder optimality and joint decoder optimality are discussed. Design techniques for RVQs with large numbers of stages and generally different encoder and decoder codebooks are elaborated and extended. Fixed-rate RVQs, and variable-rate RVQs that employ entropy coding are examined. Predictive and finite state RVQs designed and integrated into neural-network based source coding structures are revisited. Successive approximation RVQs that achieve embedded and refinable coding are reviewed. A new type of successive approximation RVQ that varies the instantaneous block rate by using different numbers of stages on different blocks is introduced and applied to image waveforms, and a scalar version of the new residual quantizer is applied to image subbands in an embedded wavelet transform coding system.     

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

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

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

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

Optimal soft decoding for combined trellis-codedquantization/modulation

The maximum a posteriori (MAP) algorithm is used as a minimum mean-squared-error decoder for combined trellis-coded quantization and modulation. The optimal trellis-coded quantizer is derived when the soft-decoding MAP algorithm is used as a decoder. The trellis-coded quantizer and the soft decoder are optimized iteratively for minimum overall distortion from transmitter input to receiver output. Significant performance improvement is achieved for both memoryless Gaussian and uniform source, especially for very noisy channels     

网格编码矢量量化在SAR原始数据压缩中的应用

本文提出了一种结合传统的块自适应量化与网格编码矢量量化对SAR原始数据进行压缩的方法。首先对SAR原始数据实施块自适应量化以减小数据的动态范围,然后对块自适应量化后的数据进行网格编码矢量量化。该方法在考虑了SAR原始数据特性的基础上较好地利用了矢量的空间相关性和信号的时间相关性,进一步提高了量化增益。仿真结果表明,该方法在SAR原始数据的压缩中取得了很好的效果。     

人工噪声辅助安全传输中的反馈比特数研究人工噪声辅助安全传输中的反馈比特数研究

本文主要研究了人工噪声辅助的多输入单输出（Multiple-input Single-output, MISO）物理层安全传输系统中的最小反馈比特数问题。论文对信道方向信息采用基于随机矢量量化（Random Vector Quantization, RVQ）的码本反馈方法,首先定量分析了RVQ量化导致的系统保密速率损失,充分考虑不同发送信噪比条件与量化误差的特点,推导出了所需最小反馈比特数的闭合表达式。分析表明为保持恒定的遍历保密容量损失,反馈比特数应随对数信噪比及(Nt-1)线性变化（Nt为发送天线数）。理论分析和仿真结果表明,依据本文得到的闭合表达式调整反馈比特数,可以满足系统的安全性能要求。现有研究没有考虑信噪比较低的情况,而本文的结论适用于各种信噪比情况,对于人工噪声辅助的物理层安全传输策略实用化具有指导意义。      

DCT域网格编码矢量量化

本文提出了在离散余弦变换(DCT)域作网格编码矢量量化(TCVQ),并利用量化后相关性的新方法.该方法结合了DCT变换、矢量量化和网格编码量化的优点,它充分利用信号DCT域和时域的相关性来逼近率失真下界,并利用维特比算法来寻找最佳量化序列.同时,它还利用量化后码字间存在的相关性来进一步降低编码率.仿真结果表明,该方法在保持高压缩比的同时具有很高的信噪比性能.在相同编码率下它比全搜索矢量量化(VQ)好1dB左右.同时该方法具有计算量适中,解码简单以及对误差扩散不敏感的优点.     

On the performance of random vector quantization limited feedback beamforming in a MISO system

In multiple antenna wireless systems, beamforming is a simple technique for guarding against the negative effects of fading. Unfortunately, beamforming requires the transmitter to have knowledge of the forward-link channel which is often not available a priori. One way of overcoming this problem is to design the beamforming vector using a limited number of feedback bits sent from the receiver to the transmitter. In limited feedback beamforming, the beamforming vector is restricted to lie in a codebook that is known to both the transmitter and receiver. Random vector quantization (RVQ) is a simple approach to codebook design that generates the vectors independently from a uniform distribution on the complex unit sphere. This correspondence presents performance analysis results for RVQ limited feedback beamforming     

Variable rate vector quantization for speech, image, and videocompression

The performance of a vector quantizer can be improved by using a variable-rate code. Three variable-rate vector quantization systems are applied to speech, image, and video sources and compared to standard vector quantization and noiseless variable-rate coding approaches. The systems range from a simple and flexible tree-based vector quantizer to a high-performance, but complex, jointly optimized vector quantizer and noiseless code. The systems provide significant performance improvements for subband speech coding, predictive image coding, and motion-compensated video, but provide only marginal improvements for vector quantization of linear predictive coefficients in speech and direct vector quantization of images. Criteria are suggested for determining when variable-rate vector quantization may provide significant performance improvement over standard approaches     

Joint trellis-coded quantization watermarking for JPEG2000 images

Watermarking in the Joint Photographic Experts Group (JPEG)2000 coding pipeline is investigated in this paper. A joint quantization and watermarking method based on trellis-coded quantization (TCQ) is proposed to reliably embed data during the quantization stage of the JPEG2000 part 2 codec. The central contribution of this work is the use of a single quantization module to jointly perform quantization and watermark embedding at the same time. The TCQ-based watermarking technique allows embedding the watermark in the detail sub-bands of one or more resolution levels except the first one. Watermark recovery is performed after image decompression. The performance of this joint scheme in terms of image quality and robustness against common image attacks was estimated on real images.     

Symmetric trellis-coded vector quantization

We present here design techniques for trellis-coded vector quantizers with symmetric codebooks that facilitate low-complexity quantization as well as partitioning into equiprobable sets for trellis coding. The quantization performance of this coder on the independently identically distributed (i.i.d.) Laplacian source matches the performance of trellis-based scalar-vector quantization (TB-SVQ), but requires less computational complexity     

Efficient spatial-spectral compression of hyperspectral data

Mean-normalized vector quantization (M-NVQ) has been demonstrated to be the preferred technique for lossless compression of hyperspectral data. In this paper, a jointly optimized spatial M-NVQ/spectral DCT technique is shown to produce compression ratios significantly better than those obtained by the optimized spatial M-NVQ technique alone