new idea about residual-based fast algorithms, and analyzes its feasibility by studying the experiment data. computation complexity is a key point that shouldn't be ignored. In the process of video coding, spatial redundancy is reduced through DCT, and temporal redundancy is reduced through predictive coding and motion compensation.Residual coding is the important content of video compression coding technology and responsible to process the data after prediction and write them into code stream and finally achieve further compression of video sequences. As the processing of residual data and related encoding make up the kernel of the code stream generating module, the property of relevant algorithms has tremendous influence on the performance of both encoder and decoder. This paper is carried out around the optimization algorithms of residual coding. propose algorithms of all-zero block prediction on the basis of study into DCT coefficient distribution models, thereby improving the encoding speed.
New Ideas for Residual-based Fast Algor ithmsThe theoretical foundation of 0-value residual prediction is: when the quantization parameter is large, residuals after motion compensation in low rate 4×4 blocks tend to be very small after the DCT and quantization process, and there will be lots of all-zero coefficient blocks. Besides that there are a large number of all-zero blocks, if we can find out any other law in DCT residual distribution, new ideas for future research can be come up with.Based on the theoretical foundation of residual distribution and all-zero block prediction, we suggest that there should be distribution law in the 16 or part of the 16 quantized DCT coefficients of a 4×4 block. That is to say, among all of the 4×4 quantized DCT coefficients, there may be several types appear more frequently.Then we may consider encoding these 4×4 block types that appear in most times and transmitting their serial numbers directly, while processing the other 4×4QDCT (Quantized DCT) coefficients in conventional way. If this idea works, quite a lot of computation for processes such as entropy coding and run-length coding would be reduced. In section 5 of this paper, we'll conduct experiments based on this idea, and verify the feasibility of it by analyzing the experiment results.
1747
Pr inciple of DCT and QuantizationIn the advanced video compression standard H.264, a best mode is determined through comparison between several prediction modes, and the residuals of this best mode go through 4×4 integer discrete cosine transform to eliminate their spatial correlation. After that quantization parameters are determined according to the size of the image dynamic range, and then the DCT coefficients will be quantized according to the quantization parameter. Besides, if it is a chroma block or a intra 16×16 predicted luma block, its DC coefficients should be abstracted to form a 2×2 block (in the chroma block case) or a 4×4 block (in the intra 16×16 predicted luma block case) to go through the additional Hadamard transform, ...