Many suboptimal motion vector search algorithms have been proposed because the full search algorithm, which is an optimal method, requires huge computational requirements. These algorithms find motion vectors simply from the center of the search window. In this paper we propose an efficient motion vector search algorithm (GLS), which exploits the global motion information obtained from the previous three frames and the local motion information regarding the motion vectors of the neighboring blocks of the current block in order to predict the initial search point. GLS searches for a motion vector from this initial search point, instead of the center of the search window, using either the diamond search algorithm (DS) or the unrestricted small diamond search algorithm (USDS) which performs its search always with a smaller diamond search pattern. USDS has the same search pattern as that of the last search step in DS. Experimental results show that GLS is a faster and more accurate motion vector search method than other suboptimal methods.
|Number of pages||10|
|Journal||IEEE Workshop on Signal Processing Systems, SiPS: Design and Implementation|
|Publication status||Published - 1999 Dec 1|
|Event||1999 IEEE Workshop on SiGNAL Processing Systems (SiPS 99): 'Design and Implementation' - Taipei, Taiwan|
Duration: 1999 Oct 20 → 1999 Oct 22
All Science Journal Classification (ASJC) codes