Adaptive Search Center Non-linear Three Step Search
Download:
unknown authors
http://www.csis.hku.hk/%7Ehychung/pub/icip98.pdf
Add To MetaCart
Abstract:
This paper presents a new motion estimation algorithm using an adaptive search center predicted from its adjacent blocks, and a non-linear center biased search point pattern. It does not have the problem of being trapped by local minimum, and is characterized by finding the majority motion vector in one step. When compared with six other block-based search algorithms including the full-search and three-step-search, the new algorithm has an average PSNR very close to that of fullsearch, yet an average search time faster than the threestep-search. 1.
Citations
| 96 | Motion Compensated Interframe Coding for Video Conferencing – Koga, Iinuna, et al. - 1981 |
| 74 | A new three-step search algorithm for block motion estimation – Li, Zeng, et al. - 1994 |
| 65 | New Fast Algorithms for Estimation of Block Motion Vectors – Liu, Zaccartin - 1993 |
| 51 | Predictive Coding Based on Efficient Motion Estimation – Srinivasan, Rao - 1985 |
| 51 | A novel four-step search algorithm for fast block motion estimation – Po, Ma - 1996 |
| 43 | The cross-search algorithm for motion estimation – Ghanbari - 1990 |
| 10 | One-dimensional full search motion estimation algorithm for video coding – Chen, Chen, et al. - 1994 |
| 5 | A new prediction search algorithm for block motion estimation in video coding – Luo, Zou, et al. - 1997 |
