Share Email Print

Proceedings Paper

Hierarchical distributed template matching
Author(s): Miwako Hirooka; Kazuhiko Sumi; Manabu Hashimoto; Haruhisa Okuda; Shinichi Kuroda
Format Member Price Non-Member Price
PDF $17.00 $21.00

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

Paper Details

Date Published: 15 April 1997
PDF: 8 pages
Proc. SPIE 3029, Machine Vision Applications in Industrial Inspection V, (15 April 1997); doi: 10.1117/12.271240
Show Author Affiliations
Miwako Hirooka, Mitsubishi Electric Corp. (Japan)
Kazuhiko Sumi, Mitsubishi Electric Corp. (Japan)
Manabu Hashimoto, Mitsubishi Electric Corp. (Japan)
Haruhisa Okuda, Mitsubishi Electric Corp. (Japan)
Shinichi Kuroda, Mitsubishi Electric Corp. (Japan)

Published in SPIE Proceedings Vol. 3029:
Machine Vision Applications in Industrial Inspection V
A. Ravishankar Rao; Ning S. Chang, Editor(s)

© SPIE. Terms of Use
Back to Top