Fast full-search block matching

Author

Brünig, Michael ; Niehsen, Wolfgang

Author_Institution

Inst. of Commun. Eng., Aachen Univ. of Technol., Germany

Volume

11

Issue

2

fYear

2001

fDate

2/1/2001 12:00:00 AM

Firstpage

241

Lastpage

247

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

Keywords

computational complexity; data compression; image matching; image sequences; mean square error methods; motion estimation; search problems; video coding; MSE; computational complexity; exhaustive search; fast full-search block-matching algorithm; high compression ratio; image sequence coding; lower bounds; matching criteria; mean-square error; sum of absolute differences; three-step search strategy; video compression; Computational complexity; Decoding; Gain measurement; Image coding; Image sequences; MPEG 4 Standard; Motion estimation; PSNR; Redundancy; Sea measurements;

fLanguage

English

Journal_Title

Circuits and Systems for Video Technology, IEEE Transactions on

Publisher

ieee

ISSN

1051-8215

Type

jour

DOI

10.1109/76.905989

Filename

905989