Motion vector context-based adaptive 3-D recursive search block matching motion estimation

  • Authors:
  • Zhang Zong-Ping;Liu Kun;Peng Ji-Hu

  • Affiliations:
  • EDA Key Lab. Research Institute of Tsinghua University in Shenzhen, Shenzhen, P.R.China and Department of Electronic Engineering, Tsinghua University, Beijing, P.R.China;EDA Key Lab. Research Institute of Tsinghua University in Shenzhen, Shenzhen, P.R.China;EDA Key Lab. Research Institute of Tsinghua University in Shenzhen, Shenzhen, P.R.China and Department of Electronic Engineering, Tsinghua University, Beijing, P.R.China

  • Venue:
  • ISCGAV'05 Proceedings of the 5th WSEAS International Conference on Signal Processing, Computational Geometry & Artificial Vision
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper, based on the analysis to relationship between the currently being processed block and its neighbors, a motion vector context-based adaptive 3-D recursive search (MVCA-3DRS) block matching motion estimation algorithm is developed. In the proposed algorithm, the candidate vectors are partitioned into two categories, one stationary vector implying the current block belongs to one of neighboring large objects, one nonstationary vector implying the current block either belongs to one of neighboring small objects, or is a new object, then predicted with extended vector median estimator and anti-median estimator as well as random-updated estimator based on the spatial-temporal motion vector contexts. The simulation results show that the proposed algorithm can significantly improve the consistence of the resulting motion vector field. Test experiments on motion-compensation (MC) deinterlaced system with typical video sequences confirm that, compared with the 3DRS algorithm, the proposed MVCA-3DRS can significantly improve the interpolated images quality. Although introducing the additional vector filtering operations, the proposed algorithm still can maintain a comparative computation complexity with that of the 3DRS algorithm due to its shrink to the number of candidate vectors.