An Improved Motion Vectors Fast Search Method

Interframe predictive coding is used to eliminate the large amount of temporal and spatial redundancy that exists in video sequences and helps in compressing them. Motion eliminate can help to eliminate these redundancy. Different kinds of algorithms use different criteria for comparison of blocks. One of the first algorithms to be used for block based motion compensation is what is called the Full Search or the Exhaustive Search. It can exactly get the very motion vector. Because of its large computational complexity, people tried many other methods.Some algorithms are based on the nature of the image data than the limitations of the human observers. It is believed by these algorithms that very good matches are likely to be found in the vicinity of reasonably good matches. Although this assumption might not be necessarily true, it is useful for reducing the computation as the search can be broken down into stages where the algorithm successively narrows down on the regions of good matches. There are a large number of algorithms that make this assumption and these may be classified as algorithms based on the Principle of Locality. One of the problems with these algorithms is that they can converge to a local minimum rather than to the global minimum. These algorithms can be modified by changing the manner in which the algorithm narrows down the search area.This paper proposes a new algorithm for fast block-matching motion estimation. It combines the advantage of both TTS and DS and makes the search result more effective. It also makes the computational complexity more accretive.This paper analyzes the main factors which affect the algorithm's performance and illustrates the principle by which some important parameters can be evaluated. According to the programming, experiment and analysis of the algorithm, it has good efficiency...