A novel fast motion estimation algorithm using fixed subsampling pattern and multiple local winners search
Hsien-Hsi Hsieh, Yong-Kang Lai · 2002
In this paper, a novel fast algorithm for block motion estimation is proposed. The reduction of computation complexity is obtained from the use of pixel sub-sampling on block matching instead of limiting the number of searching locations. Further, in order to get the better quality, this algorithm uses a technique of multiple local winners. From the experimental result, the proposed algorithm produces better performance than some other fast block-matching algorithms like three-step search (TSS), four-step search (FSS), new three-step search (NTSS), new diamond search (DS), hybrid search (HBS) and four-step genetic algorithm (4GA). That is, the performance of proposed algorithm not only reduces the computational time but also improves the accuracy of motion vectors.