Share Email Print
cover

Proceedings Paper

Implementation of SKIPSM for 3D binary morphology
Author(s): Frederick M. Waltz
Format Member Price Non-Member Price
PDF $14.40 $18.00

Paper Abstract

The SKIPSM finite-state machine image processing paradigm can be extended to 3-dimensional (and to n-dimensional) image processing in a very straightforward way. Two-dimensional SKIPSM involves an R-machine (row machine) and a C-machine (column machine) in sequence (in either order). Three- dimensional SKIPSM uses what will be called X-machines, Y- machines, and Z-machines (in any order). This means that large 3-D structuring elements can be applied to 3-D images in a single scan through the image, with three lookup-table accesses per volume element, and no other operations, regardless of the size of the structuring element. It is even possible to apply more than one 3-D structuring element simultaneously, with no increase in execution time. For binary erosion, which has interesting applications to the 3-D packing problem, many of the same lookup tables used for 2-D erosion can be used for 3-D erosion. This implies that the same software programs used to create these 2-D lookup tables can be used for 3-D tables, so that no new tools are required. For 3-D dilation, some changes are required, but all the tables needed can be created in a routine way from the corresponding 3-D erosion tables. A brief discussion of the use of SKIPSM for 3-D operations other than binary erosion and dilation is also included.

Paper Details

Date Published: 18 September 1997
PDF: 10 pages
Proc. SPIE 3205, Machine Vision Applications, Architectures, and Systems Integration VI, (18 September 1997); doi: 10.1117/12.285564
Show Author Affiliations
Frederick M. Waltz, Consultant (United States)


Published in SPIE Proceedings Vol. 3205:
Machine Vision Applications, Architectures, and Systems Integration VI
Susan Snell Solomon; Bruce G. Batchelor; John W. V. Miller, Editor(s)

© SPIE. Terms of Use
Back to Top