Fast Template Matching by Applying Winner-Update on Walsh-Hadamard Domain

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

Full description

Saved in:
Bibliographic Details
Main Authors: Shou-Der Wei, Shao-Wei Liu, Shang-HongLai
Format: Conference Proceeding
Language:English
Subjects:
Application software
Computer science
Computer vision
Distortion measurement
Frequency
Image processing
Noise level
Noise robustness
Pattern matching
Template matching
Video compression
Walsh-Hadmard
Winner update
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:1520-6149
2379-190X
DOI:10.1109/ICASSP.2007.366086