Efficient block-matching motion estimation algorithm

Shu-Mei Guo; Chih-Yuan Hsu

doi:10.1117/1.JEI.22.2.023016

22 May 2013 Efficient block-matching motion estimation algorithm

Shu-Mei Guo, Chih-Yuan Hsu

Author Affiliations +

Journal of Electronic Imaging, Vol. 22, Issue 2, 023016 (May 2013). https://doi.org/10.1117/1.JEI.22.2.023016

Abstract

Block-matching motion estimation (ME) is a principal process for most existing video compression standards, but it has a significant impact on computation overhead. An efficient block-matching algorithm is proposed for ME. The proposed algorithm consists of three effective steps: (1) apply the full search (FS) algorithm to construct a polynomial interpolation model from the group with four skipping frames to determine near-optimal global motion vector (MV) for the initial search point, (2) perform an adaptive search pattern in the interpolation step to refine the MV and (3) use the half-way stop technique to reduce search points. Experimental results show that the proposed algorithm achieves a maximum speed-up factor of 366.47 with only 0.52% peak signal-to-noise ratio (PSNR) degradation in comparison with the FS algorithm.

Citation Download Citation

Shu-Mei Guo and Chih-Yuan Hsu "Efficient block-matching motion estimation algorithm," Journal of Electronic Imaging 22(2), 023016 (22 May 2013). https://doi.org/10.1117/1.JEI.22.2.023016

Published: 22 May 2013

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