1 / 40

韋弘 2010-07-05

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

gabby
Download Presentation

韋弘 2010-07-05

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

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

  2. Introduction reference frame current frame motion vector residual

  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. Three-Step Search (TSS)

  10. Block-Base Gradient Descent Search(BBGDS)

  11. Block-Base Gradient Descent Search(BBGDS)

  12. Diamond Search (DS)

  13. Diamond Search (DS)

  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. Algorithm with minimum computation

  16. Search Pattern Utilized

  17. Outline • Basic Methods • Predicted Profit List • A-TDB Algorithm • Results • References

  18. Predicted Profit List • Initial：MSE(profit) at (0,0) • a sorted list of blocks in descending order of profit

  19. Characteristics(1/4) • the distribution of the profits is not uniform

  20. Characteristics(2/4) • the blocks usually include several various motion contents

  21. Characteristics(3/4) • the MVs of the neighboring blocks are strongly correlated

  22. Characteristics(4/4) • the MV is very likely to be zero near the end

  23. Outline • Basic Methods • Predicted Profit List • A-TDB Algorithm • Results • References

  24. A-TDB Algorithm

  25. Initialization Phase

  26. Initialization Phase • the other objective • determine theinitial rate of motion in the adaptive zone (based on MVs) • MV(length) > (¼)x(search range) => rapid • MV(length) 1 => slow • if successive Tiblocks have rapid (moderate or slow) => change to adaptive phase

  27. Adaptive Phase

  28. Cleanup Phase • When does A-TDB change to the cleanup phase? • predicted profits of the blocks < threshold (predefined) • the MVs found are consecutive zero (Tc) • What does the cleanup phase do? • skip the remaining blocks in the profit list • A-TDB stops

  29. test sequences

  30. the effect of Ti

  31. the effect of Ti • the value of Ti is negligible

  32. the effect of Ta

  33. the effect of Ta • 2, 3, and 4 are good choices for Ta

  34. the effect of Tc(>6)

  35. Outline • Basic Methods • Predicted Profit List • A-TDB Algorithm • Results • References

  36. Result

  37. Result

  38. Result

  39. Outline • Basic Methods • Predicted Profit List • A-TDB Algorithm • Results • References

  40. 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.1373-1384, Nov. 2005. • [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. 1996. • [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. 2000. • [4] A. Andersson, T. Hagerup, S. Nilsson, and R. Raman, “Sorting in linear time,” J. Comput. Syst. Sci., vol. 57, pp. 74–93, 1998.

More Related