In pattern recognition, thinning algorithms are often a useful tool to represent a digital pattern by means of a skeletonized image, consisting of a set of one-pixel-width lines that highlight the significant features interest in applying thinning directly to gray-scale images, motivated by the desire of processing images characterized by meaningful information distributed over different levels of gray intensity. In this paper, a new algorithm is presented which can skeletonize both black-white and gray pictures. This algorithm is based on the gray distance transformation and can be used to process any non-well uniformly distributed gray-scale picture and can preserve the topology of original picture. This process includes a preliminary phase of investigation in the 'hollows' in the gray-scale image; these hollows are considered not as topological constrains for the skeleton structure depending on their statistically significant depth. This algorithm can also be executed on a parallel machine as all the operations are executed in local. Some examples are discussed to illustrate the algorithm.
[1]
Prabir Bhattacharya,et al.
Image processing and pattern recognition by polynomial approach
,
1989
.
[2]
Ezzatollah Salari,et al.
The ridge-seeking method for obtaining the skeleton of digital images
,
1984,
IEEE Transactions on Systems, Man, and Cybernetics.
[3]
Georg E. Schulz,et al.
Principles of Protein Structure
,
1979
.
[4]
Carlo Arcelli,et al.
Finding grey-skeletons by iterated pixel removal
,
1995,
Image Vis. Comput..
[5]
Keiichi Abe,et al.
Thinning of Gray-Scale Images with Combined Sequential and Parallel Conditions for Pixel Removal
,
1992,
IEEE Trans. Syst. Man Cybern. Syst..
[6]
Frank Y. Shih,et al.
Skeletonization for fuzzy degraded character images
,
1996,
IEEE Trans. Image Process..
[7]
A. ROSENFELD,et al.
Distance functions on digital pictures
,
1968,
Pattern Recognit..