By Topic

Deliberation with "fast full-search block matching"

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)
Junming Lu ; LSI Res. Inst., Shanghai Jiaotong Univ., China ; Zhenghui Lin

In this paper, two iffy proofs have been pointed out and were eliminated by reasonable proofs and description. A fast full-search block-matching algorithm, called an extended successive elimination algorithm (ESEA), was developed previously. There are two extensions for the successive elimination algorithm (SEA) the region-splitting technique to introduce the tighter bounds to exclude more search positions, and the successive approximation technique of the error measure to reduce the computational requirements for the remaining search positions by exploiting the already calculated lower bounds during the calculation of the matching criterion.

Published in:

IEEE Transactions on Circuits and Systems for Video Technology  (Volume:13 ,  Issue: 1 )