Fast full-search block matching

  • Authors:
  • M. Brunig;W. Niehsen

  • Affiliations:
  • Inst. of Commun. Eng., Aachen Univ. of Technol.;-

  • Venue:
  • IEEE Transactions on Circuits and Systems for Video Technology
  • Year:
  • 2001

Quantified Score

Hi-index 0.00

Visualization

Abstract

A fast full-search block-matching algorithm is developed. The matching criterion is the sum of absolute differences or the mean-square error. The algorithm evaluates lower bounds for the matching criteria for subdivided blocks in order to reduce the number of search positions. It also uses the lower bounds for a fast calculation of the matching criterion for the remaining search positions. The computational complexity of the algorithm is evaluated and compared to the three-step search strategy. The search result of the algorithm is identical to the search result of the exhaustive search