Fast full-search block matching using subblocks and successive approximation of the error measure

Michael Bruenig; Bernd Menser

doi:10.1117/12.382956

19 April 2000 Fast full-search block matching using subblocks and successive approximation of the error measure

Michael Bruenig, Bernd Menser

Proceedings Volume 3974, Image and Video Communications and Processing 2000; (2000) https://doi.org/10.1117/12.382956
Event: Electronic Imaging, 2000, San Jose, CA, United States

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.

Citation Download Citation

Michael Bruenig and Bernd Menser "Fast full-search block matching using subblocks and successive approximation of the error measure", Proc. SPIE 3974, Image and Video Communications and Processing 2000, (19 April 2000); https://doi.org/10.1117/12.382956

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available