Skip to main content
Article thumbnail
Location of Repository

Single step optimal block matched motion estimation with motion vectors having arbitrary pixel precisions

By Charlotte Yuk-Fan Ho, Bingo Wing-Kuen Ling, Blasi S Giovanni, Zhi-Wei Chi and Wan-Chi Siu

Abstract

This paper proposes a non-linear block matched motion model with motion vectors having arbitrary pixel precisions. The optimal motion vector which minimizes the mean square error is solved analytically in a single step. Our proposed algorithm can be regarded as a generalization of conventional half pixel search algorithms and quarter pixel search algorithms because our proposed algorithm could achieve motion vectors with arbitrary pixel precisions. Also, the computational effort of our proposed algorithm is lower than that of conventional quarter pixel search algorithms because our proposed algorithm could achieve motion vectors in a single step

Topics: H600 Electronic and Electrical Engineering
Publisher: IEEE
Year: 2010
OAI identifier: oai:eprints.lincoln.ac.uk:2718

Suggested articles

Citations

  1. (1996). A locally quadratic model of the motion estimation error criterion function and its application to subpixel interpolations,” doi
  2. (2009). A simple regularizer for B-spline nonrigid image registration that encourages local invertibility,” doi
  3. (2003). Fast half-pixel motion estimation based on directional search and a linear model,” doi
  4. (2008). Jayanta Mukherjee and Shamik Sural, “New pixeldecimation patterns for block matching in motion estimation,” doi
  5. (2002). Jeng-Sheng Yeh and Ming Ouhyoung, “Extracting 3D facial animation parameters from multiview video clips,” doi
  6. (2003). PPHPS: A parabolic prediction-based, fast half-pixel search algorithm for very low bitrate moving-picture coding,” doi

To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.