A BIST-based Solution for the Diagnosis of Embedded Memories Adopting Image Processing Techniques
Journal of Electronic Testing: Theory and Applications
A multimodal approach to time-invariant scene retrieval from single overhead image
Proceedings of the 6th ACM SIGMM international workshop on Multimedia information retrieval
General design algorithm for sparse frame expansions
Signal Processing
Efficient NCC-Based Image Matching Based on Novel Hierarchical Bounds
PCM '09 Proceedings of the 10th Pacific Rim Conference on Multimedia: Advances in Multimedia Information Processing
SMC'09 Proceedings of the 2009 IEEE international conference on Systems, Man and Cybernetics
Efficient normalized cross correlation based on adaptive multilevel successive elimination
ACCV'07 Proceedings of the 8th Asian conference on Computer vision - Volume Part I
Fast normalized cross correlation based on adaptive multilevel winner update
PCM'07 Proceedings of the multimedia 8th Pacific Rim conference on Advances in multimedia information processing
Efficient template matching for multi-channel images
Pattern Recognition Letters
Adaptive Low Resolution Pruning for fast Full Search-equivalent pattern matching
Pattern Recognition Letters
Human eyebrow recognition in the matching-recognizing framework
Computer Vision and Image Understanding
| Hi-index | 0.01 |
Template matching has many applications in signal processing, image processing, pattern recognition, and video compression. This paper proposes a fast coarse-to-fine template matching algorithm for finding the exact best match, i.e., the match that may be found by a full search. This is obtained by pruning the number of candidates in the full search using the results of a coarse search. Experimental results show that speed ups of a couple of orders of magnitude can easily be achieved using this method for typical low-noise cases of two-dimensional (2-D) template matching