We address the problem of enhancement layer drift estimation for fine granular scalable video. An optimal per-pixel drift estimation algorithm is introduced. The encoder assumes that there is some truncation of the en...
详细信息
We address the problem of enhancement layer drift estimation for fine granular scalable video. An optimal per-pixel drift estimation algorithm is introduced. The encoder assumes that there is some truncation of the enhancement layer, which does not allow the enhancement layer reference to be properly reconstructed, and the encoder recursively estimates the associated drift and chooses coding modes accordingly. The approach yields performance gains of about 1 dB across low to medium rates. In addition, we investigate dual frame prediction, for both base and enhancement layer, with pulsed-quality allocation in the base layer.
The run-length coding and the morphological representation are two classical schemes for wavelet image coding. The run-length coders have the advantage of simplicity by recording the lengths of zero-runs between signi...
详细信息
The run-length coding and the morphological representation are two classical schemes for wavelet image coding. The run-length coders have the advantage of simplicity by recording the lengths of zero-runs between significant wavelet coefficients but at the expense of yielding an inferior rate-distortion performance. The morphology-based coders, on the other hand, utilize the morphological dilation operation to delineate the clusters of significant coefficients for improving coding performance. In this paper, a novel dilation-run image coding algorithm is developed by taking the advantages of both schemes, in which the clustered significant coefficients are extracted by using the morphological dilation operation and the insignificant coefficients between the extracted clusters are coded by using the run-length coding method. The proposed dilation-run image coder is implemented in the framework of bitplane coding for producing embedded bitstreams. Compared with several state-of-the-art wavelet image coding methods, the proposed dilation-run image coding method achieves comparable rate-distortion coding performance, especially more attractive for fingerprint type of imageries.
Fine granularity scalability (FGS) is the latest video-coding tool provided in Amendment 2 of the MPEG-4 standard. By taking advantage of bitplane coding of DCT residues, the compressed bitstream can be truncated at a...
详细信息
Fine granularity scalability (FGS) is the latest video-coding tool provided in Amendment 2 of the MPEG-4 standard. By taking advantage of bitplane coding of DCT residues, the compressed bitstream can be truncated at any location to support the finest rate scalability in the enhancement layer. However, both frame buffer scanning several times in bitplane decoding and frame duplication simultaneously for base and enhancement layer decoding make FGS difficult in its implementation. In this paper, we propose a corresponding pair of efficient streaming schedule and pipeline decoding architecture to deal with the prescribed problems. The design may be applied to the case of streaming stored FGS videos and benefit FGS-related applications.
Block truncation coding (BTC) technique is a simple and fast image compression algorithm since complicated transforms are not used. The principle used in BTC algorithm is to use two-level quantiser that adapts to loca...
详细信息
Block truncation coding (BTC) technique is a simple and fast image compression algorithm since complicated transforms are not used. The principle used in BTC algorithm is to use two-level quantiser that adapts to local properties of the image while preserving the first- or first- and second-order statistical moments. The parameters transmitter or stored in the BTC algorithm are statistical moments and bitplane yielding good quality images at a bitrate of 2 bits per pixel (bpp). In this paper, two algorithms for modified BTC (MBTC) are proposed for reducing the bitrate below 2 bpp. The principal used in the proposed algorithms is to use the ratio of moments which is a smaller value when compared to absolute moments. The ratio values are then entropy coded. The bitplane is also coded to remove the correlation among the bits. The proposed algorithms are compared with MBTC and the algorithms obtained by combining JPEG standard with MBTC in terms of bitrate, peak signal-to-noise ratio (PSNR) and subjective quality. It is found that the reconstructed images obtained using the proposed algorithms yield better results.
Streaming Video Profile is the subject of an Amendment of MPEG-4, and is developed in response to the growing need on a video-coding standard for streaming video over the Internet. It provides the capability to distri...
详细信息
Streaming Video Profile is the subject of an Amendment of MPEG-4, and is developed in response to the growing need on a video-coding standard for streaming video over the Internet. It provides the capability to distribute single-layered frame-based video over a wide range of bit rates with high coding efficiency, It also provides fine granularity scalability (FGS), and its combination with temporal scalability, to address a variety of challenging problems in delivering video over the Internet, This paper provides an overview of the FGS video coding technique in this Amendment of the MPEG-4.
As an elegant generalization of wavelet transform, wavelet packet （WP） provides an effective representation tool for adaptive waveform analysis. Recent work shows that image-coding methods based on WP decomposition ...
详细信息
As an elegant generalization of wavelet transform, wavelet packet （WP） provides an effective representation tool for adaptive waveform analysis. Recent work shows that image-coding methods based on WP decomposition can achieve significant gain over those based on a usual wavelet transform. However, most of the work adopts a tree-structured quantization scheme, which is a successful technique for wavelet image coding, but not appropriate for WP subbands. This paper presents an image-coding algorithm based on a rate-distortion optimized wavelet packet decomposition and on an intraband block-partitioning scheme. By encoding each WP subband separately with the block-partitioning algorithm and the JPEG2000 context modeling, the proposed algorithm naturally avoids the difficulty in defining parent-offspring relationships for the WP coefficients, which has to be faced when adopting the tree-structured quanUzation scheme. The experimental results show that the proposed algorithm significantly outperforms SPIHT and JPEG2000 schemes and also surpasses state-of-the-art WP image coding algorithms, in terms of both PSNR and visual quality.
A fully scalable audio coding structure based on a novel combination of the non-core MPEG-4 scalable lossless audio coding (SLS), the state-of-the-art psychoacoustic model, joint stereo coding and the perceptually pri...
详细信息
ISBN:
(纸本)9781424414833
A fully scalable audio coding structure based on a novel combination of the non-core MPEG-4 scalable lossless audio coding (SLS), the state-of-the-art psychoacoustic model, joint stereo coding and the perceptually prioritized bit-plane coding is presented in this paper. The psychoacoustic information is implicitly embedded in the scalable bitstream with negligible amount of side information and trivial modification to the standardized SLS decoder. Results of extensive evaluation show that the subjective quality of scalable audio is improved significantly.
The motion-compensated embedded zero block coding (MC-EZBC) is a wavelet-based video coding scheme using motion-compensated temporal filtering (MCTF) and spatial subband bitplane zero block coding (EZBC) to offer embe...
详细信息
ISBN:
(纸本)9781479970056
The motion-compensated embedded zero block coding (MC-EZBC) is a wavelet-based video coding scheme using motion-compensated temporal filtering (MCTF) and spatial subband bitplane zero block coding (EZBC) to offer embedded scalable bitstream in terms of spatial resolution, frame rate, and SNR quality. However, the typical MC-EZBC bitstream structure makes it only suitable for storage video transmission. We propose an improved MC-EZBC bitstream structure for live video streaming, and design some simple and lightweight algorithms for MC- EZBC substream extraction in bitstream domain.
Image coding methods based on wavelet packet decomposition show more potential than those based on usual wavelet transform since wavelet packet presents an effective tool for adaptive waveform analysis. However, most ...
详细信息
ISBN:
(纸本)0780391349
Image coding methods based on wavelet packet decomposition show more potential than those based on usual wavelet transform since wavelet packet presents an effective tool for adaptive waveform analysis. However, most of current work adopts zerotree quantization methods inside the wavelet. packet framework, and these. quantization methods are proved to be inappropriate for wavelet packet subbands. In this paper, we present an image coding algorithm based on a rate-distortion optimized wavelet packet decomposition and on a block-partitioning coding scheme which quantizes each subband separately. In this way, our algorithm naturally overcomes the difficulty in defining parent-child relationships for wavelet packet subbands, which exists in the zerotree based methods. The experimental results show that the proposed algorithm significantly outperforms SPIHT and JPEC2000 schemes and also surpasses recent wavelet packet based image coding algorithms, in terms of both PSNR and visual quality.
Perceptual image coding algorithms typically impose perceptual modeling in a preprocessing stage. A perceptual normalization model is often used to transform the original image signal into a perceptually uniform space...
详细信息
ISBN:
(纸本)9781424414369
Perceptual image coding algorithms typically impose perceptual modeling in a preprocessing stage. A perceptual normalization model is often used to transform the original image signal into a perceptually uniform space, in which all the transform coefficients have equal perceptual importance. Standard coding schemes are then applied uniformly to all coefficients. Here we use a different approach, in which we iteratively reallocates the available bits over the image space based on a maximum of minimal structural similarity criterion. We demonstrate the proposed method by incorporating it with the bitplane coding scheme in the set partitioning in hierarchical trees algorithm.
暂无评论