Lattice vector quantization has recently attracted some interest as an alternative to full-search VQ for signal and image coding problems. It is considerably more computationally efficient, and it avoids the difficult...
详细信息
Lattice vector quantization has recently attracted some interest as an alternative to full-search VQ for signal and image coding problems. It is considerably more computationally efficient, and it avoids the difficult codebook design problem. Furthermore, it has been noted that the optimal high bit rate entropy constrained vector quantizer will approximate a lattice. Indeed for lattice VQ to be competitive, the quantized vectors should be entropy coded. This has traditionally been performed on a per image basis, a complex and inefficient process. We propose a general image-independent coding scheme which we apply to the coding of lattice quantized wavelet coefficient vectors. We also demonstrate that the quantizing and coding complexity can be reduced through reducing the dimension of the wavelet vectors by means of principal components analysis and a perceptually based nonlinearity.< >
This paper describes the visual texture compression scheme adopted for MPEG-4 international standard. The scheme is based on the concept of multiscale zerotree wavelet entropy coding (MZTE) technique that provides dif...
详细信息
This paper describes the visual texture compression scheme adopted for MPEG-4 international standard. The scheme is based on the concept of multiscale zerotree wavelet entropy coding (MZTE) technique that provides different levels of scalability layer in terms of either spatial resolutions or picture quality. MZTE provides much improved compression efficiency and fine-gradual scalabilities. The MZTE scheme is adopted as the baseline technique for the visual texture coding profile in both MPEG4 video group and SNHC group.
This contribution presents a basic structure of video compression coder based on Three Dimensional Discrete Cosine Transform (3D DCT). Mainly, this paper deals with a optimal method of forming the 3D DCT frequency coe...
详细信息
ISBN:
(纸本)1424408210
This contribution presents a basic structure of video compression coder based on Three Dimensional Discrete Cosine Transform (3D DCT). Mainly, this paper deals with a optimal method of forming the 3D DCT frequency coefficients into output bit stream. It is well known the number of non zero frequency coefficients depends on the video sequence character. The sequence with a slow motion evokes a low number of coefficients and vice versa the dynamic sequence produces a high number of frequency coefficients, thus the compress ratio of an encoded sequence tends to be low. It could be proved the compress properties of 3D DCT encoder do not depends only on scene character but can be improved by the entropy coder and by the way how the coefficients are scanned. The scanning order optimized for the 3D DCT and a content of the dictionary for Huffman coder is proposed in this paper.
Summary form only given. A new LSP speech parameter compression scheme is proposed which uses conditional probability information through classification. For efficient compression of speech LSP parameter vectors it is...
详细信息
Summary form only given. A new LSP speech parameter compression scheme is proposed which uses conditional probability information through classification. For efficient compression of speech LSP parameter vectors it is essential that higher order correlations are exploited. The use of conditional probability information has been hindered by high complexity of the information. For example, a LSP vector has 34 bit representation at 4.8 K bps CELP coding (FS1016 standard). It is impractical to use the first order probability information directly since 2/sup 34//spl ap/1.7/spl times/10/sup 10/ number of probability tables would be required and training of such information would be practically impossible. In order to reduce the complexity, we reduce the input alphabet size by classifying the LSP vectors according to their phonetic relevance. In other words, speech LSP parameters are classified into groups representing loosely defined various phonemes. The number of phoneme groups used was 32 considering the ambiguity of similar phonemes and background noises. Then conditional probability tables are constructed for each class by training. In order to further reduce the complexity, split-VQ has been employed. The classification is achieved through vector quantization with a mean squared distortion measure in the LSP domain.
The recently developed incremental-tree extension technique is used to design the conditional tree for high-order conditional entropy coding. In order to reduce its complexity, the authors introduce two techniques: co...
详细信息
The recently developed incremental-tree extension technique is used to design the conditional tree for high-order conditional entropy coding. In order to reduce its complexity, the authors introduce two techniques: code table reduction and nonlinear quantization of conditioning pixels. These two techniques substantially reduce the number of code tables, the number of conditioning pixel address-bits, and the number of states with only a minor penalty in performance. The authors also propose a suboptimal method to determine the pixel sequence of the conditioning states. Using these techniques, the high-order conditional entropy coding of images becomes practical and has shown significant improvement over the conventional runlength/variable-length coding scheme.< >
Efficient low-complexity block entropy coding requires careful exploitation of specific data characteristics to circumvent the practical difficulties associated with large alphabets. Two recent image coding methods, a...
详细信息
Efficient low-complexity block entropy coding requires careful exploitation of specific data characteristics to circumvent the practical difficulties associated with large alphabets. Two recent image coding methods, alphabet and group partitioning (AGP) and set partitioning in hierarchical trees (SPIHT) can be viewed as block entropy coding methods, which are successful because of the manner in which they partition the alphabet into sets and encode these sets very efficiently. Here we present analysis and numerical results to show that AGP and SPIHT are indeed efficient block entropy coders.
Existing video encoders, such as MPEG4, H.263 and H.264, adopt variable length coding (VLC) as entropy coding method, focusing on residue data coding. In low bit-rate video coding, larger quantization parameters are u...
详细信息
Existing video encoders, such as MPEG4, H.263 and H.264, adopt variable length coding (VLC) as entropy coding method, focusing on residue data coding. In low bit-rate video coding, larger quantization parameters are used to give a smaller number of bits spent on residue data. As a result, the header overhead is a dominant factor of yielding the overall bit rates. In this paper, macro-block (MB) header behavior is investigated. It is found that the relative percentage of the number of bits of MB header increases with quantization parameter (QP) and header correlation between neighboring MBs is high. Based on these MB header properties, we propose an advanced coding algorithm for entropy coding of MB header. The experimental results suggest that our proposed algorithm achieves lower total number of encoded bits over JM10.2, up to 10% bit reduction, with the same PSNR quality. At the same bit rates, our algorithm has about 0.3-0.4 dB PSNR gain.
3D mesh compression has been studies for compact storage and fast transmission of large 3D meshes for a variety of graphics applications. However, there is still much redundancy not well exploited by the previous work...
详细信息
3D mesh compression has been studies for compact storage and fast transmission of large 3D meshes for a variety of graphics applications. However, there is still much redundancy not well exploited by the previous works, e.g., the redundancy lying in the floating-point data texture coordinates. This paper investigates the statistical property of texture coordinates of a couple of 3D models and proposes a new entropy coding method to compress the floating-point texture coordinates of 3D mesh. It uses some reference buffers and proposes an updating scheme as well as a context based arithmetic coding algorithm. Experiments show that the proposed method can averagely reduce about 40% of bitrate compared with the state-of-art prior work.
Fractal compression is a lossy compression method for digital images based on fractals rather than pixels, which are best suited for textures and natural images. It works on self- similarity property in various fracti...
详细信息
ISBN:
(纸本)9781467385121
Fractal compression is a lossy compression method for digital images based on fractals rather than pixels, which are best suited for textures and natural images. It works on self- similarity property in various fractions of images, relying on the fact that parts of an image often resemble other parts of the same image. It takes long encoding time and affects the image quality. This paper introduces an improved model integrating quantized quad trees and entropy coding used for fractal image compression. Quantized quad tree method divides the quantized original gray level image into various blocks depending on a threshold value besides the properties of the features presented in image. entropy coding is applied for improving the compression quality. Simulation results show that the quantized quad trees and entropy coding improved compression ratios and quality derived from the fractal image compression with range block and iterations technique. Different quantitative measures can be found by passing images of different format and dimensions.
The three main pillars for lossless image compression are prediction, prediction residual correction and entropy coding. In this work, we propose a lossless image compression algorithm which utilizes local information...
详细信息
The three main pillars for lossless image compression are prediction, prediction residual correction and entropy coding. In this work, we propose a lossless image compression algorithm which utilizes local information to dynamically switch between different prediction techniques. Moreover, we improve on traditional prediction techniques and modify them into diagonal GAP and dynamic window weighted linear prediction. Finally, since the coding efficiency is directly proportional to the context being chosen if context arithmetic coding is applied, we propose a robust context model which utilizes local information to get better coding efficiency.
暂无评论