A fast thinning algorithm

Abstract

This paper describes a fast thinning algorithm (FTA). This algorithm possesses two main steps, that are repeated until the obtained image approaches the medium axis of the original image. In the first step the contour of the image is marked and in the second step the contour marked is analysed to verify which pixels-on belonging to this contour should be deleted. The FTA algorithm maintains the connectivity and preserves the end points of the final image of the skeleton. It is practically immune to noise and, of extreme importance, has a shorter execution time. Several tests are carried out and the results obtained are very satisfactory.