Subband image coding using entropy-coded quantization over noisychannels

Under the assumption of noiseless transmission the authors develop two entropy-coded subband image coding schemes. The difference between these schemes is the procedure used for encoding the lowest frequency subband: predictive coding is used in one system and transform coding in the other. After demonstrating the unacceptable sensitivity of these schemes to transmission noise, the authors also develop a combined source/channel coding scheme in which rate-compatible convolutional codes are used to provide protection against channel noise. A packetization scheme to prevent infinite error propagation is used and an algorithm for optimal assignment of bits between the source and channel encoders of different subbands is developed. It is shown that, in the presence of channel noise, these channel-optimized schemes offer dramatic performance improvements     

Subband coding of images using asymmetrical filter banks

We address the problem of the choice of subband filters in the context of image coding. The ringing effects that occur in subband-based compression schemes are the major unpleasant distortions. A new set of two-band filter banks suitable for image coding applications is presented. The basic properties of these filters are linear phase, perfect reconstruction, asymmetric length, and maximum regularity. The better overall performances compared to the classical QMF subband filters are explained. The asymmetry of the filter lengths results in a better compaction of the energy, especially in the highpass subbands. Moreover, the quantization error is reduced due to the short lowpass synthesis filter. The undesirable ringing effect is considerably reduced due to the good step response of the synthesis lowpass filter. The proposed design takes into account the statistics of natural images and the effect of quantization errors in the reconstructed images, which explains the better coding performance.     

Video coding scheme using DCT-pyramid vector quantization

A new and effective video coding scheme for contribution quality is proposed. The CMTT/2, a joint committee of CCIR and CCITT, has proposed a video coding scheme (already approved at European level by ETS) working at 34-45 Mbit/s. Basically this proposal includes a DCT transform for spatial correlation removal and motion compensation for temporal correlation removal. The individual transform coefficients are then scalar quantized with a non uniform bit assignment. Starting from the CMTT/2 proposal, the study presents a new video coding scheme designed using a vector quantizer solution instead of the scalar one. Specifically, the pyramid vector quantization (PVQ) has been chosen as the vector quantization method as it is able to reduce the DCT coefficients Laplacian distribution. Simulation results show that the proposed video coding scheme gives the same contribution quality at 22 Mbit/s as the one obtained with the CMTT/2 proposal at 45 Mbit/s.     

Image coding using entropy-constrained residual vector quantization

An entropy-constrained residual vector quantization design algorithm is used to design codebooks for image coding. Entropy-constrained residual vector quantization has several important advantages. It can outperform entropy-constrained vector quantization in terms of rate-distortion performance, memory, and computation requirements. It can also be used to design vector quantizers with relatively large vector sizes and high output rates. Experimental results indicate that good image reproduction quality can be achieved at relatively low bit rates. For example, a peak signal-to-noise ratio of 30.09 dB is obtained for the 512x512 LENA image at a bit rate of 0.145 b/p.     

Image coding using vector quantization: a review

A review of vector quantization techniques used for encoding digital images is presented. First, the concept of vector quantization is introduced, then its application to digital images is explained. Spatial, predictive, transform, hybrid, binary, and subband vector quantizers are reviewed. The emphasis is on the usefulness of the vector quantization when it is combined with conventional image coding techniques, or when it is used in different domains     

Comments on “Subband coding of images using asymmetricalfilterbanks”

In the above paper Egger and Li (see ibid., vol.4, p.478-85, Apr. 1995) presented a set of two-channel filterbanks, asymmetrical filterbanks (AFB's), for image coding applications. The basic properties of these filters are linear-phase, perfect reconstruction, asymmetric lengths for dual filters, and maximum regularity. In this correspondence, we point out that the proposed AFB's are not new in the sense that the proposed construction is equivalent to the factorization of Lagrange halfband filters, which has been reported by other researchers. In addition, we correct an error in the formulation of constructing AFBs in their paper.     

Three-dimensional wavelet transform video coding using symmetriccodebook vector quantization

A new vector quantizer codebook design for video compression is described. This uses the notion that symmetries in the data, which are seldom captured exactly in any training dataset, are important perceptually and lead to a more robust codebook. The method is illustrated using three-dimensional (3-D) wavelet transformed video sequences.     

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.     

Feature-specific vector quantization of images

A new interband vector quantization of a human vision-based image representation is presented. The feature specific vector quantizer (FVQ) is suited for data compression beyond second-order decorrelation. The scheme is derived from statistical investigations of natural images and the processing principles of biological vision systems, the initial stage of the coding algorithm is a hierarchical, and orientation-selective, analytic bandpass decomposition, realized by even- and odd-symmetric filter pairs that are modeled after the simple cells of the visual cortex. The outputs of each even- and odd-symmetric filter pair are interpreted as real and imaginary parts of an analytic bandpass signal, which is transformed into a local amplitude and a local phase component according to the operation of cortical complex cells. Feature-specific multidimensional vector quantization is realized by combining the amplitude/phase samples of all orientation filters of one resolution layer. The resulting vectors are suited for a classification of the local image features with respect to their intrinsic dimensionality, and enable the exploitation of higher order statistical dependencies between the subbands. This final step is closely related to the operation of cortical hypercomplex or end-stopped cells. The codebook design is based on statistical as well as psychophysical and neurophysiological considerations, and avoids the common shortcomings of perceptually implausible mathematical error criteria. The resulting perceptual quality of compressed images is superior to that obtained with standard vector quantizers of comparable complexity.     

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.     

Finite-state vector quantization for waveform coding

A finite-state vector quantizer is a finite-state machine used for data compression: Each successive source vector is encoded into a codeword using a minimum distortion rule, and into a code book, depending on the encoder state. The current state and the selected codeword then determine the next encoder state. A finite-state vector quantizer is capable of making better use of the memory in a source than is an ordinary memoryless vector quantizer of the same dimension or blocklength. Design techniques are introduced for finite-state vector quantizers that combine ad hoc algorithms with an algorithm for the design of memoryless vector quantizers. Finite-state vector quantizers are designed and simulated for Gauss-Markov sources and sampled speech data, and the resulting performance and storage requirements are compared with ordinary memoryless vector quantization.     

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.     

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     

Motion vector quantization for video coding

A new algorithm is developed for the vector quantization of motion vectors. This algorithm, called motion vector quantization (MVQ), simultaneously estimates and vector quantizes the motion vectors by reinterpreting the block matching algorithm as a type of vector quantization. An iterative design algorithm, based on this concept, is developed. In addition to reducing rate for fixed length encoding, the algorithm also reduces the computation considerably. We include coding simulation results on the Flower Garden sequence.     

Subband domain coding of binary textual images for documentarchiving

In this work, a subband domain textual image compression method is developed. The document image is first decomposed into subimages using binary subband decompositions. Next, the character locations in the subbands and the symbol library consisting of the character images are encoded. The method is suitable for keyword search in the compressed data. It is observed that very high compression ratios are obtained with this method. Simulation studies are presented.     

Interpolative vector quantization of color images

Interpolative vector quantization has been devised to alleviate the visible block structure of coded images plus the sensitive codebook problems produced by a simple vector quantizer. In addition, the problem of selecting color components for color picture vector quantization is discussed. Computer simulations demonstrate the success of this coding technique for color image compression at approximately 0.3 b/pel. Some background information on vector quantization is provided     

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.     

基于矢量量化的层次分形编码方法

文中提出了一种新的分形图像压缩方法,该方法将矢量量化的概念应用于分形块编码中,对图像的平缓区进行矢量量化的线性组合编码,对图像的丰富细节区用分形编码,并且在分形编码时,采取了层次处理。实验表明,与基本的分形块编码方法相比,本文提出的矢量量化层次分形编码方法在保证一定的重建图像质量下,使图像的压缩比有了明显的提高,并且大大提高了编码和解码速度。