By Topic

A fast three-step search algorithm with minimum checking points using unimodal error surface assumption

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
$31 $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)
Jong-Nam Kim ; Dept. of Mechatron., K-JIST, Kwangju, South Korea ; Tae-Sun Choi

Fast motion estimation algorithms for compression of moving pictures are widely required for real-time video encoding instead of the full search (FS) block matching algorithm. It provides optimal error performance but requires enormous computation for calculating the motion vector. In many fast algorithms, the three-step search (TSS) has been used for real time video encoding and low bit-rate video communications because of the reduced computations, simplicity and reasonable performance. Other modified algorithms of the TSS have been studied for the speed of computation and the error performance for motion estimation. This paper proposes a new algorithm (fast three-step search) for further reduction in computational complexity using a unimodal error surface assumption (UESA) without serious degradation of the error performance. We show that the computational complexity is further reduced with additional subsampling of the matching block. It is also shown that the proposed algorithm (FTSS) is computationally efficient while keeping the same performance as that of the TSS

Published in:

Consumer Electronics, IEEE Transactions on  (Volume:44 ,  Issue: 3 )