This paper describes a new set of block source codes well suited for data compression. These codes are defined by sets of productions rules of the form allowbar rarr blowbar where a isin A represents a value from the ...
详细信息
This paper describes a new set of block source codes well suited for data compression. These codes are defined by sets of productions rules of the form allowbar rarr blowbar where a isin A represents a value from the source alphabet A and llowbar, blowbar are small sequences of bits. These codes naturally encompass other variable length codes (VLCs) such as Huffman codes. It is shown that these codes may have a similar or even a shorter mean description length than Huffman codes for the same encoding and decoding complexity. A first code design method allowing to preserve the lexicographic order in the bit domain is described. The corresponding codes have the same mean description length (mdl) as Huffman codes from which they are constructed. Therefore, they outperform from a compression point of view the Hu-Tucker codes designed to offer the lexicographic property in the bit domain. A second construction method allows to obtain codes such that the marginal bit probability converges to 0.5 as the sequence length increases and this is achieved even if the probability distribution function is not known by the encoder
The most recent video compression technology is High Efficiency Video coding (HEVC). This soon to be completed standard is a joint development by Video coding Experts Group (VCEG) of ITU-T and Moving Picture Experts G...
详细信息
ISBN:
(纸本)9780819492166
The most recent video compression technology is High Efficiency Video coding (HEVC). This soon to be completed standard is a joint development by Video coding Experts Group (VCEG) of ITU-T and Moving Picture Experts Group (MPEG) of ISO/IEC. As one of its major technical novelties, HEVC supports variable prediction and transform block sizes using the quadtree approach for block partitioning. In terms of entropy coding, the Draft International Standard (DIS) of HEVC specifies context-based adaptive binary arithmetic coding (CABAC) as the single mode of operation. In this paper, a description of the specific CABAC-based entropy coding part in HEVC is given that is related to block structures and transform coefficient levels. In addition, experimental results are presented that indicate the benefit of the transform-coefficient level coding design in HEVC in terms of improved coding performance and reduced complexity.
entropy coding based on k-th order Exp-Golomb (EGk) codes is a key part in the new AVS video coding standard issued by Audio Video coding Standard Workgroup of China. An efficient design based on code-value compact me...
详细信息
entropy coding based on k-th order Exp-Golomb (EGk) codes is a key part in the new AVS video coding standard issued by Audio Video coding Standard Workgroup of China. An efficient design based on code-value compact memory structure(CVCMS) is proposed to reduce the computational complexity and memory *** 789 byte memory is required for variable length coding(VLC) tables in CVCMS, which is just about 5.92%compared with that of the reference ***,code-value is stored in memory,which reduced the computational complexity of EGk *** simulation results show that the proposed entropy coding for AVS video coding standard reduces the computational cost by 26.48%.
The aim of this paper is to explore yet another variant of the Delta-Modulation coding structure to improve data transmission efficiency in the context of Networked Controlled Systems. High compression rates can only ...
详细信息
The aim of this paper is to explore yet another variant of the Delta-Modulation coding structure to improve data transmission efficiency in the context of Networked Controlled Systems. High compression rates can only be reached by the use of entropy coding. entropy coding assigns some probability distribution to the events. In that way, the mean code length can be improved. The paper studies several issues resulting from this type of coding design and assets the stability properties needed for this type of coding to operate properly.
A method for optimizing a multiple entropy coder system for coding of a memoryless mixture distribution is studied. The coding scheme is based on splitting the composite source into a finite number of subsources, foll...
详细信息
A method for optimizing a multiple entropy coder system for coding of a memoryless mixture distribution is studied. The coding scheme is based on splitting the composite source into a finite number of subsources, followed by entropy coding of each subsource. A rate distortion optimal splitting scheme is found assuming an infinite Gaussian mixture distribution and one common infinite-level uniform threshold quantizer for all samples. Theoretical results quantifying the rate distortion performance for a Gaussian mixture distribution with an exponential mixing density are found for 1 to 5 entropy coders, and compared to the rate distortion function. At a signal-to-noise ratio of 30 dB the average entropy is reduced by 0.270 bits per sample, when using 5 entropy coders compared to coding of the composite source.
entropy encoding and decoding is a crucial part of any multimedia system that can be highly demanding in terms of computing power. Hardware implementation of typical compression and decompression algorithms is cumbers...
详细信息
entropy encoding and decoding is a crucial part of any multimedia system that can be highly demanding in terms of computing power. Hardware implementation of typical compression and decompression algorithms is cumbersome, while conventional software implementations are slow due to bit-level operations, data dependencies and conditional branching. Several solutions have been proposed along the years, ranging from hardware accelerators for high-end systems to careful implementations in VLIW processors and instruction-set extensions, both hardwired and reconfigurable. Multimedia systems must often implement several encoders and decoders for different formats. Hence, a programmable solution is mandatory. However, programmable processors may be challenged by highly-complex algorithms. In this work, a highly efficient and low cost alternative is presented based on an array processor. The dataflow of several entropy coding algorithms has been studied, leading to the choice of an efficient programming model, processor layout and interconnection system. Results are presented for JPEG and H.264 image and video coding standards.
We present a novel approach to entropy coding, which provides the coding efficiency and simple probability modeling capability of arithmetic coding at the complexity level of Huffman coding. The key element of the pro...
详细信息
We present a novel approach to entropy coding, which provides the coding efficiency and simple probability modeling capability of arithmetic coding at the complexity level of Huffman coding. The key element of the proposed approach is a partitioning of the unit interval into a small set of probability intervals. An input sequence of discrete source symbols is mapped to a sequence of binary symbols and each of the binary symbols is assigned to one of the probability intervals. The binary symbols that are assigned to a particular probability interval are coded at a fixed probability using a simple code that maps a variable number of binary symbols to variable length codewords. The probability modeling is decoupled from the actual binary entropy coding. The coding efficiency of the probability interval partitioning entropy (PIPE) coding is comparable to that of arithmetic coding.
Block sizes of practical vector quantization (VQ) image coders are not large enough to exploit all high-order statistical dependencies among pixels. Therefore, adaptive entropy coding of VQ indexes via statistical con...
详细信息
Block sizes of practical vector quantization (VQ) image coders are not large enough to exploit all high-order statistical dependencies among pixels. Therefore, adaptive entropy coding of VQ indexes via statistical context modeling can significantly reduce the bit rate of VQ coders for given distortion, Address VQ was a pioneer work in this direction. In this paper we develop a framework of conditional entropy coding of VQ indexes (CECOVI) based on a simple Bayesian-type method of estimating probabilities conditioned on causal contexts. CECOVI is conceptually cleaner and algorithmically more efficient than address VQ, with address-VQ technique being its special case, It reduces the bit rate of address VQ by more than 20% for the same distortion, and does so at only a tiny fraction of address VQ's computational cost.
In the skew-coordinates DCT coding method, an image is partitioned along the edge into variably shaped blocks and coded using the skew-coordinates DCT adopted to the edge direction. Compared with the conventional squa...
详细信息
In the skew-coordinates DCT coding method, an image is partitioned along the edge into variably shaped blocks and coded using the skew-coordinates DCT adopted to the edge direction. Compared with the conventional square block DCT, it is known that the skew-coordinates DCT can improve power packing efficiency and can reduce mosquito noise in the reconstructed image. In this paper, the entropy coding method of the skew-coordinates DCT is studied in order to improve the compression ratio. As an entropy coding method, we adopt an adaptive code allocation method based on the Gaussian mixture distribution model and study the construction of the mixture model. Statistical characteristics of the DCT coefficients in real images are investigated and it is shown that the warping effect of the skew-coordinates DCT can reduce the local variation of the variance distribution of the DCT coefficients and that, consequently, a simple mean-power model is suitable as the mixture model. Finally, the result of a computer simulation experiment shows that the proposed method is useful in improving coding performance. (C) 2001 Scripta Technica.
This paper addresses issues on coding design in the context of control of systems equipped with low-energy sensors networks We particularly focus on issues concerning bit and energy-aware coding, To this ann. we devis...
详细信息
This paper addresses issues on coding design in the context of control of systems equipped with low-energy sensors networks We particularly focus on issues concerning bit and energy-aware coding, To this ann. we devise it coding strategy with the ability to quantify and to differentiate stand-still signal events from changes in the source (level crossing detector). coding is effectuated by defining at least 3-valued alphabet for the minimum bit case and (2L + 1)-valued alphabet for a general case with I precision depending on L. Energy saves are studied in two different scenarios: (1) in the word-by-word transmission cased the Stand-still signal event is modulated with it low-power transmission mechanisms. whereas the chances of levels will be modulated with high power and (2) in the package-based transmission case, an entropy variable length coding is added to file previous encoding process. entropy coding assigns sonic probability distribution to the events. so that the mean transmission energy can be substantially improved for systems where the stand-still events have higher probability to arise (i.e. stable systems) The paper studies the stability properties needed for this type of coding to operate properly and quantify the energy saves for each of the considered scenarios. Copyright (C) 2009 John Wiley & Sons. Ltd
暂无评论