Fast block search using Haar decomposition

Jarkko Kari; Gang Liang; Simant Dube; Keith Kenemer; David W. Gillman

doi:10.1117/12.383025

19 April 2000 Fast block search using Haar decomposition

Jarkko Kari, Gang Liang, Simant Dube, Keith Kenemer, David W. Gillman

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

Abstract

We propose and analyze a new technique of fast block matching for motion estimation applications. The technique is based on computing lower bounds for the mean square difference between blocks in their Haar decomposition, using only as few Haar coefficients as is necessary. The algorithm always finds the optimal solution under the mean square error metric. Experiments show a significant speed-up over the exhaustive search algorithm.

Citation Download Citation

Jarkko Kari, Gang Liang, Simant Dube, Keith Kenemer, and David W. Gillman "Fast block search using Haar decomposition", Proc. SPIE 3974, Image and Video Communications and Processing 2000, (19 April 2000); https://doi.org/10.1117/12.383025

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