CFRFS based digital video compressed encoding method

Abstract

The invention discloses a method based on the CFRFS digital video compression coding, which utilizes the fast search algorithm of the search pattern having the subcircular expansion ring, increases the performance of the encoder by improving the efficiency of the motion estimation. In the process of coding, first predict the data block according to the coded reference frame with the block-based motion estimation algorithm, and the gained motion vector determines the displacement between the current block and the optimum mating block; then process the orthogonal change to the prediction error and quantize the gained coefficient after changing; finally transform the coefficient after quantification to the binary code character with the variable long coding. Utilizing the method based on theCFRFS digital video compression coding which is proposed by the invention, the rate has remarkable improvement, thus the method has significance to the digital video field, and can be widely used in the video compression coding field of the higher requirement to real-time such as the network real-time video monitor.

Description

technical field [0001] The present invention relates to a method for digital video compression coding based on CFRFS, in particular, relates to a fast search algorithm using a near-circular scalable ring search template in digital video compression coding, by improving the efficiency of motion estimation to improve Encoder performance method. Background technique [0002] A video sequence is actually a sequence of still images. When they are continuously displayed at a speed of not less than 24 frames per second, due to the persistence of vision effect of the human eye, they appear to be continuous images. Therefore, in general, the content between adjacent frames is actually similar (except for scene switching, etc.), and a large part is even completely the same, so there is a large temporal correlation between frames, that is, time Redundancy (Temporal Redundancy). As early as the appearance of video images, people have realized that there is redundancy in video signals ...

AI Technical Summary

Problems solved by technology

Although the performance of the UMHexagonS algorithm is very superior, there are still a lot of search points in the second and third steps, resulting in redundancy in the search, and each step uses a different search template, and sets a different The threshold is used as the judgment of early termination, which greatly increases the complexity of the algorithm

Images