Fast Motion Estimation Techniques with Adaptive Variable Search Range
Yun Hee Choi, Jong Nam Kim, Tae‐Sun Choi · 1998
Introduction Recent progres in videocompresj3) algorithms and VLSI technologyhas made it posG3GP to us compres) 3 video in many applications A central component of video imagecompres46) is the motionesio mation (ME)and compens)U6# (MC), which intends to remove the temporal-domain redundancypresn ted in natural videoseo)UU5 There are many types of motion es)#3Uj)x algorithms sl h as pel-recurs# e, blockmatching and feature-bas6 approaches In general, the block-matching algorithm(BMA)is dominant and moresre)### for asU363 hardware realization becaus ofits regularity andsd)U444U y. Many block matching methods have been prop osp for motioneson)3Ujj [1], [2]. The full-s)xU h (FS)block matching methodus6# original pixel values examines all pos##UG motiondis placements within these)U h window to find the bes match interms of a predetermineddisetermi criterion. Due to heavy computation andextensG e data fetching between the frame bu#er and ME, full-sj)x h MEus ing pixel intensj3)x is