Share Email Print

Proceedings Paper

Automated generation of finite-state machine lookup tables for binary morphology
Author(s): Frederick M. Waltz
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper Abstract

In a series of eleven previous papers a radically different method of implementing a wide range of neighborhood image processing operations has been presented, under the acronym SKIPSM (separated-kernel image processing using finite state machines). Simply by changing the contents of two lookup tables, one can use the same software code or the same hardware configuration can carry out a long list of operations, including binary morphology with multiple large structuring elements, multiple simultaneous steps of the grassfire transform, 'fuzzy' binary morphological operations, grey-level morphology, binary skeletonization, binary correlation, binary openings and closings in one pass, and certain global image processing operations. The execution time is very fast, and is totally independent of the size of the neighborhood or of the number of simultaneous operations being performed. This paper gives a detailed description of the steps for creating lookup tables for binary morphology.

Paper Details

Date Published: 31 October 1996
PDF: 10 pages
Proc. SPIE 2908, Machine Vision Applications, Architectures, and Systems Integration V, (31 October 1996); doi: 10.1117/12.257271
Show Author Affiliations
Frederick M. Waltz, Consultant (United States)

Published in SPIE Proceedings Vol. 2908:
Machine Vision Applications, Architectures, and Systems Integration V
Susan Snell Solomon; Bruce G. Batchelor; Frederick M. Waltz, Editor(s)

© SPIE. Terms of Use
Back to Top
Sign in to read the full article
Create a free SPIE account to get access to
premium articles and original research
Forgot your username?