Fast Template Matching by Applying Winner-Update on Walsh-Hadamard Domain
Lists
Only you see this
Abstract
Fast template matching is strongly demanded for many practical applications related to computer vision and image processing. In this paper, we propose a fast template matching method by applying the winner-update strategy on the Walsh-Hadamard domain. By taking advantage of the nice energy packing property of the Walsh-Hadamard transformation, we can just apply the winner-update process with a small number of Walsh-Hadamard coefficients to reduce the computational burden for template matching in an image. Experimental results demonstrate the efficiency and robustness of the proposed template matching algorithm under different noise levels.
BibTeX
@inproceedings{wei2007fast,
author = {Shou-Der Wei and Shao-Wei Liu and Shang-Hong Lai},
title = {{Fast Template Matching by Applying Winner-Update on Walsh-Hadamard Domain}},
booktitle = {IEEE International Conference on Acoustics, Speech and Signal Processing},
year = {2007},
doi = {10.1109/icassp.2007.366086},
}Loading related content...