Fast block search using Haar decomposition

Jarkko Kari, Gang Liang, Simant Dube, Keith Kenemer, David W. Gillman · Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE · 2000

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.

Read the paper · More papers on PaperTik