Block sorting is an innovative compression mechanism introduced in by M. Burrows and D.J. Wheeler (1994). It involves three steps: permuting the input one block at a time through the use of the Burrows-Wheeler transfo...
详细信息
ISBN:
(纸本)0769509630
Block sorting is an innovative compression mechanism introduced in by M. Burrows and D.J. Wheeler (1994). It involves three steps: permuting the input one block at a time through the use of the Burrows-Wheeler transform (BWT); applying a move-to-front (MTF) transform to each of the permuted blocks; and then entropy coding the output with a Huffman or arithmetic coder. Until now, block-sorting implementations have assumed that the input message is a sequence of characters. In this paper, we extend the block-sorting mechanism to word-based models. We also consider other transformations as an alternative to MTF, and are able to show improved compression results compared to MTF. For large text files, the combination of word-based modelling, BWT and MTF-like transformations allows excellent compression effectiveness to be attained within reasonable resource costs.
Constantinescu and Storer (1994) introduced an adaptive single-pass vector quantization algorithm (AVQ) that employs variable size and shaped codebook entries that are "learned" as an image is processed (no ...
详细信息
ISBN:
(纸本)0769510310
Constantinescu and Storer (1994) introduced an adaptive single-pass vector quantization algorithm (AVQ) that employs variable size and shaped codebook entries that are "learned" as an image is processed (no specific training or prior knowledge of the data is used). The approach allows the tradeoff between compression and fidelity to be continuously adjusted from lossless (with less compression) to highly lossy (with greater compression). Although practical performance compares favorably with the JPEG standard as well as standard trained vector quantization implementations, analysis of its performance appears difficult. A key aspect of AVQ is that matches are allowed to overlap, and it is not necessary to perform some sort of bin packing in order to cover the image with variable size and shape matches. Here we show that the AVQ approach is in some sense optimal asymptotically, module the overlapping factor which is defined to be the average number of times that a pixel is covered. We also present experiments that study the relationship of overlapping to performance.
The turbo principle has been widely applied to various detection/decoding problems in recent years. Here we show how the general idea can be extended to a communication scheme where a variable length code is used for ...
详细信息
The turbo principle has been widely applied to various detection/decoding problems in recent years. Here we show how the general idea can be extended to a communication scheme where a variable length code is used for data compression followed by a channel code to protect the data against channel errors. Iterations are performed between the channel decoder and the decoder for the variable length source code. Since the exchange of extrinsic information is essential for the performance of turbo decoding schemes we describe how EXIT-charts can be applied to predict the performance of the iterative source-channel decoding approach.
We present an efficient fine granular scalable video compression scheme which supports a fast bit rate adaptation independent of the encoder. The proposed scheme generates an embedded bitstream for each frame or, by a...
详细信息
We present an efficient fine granular scalable video compression scheme which supports a fast bit rate adaptation independent of the encoder. The proposed scheme generates an embedded bitstream for each frame or, by appropriate multiplexing, for each group of picture. This rate-scalability is supported by an embedded bitstream which allows decoding at multiple rates, or to be more specific at virtually any rate. Drift removing techniques based on intra refresh or feedback mechanisms are presented. We show the potential of this video codec for variable bit rate channels as well as in combination with an unequal erasure protection scheme for error robust and efficient transmission over packet erasure channels. Possible enhancements of the presented coding schemes are discussed.
With the increasing use of multimedia techniques, image compression requires higher performance as well as new features. Image coding standards, including some newly developed ones (MPEG-4 VTC, JPEG2000), are reviewed...
详细信息
With the increasing use of multimedia techniques, image compression requires higher performance as well as new features. Image coding standards, including some newly developed ones (MPEG-4 VTC, JPEG2000), are reviewed. A comparative analysis of their performances and functionalities is also given. The results show that the choice of the best standard depends strongly on the application at hand, but that JPEG2000 supports the widest set of features among the evaluated standards, while providing superior rate-distortion performance in most cases.
A lossless image compression algorithm using the integer wavelet transform is proposed in this paper. The S+P wavelet transform is compared with the various integer coefficient filter banks (ICFB), and the 9/7 ICFB is...
详细信息
A lossless image compression algorithm using the integer wavelet transform is proposed in this paper. The S+P wavelet transform is compared with the various integer coefficient filter banks (ICFB), and the 9/7 ICFB is applied to the wavelet transform. The compression ratios of the proposed algorithm are compared with those of the S+P transform for several different types of images.
A new entropy coding scheme for video compression is presented. Context models are utilized for efficient prediction of the coding symbols. A novel binary adaptive arithmetic coding technique is employed to match the ...
详细信息
A new entropy coding scheme for video compression is presented. Context models are utilized for efficient prediction of the coding symbols. A novel binary adaptive arithmetic coding technique is employed to match the conditional entropy of the coding symbols given the context model estimates. The adaptation is also employed to keep track of non-stationary symbol statistics. Our new approach has been integrated into the current ITU-T H.26L test model (TML) to demonstrate the performance gain. By using our new entropy coding scheme instead of the variable length code approach of the current TML, large bit-rate savings up to 32% can be achieved. As a remarkable outcome of our experiments, we observed that high gains are reached not only at high bit-rates, but also at very low rates.
We propose the application of a new transform-based coding method in conjunction with Golomb-Rice (G-R) codes to lower significantly the complexity, which can be used in various applications, e.g. the multiple descrip...
详细信息
We propose the application of a new transform-based coding method in conjunction with Golomb-Rice (G-R) codes to lower significantly the complexity, which can be used in various applications, e.g. the multiple description coding. The theoretical evaluations predict no important loss in compression performance, while the complexity is considerably reduced. Since GR codes are very fast and well suited for exponentially decaying distributions, they were implemented during the last decade in image and audio compressors. In all these schemes, the selection of the code parameter is performed presuming Laplacian distribution of prediction errors. We derive the selection method for the GR code parameter also for the case of Gaussian inputs.
Discrete wavelet transforms are widely used for lossless image compression, The overall performance of these schemes may be further improved by properly designing efficient entropy coders. A novel technique for the im...
详细信息
ISBN:
(纸本)0780366859
Discrete wavelet transforms are widely used for lossless image compression, The overall performance of these schemes may be further improved by properly designing efficient entropy coders. A novel technique for the implementation of context-based adaptive arithmetic entropy coding is presented in this paper. This technique is based on the prediction of the value of the current transform coefficient, employing a weighted least squares method, in order to achieve appropriate context selection for arithmetic coding. Experimental results illustrate and evaluate the performance of the proposed technique.
暂无评论