Paper
3 October 1995 Extending the SKIPSM binary skeletonization implementation
Ahti A. Hujanen, Frederick M. Waltz
Author Affiliations +
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.
© (1995) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Ahti A. Hujanen and Frederick M. Waltz "Extending the SKIPSM binary skeletonization implementation", Proc. SPIE 2597, Machine Vision Applications, Architectures, and Systems Integration IV, (3 October 1995); https://doi.org/10.1117/12.223968
Lens.org Logo
CITATIONS
Cited by 12 scholarly publications.
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Binary data

Image processing

Algorithm development

Computer programming

Inspection

Reconstruction algorithms

Selenium

Back to Top