Share Email Print

Proceedings Paper

Fast block search using Haar decomposition
Author(s): Jarkko Kari; Gang Liang; Simant Dube; Keith Kenemer; David W. Gillman
Format Member Price Non-Member Price
PDF $17.00 $21.00

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

Paper Details

Date Published: 19 April 2000
PDF: 4 pages
Proc. SPIE 3974, Image and Video Communications and Processing 2000, (19 April 2000); doi: 10.1117/12.383025
Show Author Affiliations
Jarkko Kari, Univ. of Iowa (United States)
Gang Liang, Intel Corp. (United States)
Simant Dube, STMicroelectronics, Inc. (United States)
Keith Kenemer, Nortel Networks (United States)
David W. Gillman, Iterated Systems, Inc. (United States)

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