By Topic

VLSI implementation of genetic four-step search for block matching algorithm

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)
Wu, A. ; Dept. of Electron. Eng., City Univ. of Hong Kong, China ; So, S.

Genetic algorithm is well known for searching global optimum. It has been demonstrated its capability for block motion estimation with performance close to exhaustive full search using fewer search steps. However, it is computational expensive. A genetic four-step search is developed to alleviate the problem. It has a mean square error performance close to full search and much computational efficient than the traditional genetic algorithm. A FPGA implementation of the proposed algorithm is realized. The architecture is simple and suitable for valuable applications in the development of low cost multimedia products.

Published in:

Consumer Electronics, IEEE Transactions on  (Volume:49 ,  Issue: 4 )