Share Email Print
cover

Proceedings Paper

Improved fast block matching algorithm in the feature domain
Author(s): Yiu-Hung Fok; Oscar Chi Lim Au
Format Member Price Non-Member Price
PDF $14.40 $18.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper Abstract

A fast block matching algorithm in the feature domain was proposed by Fok and Au with a computation reduction factor of N/2 for a search block size of N X N. Although the algorithm can achieve close-to-optimal result, it requires a large amount of memory to store the features. This paper presents three improved fast block matching algorithms in the integral projections feature domain which can also reduce the computation significantly but with a considerably lower memory requirement. With a search block size of N X N, two of our algorithms retain a computation reduction factor of N/2 while the other one can achieve a computation reduction factor of N. The three algorithms can achieve close-to-optimal performance in mean absolute difference sense.

Paper Details

Date Published: 16 September 1994
PDF: 12 pages
Proc. SPIE 2308, Visual Communications and Image Processing '94, (16 September 1994); doi: 10.1117/12.185939
Show Author Affiliations
Yiu-Hung Fok, Hong Kong Univ. of Science and Technology (Hong Kong)
Oscar Chi Lim Au, Hong Kong Univ. of Science and Technology (Hong Kong)


Published in SPIE Proceedings Vol. 2308:
Visual Communications and Image Processing '94
Aggelos K. Katsaggelos, Editor(s)

© SPIE. Terms of Use
Back to Top