Fast motion estimation algorithm for MPEG-2 video encoding

Minhua Zhou

doi:10.1117/12.334659

28 December 1998 Fast motion estimation algorithm for MPEG-2 video encoding

Minhua Zhou

Proceedings Volume 3653, Visual Communications and Image Processing '99; (1998) https://doi.org/10.1117/12.334659
Event: Electronic Imaging '99, 1999, San Jose, CA, United States

Abstract

In this paper a fast motion estimation algorithm is proposed for the MPEG-2 video encoding. This algorithm is based on a hybrid use of the block matching technique and gradient technique. For estimation a motion vector, the block matching technique is used for selecting the initial vector from the spatial neighboring macroblocks and the temporally co-located macroblock, then the gradient technique is applied to obtain the final vector by a pixel-recursive refinement of the initial vector. In addition, an adaptive scheme to determine the search range is developed to enable the low latency motion estimation when the gradient technique is involved. The simulation results reveal that the proposed algorithm shares a high speed of while preserves the coding efficiency compared with the full search block matching technique.

Citation Download Citation

Minhua Zhou "Fast motion estimation algorithm for MPEG-2 video encoding", Proc. SPIE 3653, Visual Communications and Image Processing '99, (28 December 1998); https://doi.org/10.1117/12.334659

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available