Paper
3 October 1994 Fast computation of the grassfire transform using SKIPSM
Frederick M. Waltz, Hichem H. Garnaoui
Author Affiliations +
Proceedings Volume 2347, Machine Vision Applications, Architectures, and Systems Integration III; (1994) https://doi.org/10.1117/12.188751
Event: Photonics for Industrial Applications, 1994, Boston, MA, United States
Abstract
The principles of SKIPSM (Separated-Kernel Image Processing using Finite State Machines), a powerful new way to implement many standard image processing operations, are presented here and in a group of companion papers. This paper describes the application of SKIPSM to the computation of the Grassfire Transform (GT), the mapping of a binary image into a grey-level image in such a way that the output grey level of each interior pixel of each individual blob is proportional to the distance of that pixel from the blob boundary. Distance can be defined in terms of various norms: Euclidean distance, elliptical distance, 'boxcar' distance, etc. While potentially very useful, the GT has seen limited application because of the many computational steps required to calculate it. In comparison with conventional hardware-based and software-based approaches, SKIPSM allows implementation of the GT at higher speeds and/or lower hardware cost. The key developments upon which this improved performance is based are (1) the separation of 2D the binary erosions on which the GT is based into row operations followed by column operations, (2) the formulation of these row and column operations in a form compatible with pipelined operation, (3) the implementation of the resulting operations as simple finite-state machines, (4) the automated generation of the finite-state machine configuration data for structuring elements (SEs), and (5) the simultaneous application of all these nested SEs in a single pipeline pass. Some key features of SKIPSM, as applied to the GT, are listed below: (1) Because the SEs can be large and arbitrary, any distance measure can be used. There is no penalty involved in using true circles or ellipses, rather that the octagons or squares resulting from sequential application of 3 X 3 SEs. (2) The simultaneous application of six circular erosion stages (SEs of size 3 X 3, 5 X 5, ..., 13 X 13) has already been demonstrated. Eight or more simultaneous circular erosion stages may be possible (sizes 3 X 3, 5 X 5, ..., 17 X 17, ...). (3) The user specifies the SE or SEs. All other steps are automated. These results are can be achieved using conventional pipelined hardware in this new way. Alternatively, inexpensive off-the-shelf 'chips' can be configured to carry out the same operations as conventional image processing hardware. Corresponding 'speedups' are achieved in software-based implementations.2347
© (1994) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Frederick M. Waltz and Hichem H. Garnaoui "Fast computation of the grassfire transform using SKIPSM", Proc. SPIE 2347, Machine Vision Applications, Architectures, and Systems Integration III, (3 October 1994); https://doi.org/10.1117/12.188751
Lens.org Logo
CITATIONS
Cited by 18 scholarly publications.
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Selenium

Binary data

Image processing

Sensors

Lithium

Stereolithography

Computer programming

RELATED CONTENT

Execution speed comparisons for binary morphology
Proceedings of SPIE (August 27 1999)
Coding for higher-order partial-response channels
Proceedings of SPIE (December 08 1995)
Parallel architectures for binary image algebra
Proceedings of SPIE (November 01 1990)
Application of SKIPSM to grey-level morphology
Proceedings of SPIE (October 03 1994)
Application of SKIPSM to binary morphology
Proceedings of SPIE (October 03 1994)
Note on a new class of metrics: touching metrics
Proceedings of SPIE (September 30 1996)

Back to Top