About cookies on this site Our websites require some cookies to function properly (required). In addition, other cookies may be used with your consent to analyze site usage, improve the user experience and for advertising. For more information, please review your options. By visiting our website, you agree to our processing of information as described in IBM’sprivacy statement. To provide a smooth navigation, your cookie preferences will be shared across the IBM web domains listed here.
Publication
ICPR 1990
Conference paper
Generating skeletons and centerlines from the medial axis transform
Abstract
An algorithm for generating connected skeletons of objects in binary images is described. Three main properties of the algorithm are that (1) it is noniterative, taking a fixed number of passes through the image to produce the skeleton regardless of the width of the objects; (2) it is based on a distance transform that uses a good approximation to the Euclidean distance, giving skeletons that are well-centered and robust with respect to rotation; and (3) the skeletons it produces are connected. In addition, the skeletons are thin and allow the objects to be nearly reconstructed. The algorithm can also be run in a mode to produce centerlines, a connected approximation to the skeleton that is less sensitive to border noise and that is useful in image analysis applications.