the other objective ◦ determine the initial rate of motion in the adaptive zone (based on MVs) ◦ MV(length) > (¼)x(search range) => rapid ◦ MV(length) 1 => slow if successive T i blocks have rapid (moderate or slow) => change to adaptive phase
Cleanup Phase When does A-TDB change to the cleanup phase? ◦ predicted profits of the blocks < threshold (predefined) ◦ the MVs found are consecutive zero (T c ) What does the cleanup phase do? ◦ skip the remaining blocks in the profit list ◦ A-TDB stops
References S.-Y. Huang, C.-Y. Cho, and J.-S. Wang, “Adaptive fast block-matching algorithm by switching search patterns for sequences with wide-range motion content”, IEEE Trans. Circuits and Systems for Video Technology, vol. 15, no. 11, p.p.1373-1384, Nov. 2005.  L. K. Liu and E. Peig, “A block-based gradient descent search algorithm for block motion estimation in video coding,” IEEE Trans. Circuits Syst. Video Technol., vol. 6, no. 8, pp. 419–423, Aug. 1996.  S. Zhu and K.-K. Ma, “A new diamond search algorithm for fast block matching motion estimation,” IEEE Trans. Image Process., vol. 9, no. 2, pp. 287–290, Feb. 2000.  A. Andersson, T. Hagerup, S. Nilsson, and R. Raman, “Sorting in linear time,” J. Comput. Syst. Sci., vol. 57, pp. 74–93, 1998.