Translator Disclaimer
15 April 1997 Hierarchical distributed template matching
Author Affiliations +
Abstract
We propose Hierarchical Distributed Template Matching, which reduces the computational cost of template matching, while maintaining the same reliability as conventional template matching. To achieve cost reduction without loss of reliability, we first evaluate the correlation of shrunken images in order to select the maximum depth of the hierarchy. Then, for each level of hierarchy, we choose a small number of template points in the original template and build a sparse distributed template. The locations of the template points are optimized, so that they yield a distinct peak in the correlation score map. Experimental results demonstrate that our method can reduce the computational cost to less than 1/10 that of conventional hierarchical template matching. We also confirmed that the precision is 0.6 pixels.
© (1997) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Miwako Hirooka, Kazuhiko Sumi, Manabu Hashimoto, Haruhisa Okuda, and Shinichi Kuroda "Hierarchical distributed template matching", Proc. SPIE 3029, Machine Vision Applications in Industrial Inspection V, (15 April 1997); https://doi.org/10.1117/12.271240
PROCEEDINGS
8 PAGES


SHARE
Advertisement
Advertisement
RELATED CONTENT


Back to Top