二维网格编码矢量量化及其在静止图像量化中的应用

该文提出了在二维码书空间中，在矢量量化（VQ）的基础上，应用网格编码量化（TCQ）的思想来实现量化的新方法－－二维网格编码矢量量化（2D－TCVQ）。该方法首先把小码书扩展成大的虚码书，然后用网格编码矢量量化（TCVQ）的方法在扩大的二维码书空间中用维物比算法来寻找最佳量化路径。码书扩大造成第一子集最小失真减小从提高了量化性能。由于二维TCVQ采用的码书尺寸较小，因而可以应用到低存贮、低功耗的编解码环境。仿真结果表明，同一码书尺寸下，二维TCVQ比TCVQ好0．5dB左右。同时，该方法具有计算量适中，解码简单以及对误差扩散不敏感的优点。     

Interpolative BTC image coding with vector quantization

The authors suggest two interpolative block truncation coding (BTC) image coding schemes with vector quantization and median filters as the interpolator. The first scheme is based on quincunx subsampling and the second one on every-other-row-and-every-other-column subsampling. It is shown that the schemes yield a significant reduction in bit rate at only a small performance degradation and, in general, better channel error resisting capabilities, as compared to the absolute moment BTC. The methods are further demonstrated to outperform the corresponding BTC schemes with pure vector quantization at the same bit rate and require minimal computations for the interpolation     

Hybrid vector quantization for multiresolution image coding

In this correspondence, we propose a coding scheme that exploits the redundancy of the multiresolution representation of images, in that blocks in one subimage are predicted from blocks of the adjacent lower resolution subimage with the same orientation. The pool of blocks used for prediction of a given subband plays the role of a codebook that is built from vectors of coefficients inside the subband decomposition itself. Whenever the prediction procedure does not give satisfactory results with respect to a target quality, the block coefficients are quantized using a geometric vector quantizer for a Laplacian source.     

Hierarchical finite-state vector quantization for image coding

The hierarchical finite-state vector quantization (HFSVQ) introduced in the paper is an improvement of the finite state vector quantization combined with hierarchical multirate image coding. Based on an understanding of the perception of human eye and the structural features of images, the HFSVQ technique employs different coding rates and different numbers of the predictive states for representative vector selection. The bit rate used to encode images is very low while the reconstructed images can still achieve a satisfactory perceptual quality     

Hierarchical multirate vector quantization for image coding

The hierarchical multirate vector quantization (HMVQ) introduced in this paper is an improved form of vector quantization for digital image coding. The HMVQ uses block segmentation and a structure tree to divide an original image into several layers and sub-layers according to their grey scale contrast within blocks of a certain size. Variant bit-rates are used for block coding of different layers with the same codebook. The HMVQ technique provides high encoded image quality with very low bit-rates. The processing time for codebook generation is considerably reduced by using layer by layer optimization and subsampling in low detail regions. This technique also demonstrates flexibility of accurate reproduction in different detail regions.     

Frame-adaptive vector quantization for image sequence coding

An adaptive technique for image sequence coding that is based on vector quantization is described. Each frame in the sequence is first decomposed into a set of vectors. A codebook is generated using the vectors of the first frame as the training sequence, and a label map is created by quantizing the vectors. The vectors of the second frame are then used to generate a new codebook, starting with the first codebook as seeds. The updated codebook is then transmitted. At the same time, the label map is replenished by coding the position and the new values of the labels that have changed from one frame to the other. The process is repeated for subsequent frames. Experimental results for a test sequences demonstrate that the technique can track the changes and maintain a nearly constant distortion over the entire sequence     

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.     

Pyramidal lattice vector quantization for multiscale image coding

Introduces a new image coding scheme using lattice vector quantization. The proposed method involves two steps: biorthogonal wavelet transform of the image, and lattice vector quantization of wavelet coefficients. In order to obtain a compromise between minimum distortion and bit rate, we must truncate and scale the lattice suitably. To meet this goal, we need to know how many lattice points lie within the truncated area. We investigate the case of Laplacian sources where surfaces of equal probability are spheres for the L(1) metric (pyramids) for arbitrary lattices. We give explicit generating functions for the codebook sizes for the most useful lattices like Z(n), D(n), E(s), wedge(16).     

Kronecker-product gain-shape vector quantization for multispectraland hyperspectral image coding

This paper proposes a new vector quantization based (VQ-based) technique for very low bit rate encoding of multispectral images. We rely on the assumption that the shape of a generic spatial block does not change significantly from band to band, as is the case for high spectral-resolution imagery. In such a hypothesis, it is possible to accurately quantize a three-dimensional (3-D) block-composed of homologous two-dimensional (2-D) blocks drawn from several bands-as the Kronecker-product of a spatial-shape codevector and a spectral-gain codevector, with significant computation saving with respect to straight VQ. An even higher complexity reduction is obtained by representing each 3-D block in its minimum-square-error Kronecker-product form and by quantizing the component shape and gain vectors. For the block sizes considered, this encoding strategy is over 100 times more computationally efficient than unconstrained VQ, and over ten times more computationally efficient than direct gain-shape VQ. The proposed technique is obviously suboptimal with respect to VQ, but the huge complexity reduction allows one to use much larger blocks than usual and to better exploit both the statistical and psychovisual redundancy of the image. Numerical experiments show fully satisfactory results whenever the shape-invariance hypothesis turns out to be accurate enough, as in the case of hyperspectral images. In particular, for a given level of complexity and image quality, the compression ratio is up to five times larger than that provided by ordinary VQ, and also larger than that provided by other techniques specifically designed for multispectral image coding.     

Radiographic image sequence coding using two-stage adaptive vector quantization

A two-stage adaptive vector quantization scheme for radiographic image sequence coding is introduced. Each frame in the sequence is first decomposed into a set of vectors, corresponding to nonoverlapping spatially contiguous block of pixels. A codebook is generated using a training set of vectors drawn from the sequence. Each vector is then encoded by the label representing the closest codeword of the codebook, and the label values in a frame label map memory at both ends of the communication channel. The changes occurring in the radiographic image sequences can be categorized into two types: those due to body motion and those due to the injected contrast dye material. In the second scheme proposed, encoding is performed in two stages. In the first stage, the labels of corresponding vectors from consecutive frames are compared and the frame label map memory is replenished (updated). This stage is sufficient to tack the changes caused by patient motions but not due to the injected contrast dye material. The resulting residual error vectors after the first stage coding are calculated for the latter changes and are further encoded by a second codebook, which is updated on a frame-to-frame basis.     

A new image coding algorithm using variable-rate side-matchfinite-state vector quantization

A new side-match vector quantizer, NewSMVQ, is presented in this paper. Three techniques are incorporated to improve the image quality, encoding speed, and bit rate for compressing images. The experimental result shows: i) the encoding time of NewSMVQ is almost 7 times faster than that of SMVQ (ordinary fixed-rate side-match vector quantizer) and CSMVQ (variable-rate SMVQ) and ii) NewSMVQ outperforms SMVQ and CSMVQ in terms of bit rate versus image quality tradeoffs.     

Shape-gain vector quantization for noisy channels with applicationsto image coding

A new design procedure for shape-gain vector quantizers (SGVQs) which leads to substantially improved robustness against channel errors without increasing the computational complexity is proposed. This aim is achieved by including the channel transition probabilities in the design procedure, leading to an improved assignment of binary codewords to the coding regions as well as a change of partition and centroids. In contrast to conventional design, negative gain values are also permitted. The new design procedure is applied to adaptive transform image coding. Simulation results are compared with those obtained by the conventional design procedure. The new algorithm is particularly useful for heavily distorted or fading channels     

基于矢量量化压缩编码的数字水印

提出一种基于矢量量化压缩编码(简称VQ编码)技术的水印策略,在对原图像进行VQ编码后,按码书中码字的相似程度对码字进行划分,根据待嵌入水印图像的大小产生一个随机序列作为密钥,然后根据密钥在压缩数据的特定位置嵌入水印。提出的水印策略,其主要特征在于水印既存在于原图像VQ编码后的压缩数据中,也存在于接收端VQ解码后的图像中。压缩后的数据在数据量上远小于原始数据,所以由它替代原图像携带水印,既节省存储空间,也减小了网络传输时间,特别适用于网络环境下的水印嵌入和提取。更重要的是,这种水印策略具有较好的鲁棒性,能够抵抗诸如裁剪、模糊、JPEG压缩等波形攻击和扭转几何攻击。     

Block transform image coding by multistage vector quantization withoptimal bit allocation

A multistage vector quantization with optimal bit allocation (MVQ-OBA) in the transform domain is presented. A set of bit allocation planes is first obtained by slicing a (scalar) optimal bit allocation map where the number of bits assigned to each coefficient is proportional to the coefficient variance. The set of bit allocation planes determines the coefficients to be used and the codebook size at each stage. The vector dimensionalities are restricted to small values and relatively small codebooks are used, thus reducing both the overhead required for transmitting the codebooks and the complexity in codebook design. The computer simulation results demonstrate that MVQ-OBA is competitive with many other transform coding techniques including variable length transform coding. MVQ-OBA is well suited for progressive transmission     

METHOD OF VECTOR QUANTIZATION CODING USING RECTANGULAR TRANSFORM FOR IMAGE COMPRESSION

First of all a simple and practical rectangular transform is given,and then thevector quantization technique which is rapidly developing recently is introduced.We combinethe rectangular transform with vector quantization technique for image data compression.Thecombination cuts down the dimensions of vector coding.The size of the codebook can reasonablybe reduced.This method can reduce the computation complexity and pick up the vector codingprocess.Experiments using image processing system show that this method is very effective inthe field of image data compression.     

Geometric source coding and vector quantization

A geometric formulation is presented for source coding and vector quantizer design. Motivated by the asymptotic equipartition principle, the authors consider two broad classes of source codes and vector quantizers: elliptical codes and quantizers based on the Gaussian density function, and pyramid codes and quantizers based on the Laplacian density function. Elliptical and weighted pyramid vector quantizers are developed by selecting codewords as points in a lattice that lie on (or near) a specified ellipse or pyramid. The combination of geometric structure and lattice basis allows simple encoding and decoding algorithms     

A virtual image cryptosystem based upon vector quantization

We propose a new image cryptosystem to protect image data. It encrypts the original image into another virtual image. Since both original and virtual images are significant, our new cryptosystem can confuse illegal users. Besides the camouflage, this new cryptosystem has three other benefits. First, our cryptosystem is secure even if the illegal users know that our virtual image is a camouflage. Second, this cryptosystem can compress image data. Finally, our method is more efficient than a method that encrypts the entire image directly.     

Wavelet image coding using variable blocksize vector quantization with optimal quadtree segmentation

In this paper, we propose an image coding scheme by using the variable blocksize vector quantization (VBVQ) to compress wavelet coefficients of an image. The scheme is capable of finding an optimal quadtree segmentation of wavelet coefficients of an image for VBVQ subject to a given bit budget, such that the total distortion of quantized wavelet coefficients is minimal. From our simulation results, we can see that our proposed coding scheme has higher performance in PSNR than other wavelet/VQ or subband/VQ coding schemes.     

Finite-state vector quantization by exploiting interband andintraband correlations for subband image coding

Subband coding (SBC) with vector quantization (VQ) has been shown to be an effective method for coding images at low bit rates. We split the image spectrum into seven nonuniform subbands. Threshold vector quantization (TVQ) and finite state vector quantization (FSVQ) methods are employed in coding the subband images by exploiting interband and intraband correlations. Our new SBC-FSVQ schemes have the advantages of the subband-VQ scheme while reducing the bit rate and improving the image quality. Experimental results are given and comparisons are made using our new scheme and some other coding techniques. In the experiments, it is found that SBC-FSVQ schemes achieve the best peak signal-to-noise ratio (PSNR) performance when compared to other methods at the same bit rate.     

一种基于小波变换和矢量量化的图像压缩算法

小波变换和矢量量化都是图像压缩中的重要方法。利用小波变换的系数特点,对图像进行小渡分解,对于能量最为集中的低频分量采用标量量化处理,然后将标量量化过程中产生的残差和高频分量一起构造矢量,进行矢量量化。实验结果表明,此算法能够有效提高重构图像质量,获得较高的信噪比。