21 May 1993 Watershed segmentation of binary images using distance transformations
Author Affiliations +
A common problem with binary images generated by a segmentation algorithm is to split the domains either into different objects or an object into different parts. While it is easy to do this interactively by drawing lines in the image it is a much more difficult task to formulate rules for this operation in a computer language and thus automate the procedure. This paper presents a fast algorithm that yields results very similar to an interactive splitting procedure for the domains of a binary image. The algorithm is based on watershed segmentation using distance transformations. We let a pixel belong to a watershed line if at least two neighbors belong to differently labeled segments. We have criteria for relabeling segments which do not become large enough to form segments of their own. After having labeled all pixels we replace every watershed line with the lines with shortest distances. The algorithm preserves the shape and the number of segments with good accuracy and is also independent of how the domains are rotated in the image.
© (1993) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Curt L. Orbert, Ewert W. Bengtsson, Bo G. Nordin, "Watershed segmentation of binary images using distance transformations", Proc. SPIE 1902, Nonlinear Image Processing IV, (21 May 1993); doi: 10.1117/12.144751; https://doi.org/10.1117/12.144751


Text segmentation for automatic document processing
Proceedings of SPIE (January 07 1999)
Length estimation of digital curves
Proceedings of SPIE (September 23 1999)
Ad hoc segmentation pipeline for microarray image analysis
Proceedings of SPIE (February 17 2006)
Automatic annotation of outdoor photographs
Proceedings of SPIE (January 24 2011)

Back to Top