Share Email Print

Proceedings Paper

Software SKIPSM implementation for template matching
Format Member Price Non-Member Price
PDF $14.40 $18.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper Abstract

This paper presents an updated version of a general method for carrying out binary template matching, which is useful for image analysis in general and automated visual inspection and quality control in particular. In a series of 23 papers, image processing implementations based on the SKIPSM (Separated- Kernel Image Processing using finite-State Machines) paradigm have been shown to be faster or much faster than conventional implementations. One of the earliest of these papers, published in 1994, was devoted to binary template matching of various types. As with all the papers of that era, the theory was presented in general form but the specific applications used LUTs (lookup tables) and pipelined hardware. The results were impressive - templates 35x35 or even larger could be executed in the same time as the identical hardware, programmed conventionally, could execute a 3x3 template. This paper develops and extends the same basic approach to provide fast and highly efficient binary template matching on ordinary desktop computers. This implementation does not use LUTs, because computers with pipelined instruction streams and vector data structures perform relatively slowly when using LUTs.

Paper Details

Date Published: 12 February 2001
PDF: 10 pages
Proc. SPIE 4189, Machine Vision and Three-Dimensional Imaging Systems for Inspection and Metrology, (12 February 2001); doi: 10.1117/12.417210
Show Author Affiliations
Frederick M. Waltz, Consultant (United States)
John W. V. Miller, Univ. of Michigan/Dearborn (United States)

Published in SPIE Proceedings Vol. 4189:
Machine Vision and Three-Dimensional Imaging Systems for Inspection and Metrology
Kevin G. Harding; John W. V. Miller; Bruce G. Batchelor, Editor(s)

© SPIE. Terms of Use
Back to Top