This paper introduces zerotree entropy (ZTE) coding for wavelet transform coefficients of video I-frames and motion-compensated video residuals. ZTE coding is based on but differs significantly from the embedded zerot...
详细信息
This paper introduces zerotree entropy (ZTE) coding for wavelet transform coefficients of video I-frames and motion-compensated video residuals. ZTE coding is based on but differs significantly from the embedded zerotree wavelet (EZW) algorithm. As in EZW, the new ZTE coding algorithm exploits the self-similarity inherent in the wavelet transform to predict the location of information across wavelet scales. The new ZTE coder does not produce an embedded bitstream as EZW does, but by sacrificing the embedding property, ZTE achieves substantial improvement in coding efficiency and provides greater flexibility and other advantages over EZW.
To keep cost low, most of the commercial color camera products for PC video conferencing employ a single CCD or CMOS imager. Usually, a mosaic color filter array is applied to the CCD or CMOS focal plane array image s...
详细信息
ISBN:
(纸本)0819431249
To keep cost low, most of the commercial color camera products for PC video conferencing employ a single CCD or CMOS imager. Usually, a mosaic color filter array is applied to the CCD or CMOS focal plane array image sen!;or in order to extract color information from the image through post-processing. Thus the output data of each color component is interlaced in every output line from the imager. This paper proposes a new scan-line based image compression technique for PC video conferencing. It takes the advantages of PC's advanced computation power and provides end users the capability of performing image decompression and color interpolation on demand. Without doing any color interpolation before image compression, piecewise linear compression is performed on raw line data. It generates a single control point set for all color components of the same line and packs the control points into a compact format so that a small lookup table for variable-length Huffman encoding can be applied. The simplicity of piecewise-linear approximation and variable-length encoding leads to low-cost ASIC implementation and fast speed image compression solution with improved compression ratio, better color fidelity, and capability to implement decoding in parallel processing.
Information theory indicates that the coding efficiency can be improved by utilizing high-order entropy coding (HOEC). However, serious implementation difficulties limit the practical value of HOEC for grayscale image...
详细信息
Information theory indicates that the coding efficiency can be improved by utilizing high-order entropy coding (HOEC). However, serious implementation difficulties limit the practical value of HOEC for grayscale image compression. We present a new approach, called binary-decomposed (BD) high-order entropy coding, that significantly reduces the complexity of the implementation and increases the accuracy in estimating the statistical model. In this approach a grayscale image is first decomposed into a group of binary sub-images, each corresponding to one of the gray levels. When HOEC is applied to these sub-images instead of the original image, the subsequent coding is made simpler and more accurate statistically.
This paper presents an efficient noiseless encoding scheme for a balanced/unbalanced tree structured vector quantization (TSVQ) system utilizing high order statistics of TSVQ indices. The proposed encoding scheme incl...
详细信息
ISBN:
(纸本)0780337026
This paper presents an efficient noiseless encoding scheme for a balanced/unbalanced tree structured vector quantization (TSVQ) system utilizing high order statistics of TSVQ indices. The proposed encoding scheme includes a reduction method of both the number of conditioning states and the size of entropy table at each encoder state. In addition, to effectively manage a given amount of memory resource, the memory constrained encoding problem is examined. Simulation results show the proposed scheme brings remarkable bitrate reduction even under a moderate amount of memory.
The lossless entropy coding used in many image coding schemes often is overlooked as most research is based around the lossy stages of image compression. This paper examines the relative merits of using static Huffman...
详细信息
The lossless entropy coding used in many image coding schemes often is overlooked as most research is based around the lossy stages of image compression. This paper examines the relative merits of using static Huffman coding with a compact optimal table verses more sophisticated adaptive arithmetic methods. For very low bit rate image compression, the computationally simple Huffman method is shown to be competitive and often superior to adaptive algorithms. We present a method of efficiently representing an optimal Huffman table using delta coded symbol bit lengths. The decoding of the bitstream can also be accelerated by using table lookup operations.
In this contribution, a perceptually leaseless, model based texture coding method is presented. The model's parameters, consisting of a binary excitation image, the coefficients of an AR filter and the histogram o...
详细信息
In this contribution, a perceptually leaseless, model based texture coding method is presented. The model's parameters, consisting of a binary excitation image, the coefficients of an AR filter and the histogram of the original texture, allow to reconstruct a texture which is perceptually indistinguishable from the original one. The estimated binary excitation is compressed using a binary wavelet transformation specifically tailored to binary images, which allows a fast and lossless coding, followed by an entropy coding applied even to the other parameters. The proposed method leads to very good perceptual results superior to those of existing coders.
An improved self-synchronizing Huffman code is proposed to decrease the error propagation length in the compressed bit stream caused by errors during transmission. After regaining synchronization, the decoder may stil...
详细信息
An improved self-synchronizing Huffman code is proposed to decrease the error propagation length in the compressed bit stream caused by errors during transmission. After regaining synchronization, the decoder may still not be able to align each symbol with its correct location due to the wrong number of previously decoded symbols in the error propagation region. A scheme to identify the probable error location and then move symbols towards their correct positions is also proposed by exploiting the correlation between coefficients of the current subband and their parent subband. Experiments under different error conditions are performed, and it is demonstrated that the proposed error resilient techniques provide a more robust codec with very little sacrifice in the coding efficiency.
Transitions on high capacitance busses result in considerable system power dissipation. Therefore, various coding schemes have been proposed in the literature to encode the input signal in order to reduce the number o...
详细信息
Transitions on high capacitance busses result in considerable system power dissipation. Therefore, various coding schemes have been proposed in the literature to encode the input signal in order to reduce the number of transitions. In this paper, we present: (1) fundamental bounds on the activity reduction capability of any encoding scheme for a given source, and (2) practical novel encoding schemes that approach these bounds. The fundamental bounds in (1) are obtained via an information-theoretic approach where a signal x(n) with entropy rate H is coded with R bits per sample on average. The encoding schemes in (2) are developed via a communication-theoretic approach, whereby a data source is passed through a decorrelating function followed by a variant of entropy coding function which reduces the transition activity. Simulation results with an encoding scheme for data busses indicate an average reduction in transition activity of 36%.
The common conception of transform coding is a a computationally efficient alternative to vector quantization. At high rates, it is not the partitioning itself but the efficiency of the scalar entropy coding which mak...
详细信息
The common conception of transform coding is a a computationally efficient alternative to vector quantization. At high rates, it is not the partitioning itself but the efficiency of the scalar entropy coding which makes transform coding useful. With this view a class of discrete transforms derived from linear transforms are used to pursue three objectives: reducing coefficient entropies (getting coding gain as in conventional transform coding), reducing the complexity of entropy coding (allowing many coefficients to be efficiently coded with identical entropy codes), and having robustness to coefficient erasures.
A non-linear predictive coding based algorithm is proposed for lossless image compression. The algorithm uses two neighbouring pixels, one left and the other top, as a pioneering block to search for the best matched b...
详细信息
A non-linear predictive coding based algorithm is proposed for lossless image compression. The algorithm uses two neighbouring pixels, one left and the other top, as a pioneering block to search for the best matched blocks inside a pre-defined window. The corresponding pixels associated with the best matched blocks are then taken to produce the predictive value, together with the two pioneering pixels. Comparative investigation is carried out by experiments which show clearly that the proposed algorithm outperform JPEG lossless compression mode.
暂无评论