Adaptive dual-cross search algorithm for block-matching motion estimation

X.-Q. Banh

doi:10.1109/TCE.2004.1309460

2004-05-01

PRE

X.-Q. Banh

Yap‐Peng Tan

DOI：10.1109/TCE.2004.1309460

原文链接

原文求助

摘要

En 中文

We present in this poper two new and efficient block- matching algorithms (BMAs) for fast motion estimation used in motion-compensated video compression. The proposed algorithms are improvement of existing BMAs and consist of three effective steps: 1) Initial search center prediction, 2) Early search termination, and 3) dital-cross pattern search. Extensive simulation results and comparative analysis have shown that the proposed algorithms outperform conventional algorithms, like the three-step search, orthogonal search and diamond search, as well as the newly proposed algorithms, like the hexagonal search and adaptive rood pattern search, in terms of both video peak signal-to-noise ratio and the number of checking points evaluated.

Keyword:

block-matching algorithm

dual-cross patterns

early search termination

fast motion estimation

initial search center prediction