ABSTRACT
Thick objects in a discrete binary image are often reduced to thinner representations called skeletons, which are similar to stick figures. Most skeletonizing algorithms iteratively erode the contours in a binary image until thin skeletons or single pixels remain. These algorithms typically examine the neighborhood of each contour pixel and identify those pixels that can be deleted and those that can be classified as skeletal pixels.
