Share Email Print

Proceedings Paper

Fast full-search block matching using subblocks and successive approximation of the error measure
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper 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.

Paper Details

Date Published: 19 April 2000
PDF: 10 pages
Proc. SPIE 3974, Image and Video Communications and Processing 2000, (19 April 2000); doi: 10.1117/12.382956
Show Author Affiliations
Michael Bruenig, Rheinisch-Westfaelische Technische Hochschule Aachen (United States)
Bernd Menser, Rheinisch-Westfaelische Technische Hochschule Aachen (Germany)

Published in SPIE Proceedings Vol. 3974:
Image and Video Communications and Processing 2000
Bhaskaran Vasudev; T. Russell Hsing; Andrew G. Tescher; Robert L. Stevenson, Editor(s)

© SPIE. Terms of Use
Back to Top