1 / 29

Final Project ： Motion Estimation

Final Project ： Motion Estimation. Adviser ：葉家宏 老師 Presenter ：吳奕賢 Date ： 2011/01/13(Thur.). Overview. Background Sequence analysis Proposed search Method Demonstration Comparison Conclusion Discussion. Background.

efia
Download Presentation

Final Project ： Motion Estimation

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. Final Project：Motion Estimation Adviser ：葉家宏 老師 Presenter：吳奕賢 Date ：2011/01/13(Thur.)

  2. Overview • Background • Sequence analysis • Proposed search • Method • Demonstration • Comparison • Conclusion • Discussion

  3. Background • Implement motion estimation on Akiyo, Football andForeman QCIF sequence • Three different basic techniques: • Full search • Three step search • Diamond search • Coding time and PSNR comparison • Microsoft Visual Studio 2008 C++

  4. Sequence analysis • Akiyo

  5. Sequence analysis • Football

  6. Sequence analysis • Foreman

  7. Proposed Search • Step 1: Pick an initial step size. Look at the block at the middle search, the four points are at a distance of four pixel from center on the X and Y axis

  8. Proposed Search If minimum SAD point would at center • Step 2: Diamond search-point configuration

  9. Proposed Search • Step 3: Next step along a diamond’s vertex

  10. Proposed Search • Step 4: Final step with a shrunk diamond

  11. Proposed Search If minimum SAD point wouldn’t at center • Step 2: Square search-point, which are at a distance four from near point

  12. Proposed Search • Step 3: Diamond search-point configuration

  13. Proposed Search • Step 4: Next step along a diamond’s vertex

  14. Proposed Search • Step 5: Final step with a shrunk diamond

  15. Demonstration • 1st sequence : Akiyo.qcif

  16. Demonstration

  17. Demonstration • 2nd sequence : Football.qcif

  18. Demonstration

  19. Demonstration • 3rd sequence : foreman.qcif

  20. Demonstration

  21. Experimental Results Comparison

  22. Experimental Results Comparison

  23. Conclusion • If we only use Three step search, it couldn’t find the exact motion vector than Diamond search • If we only use Diamond search, it might be unable to search the marginal point of search window • We combine the advantage of the Three step search and Diamond search • After sequence analysis, we improve the method at step 1 that could reduce the ME times • Focus on PSNR, The proposed search is better than Three step search and Diamond Search

  24. Discussion • Step 1: Square search-point configuration • Step 2: Next step along a square’s vertex • Step 3: Final step with a shrunk diamond

  25. Discussion • Step 1: Hexagon search-point configuration • Step 2: Next step along a hexagon’s vertex • Step 3: Final step with a shrunk square

  26. Discussion • Step 1: Cross search-point configuration • Step 2: Next step along a cross’vertex • Step 3: Final step with a shrunk square

  27. Discussion

  28. Discussion

  29. Thank you for your attention

More Related