In this paper, we present a new blocking scheme for multidimensional transform coding. This scheme generalizes traditional blocking methods. Compared to the conventional rectangular blocking method, the generalized bl...
详细信息
In this paper, we present a new blocking scheme for multidimensional transform coding. This scheme generalizes traditional blocking methods. Compared to the conventional rectangular blocking method, the generalized blocking scheme provides us more freedom in choosing block shapes and arrangements, so larger coding gain can be achieved. Examples are presented to illustrate the improvement given by the proposed scheme.< >
The performances of the LDU (lower-diagonal-upper) factorization transform were recently shown to be equivalent to those of the Karhunen-Loeve transform (KLT), which is optimal for Gaussian sources, in the limit of hi...
详细信息
The performances of the LDU (lower-diagonal-upper) factorization transform were recently shown to be equivalent to those of the Karhunen-Loeve transform (KLT), which is optimal for Gaussian sources, in the limit of high rates (Phoong, S.-M. and Lin, Y.-P., 2000; Mary, D. and Slock, D.T.M., 2001; Lahouti, F. and Khandani, A.K., 2001). We further investigate the performances of the LDU for actual transform coding (TC) schemes. Our previous results (Mary and Slock, 2001) showed that the LDU should be implemented in closed loop around the quantizers, though this leads to a noise feedback effect, similar to that occurring in DPCM systems. We develop novel analyses of these effects on the distortion-rate functions and coding gains. The proposed analyses compare our previous results, obtained for a hypothetical TC system for which the bit allocation is optimal and the rate is high, to those obtained for practical TC systems whose bit allocation is nearly optimal. By means of a theorem and numerical results, evidence is given that ordering the subsignals in the source vector by order of decreasing variance minimizes the quantization noise feedback. For the investigated practical systems, we show that deviations from the high rate assumptions arise below /spl sim/3 b/s. The effects of the noise feedback become non negligible below /spl sim/2 b/s. The LDU competes with the KLT above /spl sim/2.5 b/s.
A power-aware SNR progressive DCT/IDCT IP core design for multimedia transform coding is proposed. The proposed IP core possesses the feature of power-aware design flexibility, allowing the trade-off of lower power co...
详细信息
ISBN:
(纸本)0780386035
A power-aware SNR progressive DCT/IDCT IP core design for multimedia transform coding is proposed. The proposed IP core possesses the feature of power-aware design flexibility, allowing the trade-off of lower power consumption with less demand of data precision in developing its instruction library. Relationships of energy reduction and data quality degradation in the examples of both JPEG still images and MPEG4 video sequences have been analyzed. Since the proposed IP core is developed based on the concept of programmable processors, we can select a DCT/IDCT firmware library of different precisions of cosine coefficients according to the accuracy requirement of various applications. This design has been realized based on a 0.35-/spl mu/m CMOS technology and costs about 2175 gates with 8 words of RAM, which can achieve real-time processing of the texture coding in an MPEG4 SP@L3 codec system for CIF video at 30 frames per second (fps).
Summary form only given. Block based transform coding (BBTC) is among the most popular coding method for video compression due to its simplicity of hardware implementation. At low bit rate transmission however this ap...
详细信息
Summary form only given. Block based transform coding (BBTC) is among the most popular coding method for video compression due to its simplicity of hardware implementation. At low bit rate transmission however this approach cannot maintain acceptable resolution and image quality. On the other hand, region based coding methods have been shown to have the capability to improve the visual quality by the acknowledgment of human perception. In order to take the advantages from both of the coding methods, a novel technique is introduced to combine BBTC and region based coding. Using this technique, a new class of video coding methods are generated and termed region based transform coding (RBTC). In the generalized RBTC, we represent regions containing motion in terms of texture surrounded by contours. Contours and textures are then coded separately. The novel technique is that the pixel values of the regions are scanned to form a vector. Then the vector is further converted to a number of fixed size image blocks. Using this technique, conventional transform coding can be applied on the blocks of texture directly. Contour can be coded using traditional contour coding methods or any other bit plane encoding methods. To prove the idea of this new class of video coding methods, a scheme called segmented motion transform coding (SMTC) is simulated. In SMTC, chain codes are used for contour coding. The simulations are performed using the first 60 frames of both of the CIF formatted "Miss America" and "Salesman" video sequences.
The performance of the KLT for transform coding applications was examined. The KLT has long been viewed as the best available block transform for transform coding. The fixed-rate and variable-rate transform codes were...
详细信息
The performance of the KLT for transform coding applications was examined. The KLT has long been viewed as the best available block transform for transform coding. The fixed-rate and variable-rate transform codes were also presented. The fixed-rate approach uses an optimal fixed-rate scalar quantizer to describe the transform coefficients; the variable-rate approach uses a uniform scalar quantizer followed by an optimal entropy code. Earlier work shows that for the variable-rate case, there exist sources on which the KLT is not unique and the optimal transform code matched to a "worst" KLT yields performance as much as 1.5 dB worse than the optimal transform code matched to a "best" KLT. The results were strengthened to show that in both the fixed-rate and the variable-rate coding frameworks, there exist sources for which the performance penalty for using a "worst" KLT can be made arbitrarily large. Further demonstrations in both frameworks show that there exist sources for which even a best KLT gives suboptimal performance. Finally, the results show that even for vector sources where the KLT yields independent coefficients, the KLT can be suboptimal for fixed-rate coding.
In applications where compression has to be performed under varying complexity constraints (e.g., with hardware having to operate in reduced power mode) it is beneficial to design compression algorithms that allow som...
详细信息
In applications where compression has to be performed under varying complexity constraints (e.g., with hardware having to operate in reduced power mode) it is beneficial to design compression algorithms that allow some degree of complexity scalability. In this paper we explore complexity scalability for transform coding algorithms. We show that a variable complexity algorithm (VCA), which uses energy thresholds to determine the number of coefficients to be computed for each input, is preferable to other alternatives such as a pruned transform, where the same number of coefficients is computed for the whole image. We show that the benefits include not only a higher degree of scalability, but also increased compression performance, as we take advantage of the energy classification that is needed for VCA operation and design quantizers that match each class. We provide expressions for the average complexity as well as rate/distortion relations for a generic N-point VCA transform. For a two point case, we present closed-form relations describing the variance changes in two classes. In addition, rate-distortion-complexity relations are also empirically obtained. We apply VCA to eight-point KLT and 8/spl times/8 DCT in the JPEG framework and experiments show that the VCA approach is superior in rate/distortion performance at low rates compared to the standard transform coding techniques.
In this paper we report the results of an adaptive block-size transform coding scheme that is based on the sequential JPEG algorithm. This minimum information-overhead method implies a transform coding technique with ...
详细信息
In this paper we report the results of an adaptive block-size transform coding scheme that is based on the sequential JPEG algorithm. This minimum information-overhead method implies a transform coding technique with two different block sizes: N/spl times/N and 2N/spl times/2N pixels. The input image is divided into blocks of 2N/spl times/2N pixels and each of these blocks is classified according to its image activity. Depending on this classification, either four N-point or a single 2N-point 2-D DCT is applied on the block. The purpose of the algorithm is to take advantage of large uniform regions that can be coded as a single large unit instead of four small units-as it is made by a fixed block-size scheme. For the same reconstruction quality, the results of the adaptive algorithm show a significant improvement of the compression ratio with respect to the non-adaptive scheme.
We propose, for an image compression system based on the Karhunen-Loeve transform implemented by neural networks, to take into consideration the 8 square isometries of an image block. The proper isometry applied puts ...
详细信息
ISBN:
(纸本)0780370449
We propose, for an image compression system based on the Karhunen-Loeve transform implemented by neural networks, to take into consideration the 8 square isometries of an image block. The proper isometry applied puts the 8*8 square image block in a standard position, before applying the image block as input to the neural network architecture. The standard position is defined based on the variance of its four 4*4 sub-blocks (quadro partitioned) and brings the sub-block having the greatest variance in a specific corner and in another specific adjoining corner the sub-block having the second variance (if this is not possible the third is considered). The use of this "preprocessing" phase was expected to improve the learning and representation ability of the network and, therefore, to improve the compression results. Experimental results have proven that the expectations were fulfilled and the isometries are, from now, worth taking into consideration.
A disadvantage of nonorthogonal transforms is the inevitable amplification of the quantization noise during synthesis. A feedback structure can be used to compensate this amplification. We try to generalize the idea o...
详细信息
A disadvantage of nonorthogonal transforms is the inevitable amplification of the quantization noise during synthesis. A feedback structure can be used to compensate this amplification. We try to generalize the idea of noise feedback to the case of nonorthogonal transforms. We explore the application of nonorthogonal transforms to the coding of quasi-stationary sources for which the KLT is, strictly speaking, not defined. transforms which maximize the coding gain for the assumed model of the quasi-stationary source are found, which are generally nonorthogonal. The proposed transforms along with the feedback structure are seen to perform better than the average KLT for AR sources and real life speech signals.
暂无评论