Sub-pixel motion estimation with 3-D recursive search block-matching

Gerard de Haan, Paul W.A.C. Biezen

Research output: Contribution to journalArticleAcademicpeer-review

83 Citations (Scopus)

Abstract

Recently the 3-D Recursive Search Block-Matching algorithm was introduced as a high quality, low-cost, true-motion estimation method suitable for critical field rate conversion applications. In this article an extension of the algorithm is presented that provides a sub-pixel accuracy of the estimated motion vectors. This significantly broadens the applicability of the algorithm in the area of interlaced-to-sequential scan conversion and coding. The extension is such that it hardly adds any calculational complexity, which implies that the attractiveness of the algorithm for a VLSI implementation remains high. Even more, a simplified version of the algorithm, the Y-prediction block-matcher, is suggested that offers sub-pixel accuracy, a large range of motion vectors, and an extremely low complexity requiring only four candidate vectors per block. An evaluation of this estimator is included in the paper.

Original languageEnglish
Pages (from-to)229-239
Number of pages11
JournalSignal Processing : Image Communication
Volume6
Issue number3
DOIs
Publication statusPublished - Jun 1994
Externally publishedYes

Keywords

  • Motion estimation
  • Scan rate conversion
  • Sub-pixel accuracy

Fingerprint

Dive into the research topics of 'Sub-pixel motion estimation with 3-D recursive search block-matching'. Together they form a unique fingerprint.

Cite this