The problem of packetizing embedded multimedia bit-streams into fixed-size packets is investigated and an optimal packetization scheme using a genetic algorithm is presented. In the proposed method, each individual pa...
详细信息
The problem of packetizing embedded multimedia bit-streams into fixed-size packets is investigated and an optimal packetization scheme using a genetic algorithm is presented. In the proposed method, each individual packetization instance is represented by a decision sequence and mapped to a chromosome. A steady-state genetic algorithm is applied to search for the optimal chromosome that minimizes the distortion between the original and the reconstructed media. In addition, we propose a fast method to calculate the fitness value based on the distortion associated with each chromosome to speed up the evolution process. The computer simulation results show that our proposed packetization scheme has high compression efficiency and provides error resiliency to packet losses with a relatively fast speed. (C) 2006 Wiley Periodicals, Inc.
This paper presents a method of scalable lossless image compression by means of lossy coding. A progressive decoding capability and a full decoding for the lossless rendition are equipped with the losslessly encoded b...
详细信息
This paper presents a method of scalable lossless image compression by means of lossy coding. A progressive decoding capability and a full decoding for the lossless rendition are equipped with the losslessly encoded bit stream. embedded coding is applied to large-amplitude coefficients in a wavelet transform domain. The other wavelet coefficients are encoded by a context-based entropy coding. The proposed method slightly outperforms JPEG-LS in lossless compression. Its rate-distortion performance with respect to progressive decoding is close to that of JPEG2000. The spatial scalability with respect to resolution is also available.
This paper describes a highly performance scalable video coder. Wavelet transform is employed to decompose the video frame into different resolutions. Novel features of this coder are 1) a highly efficient multi-resol...
详细信息
This paper describes a highly performance scalable video coder. Wavelet transform is employed to decompose the video frame into different resolutions. Novel features of this coder are 1) a highly efficient multi-resolution motion estimation that requires minimum compuation and overhead motion information is embedded in this scheme;2) the wavelet coefficients are organized in an extended zero tree (EZT) which is much more efficient than the simple zerotree. We show with experimental results that this video coder achieves good performances both in processing time and compression ratio when applied to typical test video sequences.
This letter presents a new sorting algorithm for the DCT-based embedded image compression. The magnitudes of DCT coefficients are estimated from the ones in the neighboring blocks, and the coefficients with larger est...
详细信息
This letter presents a new sorting algorithm for the DCT-based embedded image compression. The magnitudes of DCT coefficients are estimated from the ones in the neighboring blocks, and the coefficients with larger estimates are given higher priority in encoding. This priority information is also used as contexts for arithmetic coding. The proposed method finds more significant coefficients earlier than the conventional methods, thereby providing higher coding gain.
In this paper, a new encoding approach is proposed to control the JPEG2000 encoding in order to reach a desired perceptual quality. The new method is based on a vision model that incorporates various masking effects o...
详细信息
In this paper, a new encoding approach is proposed to control the JPEG2000 encoding in order to reach a desired perceptual quality. The new method is based on a vision model that incorporates various masking effects of human visual perception and a perceptual distortion metric that takes spatial and spectral summation of individual quantization errors into account. Compared with the conventional rate-based distortion minimization JPEG2000 encoding, the new method provides a way to generate consistent quality images at a lower bit rate.
It is well known that the fixed rate coder achieves optimality when all coefficients are coded with the same rate-distortion (R-D) slope. In this paper, we show that the performance of the embedded coder can be optimi...
详细信息
It is well known that the fixed rate coder achieves optimality when all coefficients are coded with the same rate-distortion (R-D) slope. In this paper, we show that the performance of the embedded coder can be optimized in a rate-distortion sense by coding the coefficients with decreasing R-D slope. We denote such coding strategy as rate-distortion optimized embedding (RDE). RDE allocates the available coding bits first to the coefficient with the steepest R-D slope, i.e., the largest distortion decrease per coding bit. The resultant coding bitstream can be truncated at any point and still maintain an optimal R-D performance. To avoid the overhead of coding order transmission, we use the expected R-D slope, which can be calculated from the coded bits and is available in both the encoder and the decoder. With the probability estimation table of the QM-coder, the calculation of the R-D slope can be just a lookup table operation. Experimental results show that the rate-distortion optimization significantly improves the coding efficiency in a wide bit rate range.
In an embedded wavelet scheme for progressive transmission, a tree structure naturally defines the spatial relationship on the hierarchical pyramid. Transform coefficients over each tree correspond to a unique local s...
详细信息
In an embedded wavelet scheme for progressive transmission, a tree structure naturally defines the spatial relationship on the hierarchical pyramid. Transform coefficients over each tree correspond to a unique local spatial region of the original image, and they can be coded bit-plane by bit-plane through successive-approximation quantization. After receiving the approximate value of some coefficients, the decoder can obtain a reconstructed image. We show a rational system for progressive transmission that, in absence of a priori knowledge about regions of interest, chooses at any truncation time among alternative trees for further transmission in such a way as to avoid certain forms of behavioral inconsistency. We prove that some rational transmission systems might exhibit aversion to risk involving "gambles" on tree-dependent quality of encoding while others favor taking such risks. Based on an acceptable predictor for visual distinctness from digital imagery, we demonstrate that, without any outside knowledge, risk-prone systems as well as those with strong risk aversion appear in capable of attaining the quality of reconstructions that can be achieved with moderate risk-averse behavior. (C) 2002 Society of Photo-Optical Instrumentation Engineers.
Most of the compression methods for remote sensing images are often designed under the guidance of mean square error. However, for the vision-related applications, high peaksignal- to-noise ratio (PSNR) does notmean g...
详细信息
Most of the compression methods for remote sensing images are often designed under the guidance of mean square error. However, for the vision-related applications, high peaksignal- to-noise ratio (PSNR) does notmean good visual quality. On the other hand, existing compression methods that considering the human visual system (HVS) are usually designed for natural images, without taking the unique characteristics of remote sensing images into account. Focusing on this problem, we present a novel HVS-based adaptive scanning (HAS) scheme for the compression of remote sensing images. First, after the wavelet transform, a retina-based visual sensitivity model is established, and then, the visual weighting mask is generated. Second, for the weighted transformed image, an adaptive scanning method is proposed, which provides different scanning orders among subbands and within a subband, respectively. The former focuses on organizing the codestream according to the importance of weighted subbands, and the latter aims at preserving the direction information of an image as much as possible. Finally, the binary tree codec is utilized. Experimental results show that, as compared with other scan-based compression methods, the proposed HAS-based compression method can provide better visual quality, which makes it more desirable in vision-related applications for remote sensing images.
This paper extends the group testing for wavelets (IEEE Trans. Image Process. 11 (2002) 901) algorithm to code coefficients from the wavelet packet transform, the discrete cosine transform, and various lapped transfor...
详细信息
This paper extends the group testing for wavelets (IEEE Trans. Image Process. 11 (2002) 901) algorithm to code coefficients from the wavelet packet transform, the discrete cosine transform, and various lapped transforms. Group testing offers a noticeable improvement over zerotree coding techniques on these transforms;is inherently flexible;and can be adapted to different transforms with relative ease. The new algorithms are competitive with many recent state-of-the-art image coders that use the same transforms. (C) 2003 Elsevier Science B.V. All rights reserved.
This paper studies the fine-grain scalable compression problem with emphasis on 1-D signals such as audio signals. Like in the successful 2-D still image compression techniques embedded zerotree wavelet coder (EZW) an...
详细信息
This paper studies the fine-grain scalable compression problem with emphasis on 1-D signals such as audio signals. Like in the successful 2-D still image compression techniques embedded zerotree wavelet coder (EZW) and set partitioning in hierarchical trees (SPIHT), the desired fine-granular scalability and high coding efficiency are benefited from a tree-based significance mapping technique. A significance tree serves to quickly locate and efficiently encode the important coefficients in the transform domain. The aim of this paper is to find such suitable significance trees for compressing dynamically variant 1-D signals. The proposed solution is a novel dynamic significance tree (DST) where, unlike in existing solutions with a single type of tree, a significance tree is chosen dynamically out of a set of trees by taking into account the actual coefficients distribution. We show how a set of possible DSTs can be derived that is optimized for a given (training) dataset. The method outperforms the existing scheme for lossy audio compression based on a single-type tree (SPIHT) and the scalable audio coding schemes MPEG-4 BSAC and MPEG-4 SLS. For bitrates less than 32 kbps, it results in an improved perceived audio quality compared to the fixed-bitrate MPEG-2/4 AAC audio coding scheme while providing progressive transmission and finer scalability.
暂无评论