Share Email Print

Proceedings Paper

Extending the SKIPSM binary skeletonization implementation
Author(s): Ahti A. Hujanen; Frederick M. Waltz
Format Member Price Non-Member Price
PDF $14.40 $18.00

Paper Abstract

Skeletonization of binary images is an essential step in the inspection of many products, most notably printed circuit boards. It also is used in many other situations, an unusual example being the location of branching points on growing plants for purposes of cutting and vegetative propagation. Commercially available image processing boards typically cannot perform this operation, although they readily perform the easier task of repeated binary erosion. It has been shown that, in addition to hundreds of other image processing operations, the inexpensive standard SKIPSM (separated-kernel image processing using finite state machines) architecture can be used to implement binary skeletonization in one pipelined pass per stage of erosion. This paper considers the feasibility of extending the SKIPSM skeletonization implementation to obtain 'hairless' skeletons by using Jang and Chin's algorithm instead of Floeder's algorithm as used in the first implementation.

Paper Details

Date Published: 3 October 1995
PDF: 9 pages
Proc. SPIE 2597, Machine Vision Applications, Architectures, and Systems Integration IV, (3 October 1995); doi: 10.1117/12.223968
Show Author Affiliations
Ahti A. Hujanen, 3M Co. (United States)
Frederick M. Waltz, Consultant (United States)

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

© SPIE. Terms of Use
Back to Top