A new predictive search area approach for fast block motion estimation Kuo-Liang Chung ( 鍾國亮 ) Lung-Chun Chang ( 張隆君 ) 國立台灣科技大學資訊工程系暨研究所 IEEE TRANSACTIONS ON IMAGE PROCESSING, VOL. 12, NO. 6, JUNE 2003

2 2003/7/20 Outline New predictive search area approach  Observation  Search Area Determination Proposed improved FS algorithm Experimental results

3 2003/7/20 Observations Observation on the motion differentials, among the motion vector of any block and those of its four neighboring blocks.

4 2003/7/20 Displacement variable

5 2003/7/20 Example: Displacement variable D (2,3) (3,3)(4,3)(-2,3) (3,4) D =1

6 2003/7/20 nlnl Average probability of D = d l sequences: Calendar train 30 frames Football 30 frames Garden 30 frames Salesman 21 frames Susie 30 frames Table tennis 30 frames For search window (33x33) 0 ≤ d ≤ 16 j th frame

7 2003/7/20 The related average probability of D for six sequences The Accumulated probability of D for six sequences

8 2003/7/20 Observation

9 2003/7/20 Search Area Determination D =2, % average accumulated probability D =3, % average accumulated probability

/7/20 Predictive search area Computation Improvement Ratio CIR=[Area(SW) – Area(S)] / Area(SW) search window (SW) determined search area S The CIR is at least 90.82% = ( )/1089, where 1089 = 33x33, 100= 5x5x4 82% for D =3

/7/20 Experimental Results -PSNR Comparison

/7/20 Experimental Results -Execution-Time Comparison

/7/20 Experimental Results -Execution-Time Improvement Ration Comparison

/7/20 Conclusion A new predictive search area determination strategy.