Efficient block-matching motion estimation algorithm

Shu-Mei Guo, Chih Yuan Hsu

Research output: Contribution to journalArticle

1 Citation (Scopus)

Abstract

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.

Original languageEnglish
Article number023016
JournalJournal of Electronic Imaging
Volume22
Issue number2
DOIs
Publication statusPublished - 2013 Apr 1

Fingerprint

Motion estimation
interpolation
Interpolation
video compression
Image compression
Signal to noise ratio
polynomials
signal to noise ratios
Polynomials
degradation
Degradation

All Science Journal Classification (ASJC) codes

  • Atomic and Molecular Physics, and Optics
  • Computer Science Applications
  • Electrical and Electronic Engineering

Cite this

@article{3b616f5535c549d885e8f6355a90d984,
title = "Efficient block-matching motion estimation algorithm",
abstract = "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.",
author = "Shu-Mei Guo and Hsu, {Chih Yuan}",
year = "2013",
month = "4",
day = "1",
doi = "10.1117/1.JEI.22.2.023016",
language = "English",
volume = "22",
journal = "Journal of Electronic Imaging",
issn = "1017-9909",
publisher = "SPIE",
number = "2",

}

Efficient block-matching motion estimation algorithm. / Guo, Shu-Mei; Hsu, Chih Yuan.

In: Journal of Electronic Imaging, Vol. 22, No. 2, 023016, 01.04.2013.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Efficient block-matching motion estimation algorithm

AU - Guo, Shu-Mei

AU - Hsu, Chih Yuan

PY - 2013/4/1

Y1 - 2013/4/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=84892750095&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84892750095&partnerID=8YFLogxK

U2 - 10.1117/1.JEI.22.2.023016

DO - 10.1117/1.JEI.22.2.023016

M3 - Article

VL - 22

JO - Journal of Electronic Imaging

JF - Journal of Electronic Imaging

SN - 1017-9909

IS - 2

M1 - 023016

ER -