Controllable quick motion valuation algorithm for prediction quality

Abstract

This invention discloses a quick moving estimation method for forcasting controllable quality including: A, a current macro-block presets a search window in a reference frame to predicate the position of an initial search center of the current macro-block in the window, B, judging if the maximum match point of the current macro-block in the reference frame is the initial search center position, C, if not, when the macro-block is in the moving state relative to th reference frame, the search window is adjusted, D, after the current macro-block is sampled in terms of a proportion, several pixel blocks are got and analyzed, E, quality controllable block match operation is done to the pixel block with the greatest variance.

Description

technical field [0001] The invention relates to digital video compression technology in the field of multimedia communication, in particular to a motion estimation method in video compression standards. Background technique [0002] The storage and transmission of video data needs to be compressed and encoded. Compression is to remove redundant information from both the time domain and the air domain. Complicated encoding algorithms may produce higher compression ratio and signal-to-noise ratio, but also bring large CPU overhead and affect the real-time performance of video communication. [0003] In the international standards of video compression, a hybrid compression coding method combining predictive coding with motion compensation and DCT transform coding is adopted. The calculation amount of motion estimation in motion compensation is the key factor affecting the coding speed. Therefore, for the design of an efficient and fast video encoder, it is very important to pe...

AI Technical Summary

Problems solved by technology

[0011] Three-step search method (TSS), two-dimensional logarithmic search method (2DLOG), conjugate direction search method (CSA), new three-step search method (NTSS), four-step search method (4SS), ring search method (DS ) and other fast block matching algorithms use certain arithmetic criteria to save computing resources by reducing the number of search positions. Although compared with the full search block matching algorithm, the amount of calculation is greatly reduced, but often only the local optimal value in the search window can be found. , but cannot find the global optimal value, so that the estimated motion vector information is not accurate enough, which affects the quality of the reconstructed image after decoding

However, these algorithms lack controllability between prediction quality and search speed, and their search speed is 16 times higher than the theoretical limit of the full search algorithm, which needs to be improved

Images