Many suboptimal motion vector search algorithms have been proposed because the full search algorithm, which is an opti- mal method, requires huge computational cost. Most of these algo- rithms find motion vectors simply from the center of the search win- dow. In this paper we propose an efficient motion vector search algorithm which, in order to predict the initial search point, exploits the global motion information obtained form the previous three frames and the local motion information regarding the motion vec- tors of the neighboring blocks of the current block.
展开▼
