A complexity-bounded motion estimation algorithm

doi:10.1109/TIP.2002.999673

2002-04-01

PRE

Antonio Chimienti *

Claudia Ferraris

Danilo Pau

DOI：10.1109/TIP.2002.999673

原文链接

原文求助

摘要

En 中文

The full search motion estimation algorithm for video coding is a procedure of high computational cost. For this reason, in real-time low-power applications, low-cost motion estimation algorithms are viable solutions. A novel reduced complexity motion estimation algorithm is presented in this paper. It conjugates the reduction of computational load with good encoding efficiency. It exploits the past history of the motion field to predict the current motion field. A successive refinement phase gives the final motion field. This approach leads to a sensible reduction in the number of motion vector that have to be tested. The complexity is lower than any other algorithm aligorithms known to the authors, in literature, it is constant as there is no recursivity in the algorithm and independent of any search window area size. Experimental evaluations have shown the robustness of the algorithm when applied on a wide set of video sequences-a good performance compared to other reduced complexity algorithms and negligible loss of efficiency versus the full search algorithm.

Keyword:

block matching

low bit-rate video coding

motion estimation

predictive motion estimation