Generating skeletons and centerlines from the medial axis transform

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.<<ETX>>

[1]  Azriel Rosenfeld,et al.  Some Parallel Thinning Algorithms for Digital Pictures , 1971, JACM.

[2]  P. Danielsson Euclidean distance mapping , 1980 .

[3]  Ching Y. Suen,et al.  A fast parallel algorithm for thinning digital patterns , 1984, CACM.

[4]  Nabil Jean Naccache,et al.  SPTA: A proposed algorithm for thinning binary patterns , 1984, IEEE Transactions on Systems, Man, and Cybernetics.

[5]  Gabriella Sanniti di Baja,et al.  A Width-Independent Fast Thinning Algorithm , 1985, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[6]  Gunilla Borgefors,et al.  Distance transformations in digital images , 1986, Comput. Vis. Graph. Image Process..

[7]  Lucas J. van Vliet,et al.  A contour processing method for fast binary neighbourhood operations , 1988, Pattern Recognit. Lett..

[8]  Gabriella Sanniti di Baja,et al.  Finding local maxima in a pseudo-Euclidian distance transform , 1988, Comput. Vis. Graph. Image Process..