Method for searching sub-pixels in interframe codes, motion searching method and module thereof

Abstract

The invention discloses a method for searching sub-pixels in interframe codes, a motion searching method and a module thereof. Pre-judgment is carried out before the sub-pixels are searched, search points of possible non-optimal-matching sub-pixels are eliminated, accordingly, the quantity of pixels needing to be searched is reduced, and sub-pixel searching speed is increased. The pre-judgment is completed according to relative positions of a predicted motion vector of a current macroblock and a motion vector of an integral pixel, accuracy of the pre-judgment is guaranteed, accordingly, search points of the sub-pixels are reduced on the premises that the subjective quality of a reconstructed image is unaffected and change of code flows is tiny, and motion search efficiency is improved. In addition, the distance from the predicted motion vector of the current macroblock to the motion vector of the integral pixel is computed, five sub-pixels around the integral pixel are searched if the distance is larger than the size of the pixel, three sub-pixels around the integral pixel are searched if the distance is not larger than the size of the pixel, and accordingly, search points of the sub-pixels are further reduced on the premise of unaffecting the coding quality.

Description

technical field [0001] The invention relates to the field of video coding compression, in particular to a sub-pixel inter-frame search compression algorithm. Background technique [0002] With the rapid development of science and technology, multimedia and network communication have become a part of our life. People hope that they can transmit, use and process video conveniently and flexibly no matter when and where. Video compression technology is the premise of transmitting and processing video. After the video signal is digitized, the data bandwidth is very high, usually above 20MB / s, so the transmission needs to occupy a large amount of bandwidth, the network transmission takes a long time, and because the capacity is too large, it is difficult for the computer to store and process it. [0003] Although the amount of digital video image information is very large, the video image data is highly correlated, and there is a large amount of redundant information within an im...

AI Technical Summary

Problems solved by technology

If all the points in the area to be searched are matched once, taking the search range "16" of the general protocol as an example, each 16*16 macroblock needs to search for 1089 matching points, which is difficult to use software to perform real-time deal with

[0014] Therefore, in practical applications, the fast search algorithm for integer pixels usually needs to narrow the search range and delete the search points, so that the search points are greatly reduced, but the 8 sub-pixels around each integer pixel do not If it is omitted, it still needs to be searched. If it is necessary to search for sub-pixel points with finer precision, the calculation amount of sub-pixel search needs to be increased.

[0015] It can be seen from the above description that the proportion of integer pixels for rough search is almost equal to that of fine-precision sub-pixel search points in the entire motion search process. Although the search points for integer pixels are reduced, there will still be Subpixel search takes too much resources

Images