By Topic

A novel fast motion estimation algorithm using fixed subsampling pattern and multiple local winners search

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Hsien-Hsi Hsieh ; Dept. of Comput. Sci. & Inf. Eng., Nat. Dong-Hua Univ., Taiwan, China ; Yong-Kang Lai

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

Published in:

Circuits and Systems, 2001. ISCAS 2001. The 2001 IEEE International Symposium on  (Volume:2 )

Date of Conference:

6-9 May 2001