Presentation is loading. Please wait.

Presentation is loading. Please wait.

Adaptive Fast Block-Matching Algorithm by Switching Search Patterns for Sequences With Wide-Range Motion Content 韋弘 2010-07-05.

Similar presentations


Presentation on theme: "Adaptive Fast Block-Matching Algorithm by Switching Search Patterns for Sequences With Wide-Range Motion Content 韋弘 2010-07-05."— Presentation transcript:

1 Adaptive Fast Block-Matching Algorithm by Switching Search Patterns for Sequences With Wide-Range Motion Content 韋弘

2 reference frame current frame motion vector residual Introduction

3 Introduction remove the temporal redundancy switch FBMA among the motion contents A-TDB algorithm based on predicted profit list

4 Outline Basic Methods Predicted Profit List A-TDB Algorithm Results References

5 Outline Basic Methods Predicted Profit List A-TDB Algorithm Results References

6 motion vector

7 Full search

8 Three-Step Search (TSS)

9

10 Block-Base Gradient Descent Search (BBGDS)

11

12 Diamond Search (DS)

13

14 Fast Block-Matching Algorithm three-step search (TSS) new three-step search (NTSS) block-based gradient descent search (BBGDS) diamond search (DS) four-step search (FSS)

15 NTSS

16 FSS

17 Algorithm with minimum computation

18 Search Pattern Utilized

19 Outline Basic Methods Predicted Profit List A-TDB Algorithm Results References

20 Predicted Profit List Initial : MSE(profit) at (0,0) a sorted list of blocks in descending order of profit

21 Characteristics(1/4) the distribution of the profits is not uniform

22 Characteristics(2/4) the blocks usually include several various motion contents

23 Characteristics(3/4) the MVs of the neighboring blocks are strongly correlated

24 Characteristics(4/4) the MV is very likely to be zero near the end

25 Outline Basic Methods Predicted Profit List A-TDB Algorithm Results References

26 A-TDB Algorithm

27 Initialization Phase

28 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

29 Adaptive Phase

30 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

31 test sequences

32 the effect of T i

33 the value of T i is negligible

34 the effect of T a

35 2, 3, and 4 are good choices for Ta

36 the effect of T c (>6)

37 Outline Basic Methods Predicted Profit List A-TDB Algorithm Results References

38 Result

39 Result

40 Result

41 Outline Basic Methods Predicted Profit List A-TDB Algorithm Results References

42 References [1]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 , Nov [2] 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 [3] 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 [4] A. Andersson, T. Hagerup, S. Nilsson, and R. Raman, “Sorting in linear time,” J. Comput. Syst. Sci., vol. 57, pp. 74–93, 1998.


Download ppt "Adaptive Fast Block-Matching Algorithm by Switching Search Patterns for Sequences With Wide-Range Motion Content 韋弘 2010-07-05."

Similar presentations


Ads by Google