This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Skeletonization via the Realization of the Fire Front's Propagation and Extinction in Digital Binary Shapes
October 1989 (vol. 11 no. 10)
pp. 1076-1086

A sequential method of skeletonization for digital binary images is proposed. The method realizes in a discrete plane prairie-fire propagation model. The techniques of contour following is adopted to simulate the simultaneous fire spreading off of the grass perimeter. The algorithm contains two steps: (1) find and mark all of the contours of the input image during a conventional scan. Then, after the borders a 'lighted', (2) repeatedly examine the borders and strip deletable edge points until no more can be removed. In this way only the successive contours, but not the whole image, will be processed. The second step is subdivided as follows: first, the contours representing the current fire fronts are traced, all the edge points are memorized, and the next fire fronts are marked. Second, the algorithm verifies the memorized edge points and those marked only once are removed. Although no neighborhood's test is needed during this stage of peeling, the connectedness of objects to thinning is conserved. Insignificant spurs can, optionally, be removed during thinning.

[1] J. I. Toriwaki and S. Yokoi, "Distance transformations and skeletons of digitized pictures with applications," inProgress in Pattern Recognition, L. N. Kanal and A. Rosenfeld, Eds., vol. 1, 1981, pp. 189- 264.
[2] D. Levine,Vision in Man and Machine, 1984, ch. 10.
[3] A. Rosenfeld and J. L. Pfaltz, "Distance functions on digital pictures,"Pattern Recogn., vol. 1, pp. 33-61, 1968.
[4] C. Arcelli, "A width-independent fast thinning algorithm,"IEEE Trans. Pattern Anal. Machine Intell., vol. PAMI-7, July, 1985.
[5] F. Meyer, "The binary skeleton in three steps,"IEEE Proc. of Comp. Soc. Workshop Comput. Arch. Pattern Anal. Image Database Manage., Miami, FL, Nov., 1985, pp. 470-476.
[6] A. Montanvert, "Medial line: Graph representation and shape description," inProc. 8th ICPR, Paris, France, Oct. 1986, pp. 430- 432.
[7] G. Borgefors, "A new distance transformation approximating the Euclidean distance," inProc. 8th ICPR, Paris, France, 1986, pp. 336- 338.
[8] L. Dorst, "Pseudo-Euclidean skeleton," inProc. 8th ICRP, Paris, France, 1986, pp. 286-288.
[9] C. J. Hilditch, "Linear skeletons from square cupboards,"Machine Intell., vol. 4, pp. 403-420, 1969.
[10] J. L. Pfaltz and A. Rosenfeld, "Computer representations of planar regions by their skeletons,"Commun. Assoc. Comp. Math., vol. 10, pp. 119-122, Feb. 1967.
[11] T. Pavlidis, "A thinning algorithm for discrete binary images,"CGIP, vol. 13, pp. 142-157, 1980.
[12] H. Tamura, "A comparison of line thinning algorithms from digital geometry viewpoint," inProc. 4th ICPR, Kyoto, Japan, 1978, pp. 715-719.
[13] N. J. Naccache and R. Shinghal, "SPTA: A proposed algorithm for thinning binary patterns,"SMC, vol. 14, no. 3, pp. 409-418, 1984.
[14] C. Arcelli, "Pattern thinning by contour tracing,"CGIP, vol. 17, pp. 130-144, 1981.
[15] T. Pavlidis, "A vectorizer and feature extractor for document recognition,"Comput. Vision Graphics, Image Processing, vol. 35, pp. 111-127, 1986.
[16] C. Moreau, "Extraction de formes caractéristiques dans les images de traits," Thèse de 3ème cycle, Univ. Paris 6, Paris, 1985.
[17] R. W. Smith, "Computer processing of line images: A survey,"Patt. Recog., vol. 20, pp. 7-15, 1987.
[18] Y. Xia, "Méthodes d'amincissement d'images binaires," Thèse de docteur de l'UniversitéParis 6, Paris, Mar. 1987.
[19] H. Blum, "A transformation for extracting new descriptors of shape," Symp. Models Percep. Speech Visual Form, M.I.T. Press, Cambridge, MA, 1964.
[20] L. Calabi and W. E. Hartnett, "Shape recognition, prairie fires, convex deficiencies and skeletons,"Amer. Math. Monthly, vol. 75, no. 4, pp. 335-342, Apr. 1968.
[21] G. Matheron, "Some topological properties of the skeleton,"Adv. Math. Morphology.
[22] U. Montanari, "Continuous skeletons from digitized images,"J. Assoc. Comput. Machinery, vol. 16, pp. 534-549, Oct. 1969.
[23] F. Bookstein, "The line-skeleton,CGIP, vol. 11, pp. 123-137, 1979.
[24] S. Suzuki and K. Abe, "Sequential thinning of binary pictures using distance transformation," inProc. 8th ICPR, Paris, 1986, pp. 289- 292.
[25] M. Born and E. Wolf,Principles of Optics. New York: Pergamon, 1975, 5th ed.
[26] A. Rosenfeld and A. Kak,Digital Picture Processing, New York: Academic, 1976.
[27] R. O. Duda and P. E. Hart,Pattern Classification and Scene Analysis. New York: Wiley, 1973.
[28] Y. Xia, "A new thinning algorithm for binary images," inProc. 8th ICPR, Paris, France, 1986, pp. 995-997.
[29] A. Rosenfeld, "A characterization of parallel thinning algorithm,"Inform. Contr., vol. 29, pp. 286-291, 1975.
[30] J. C. Simon, "Tutorial on text recognition,"8th ICRP, Paris, France, 1986.
[31] J. C. Simon,Patterns and Operators: The Foundations of Data Representation. London, England: North Oxford Academic Publishers, 1986.
[32] Y. Xia, "Minimizing the computing complexity of iterative sequential thinning algorithm,"Proc. 9th ICPR, Rome, Italy, 1988.

Index Terms:
computerised picture processing; computerised pattern recognition; digital binary shapes; sequential method; skeletonization; prairie-fire propagation model; edge points; thinning; computerised pattern recognition; computerised picture processing
Citation:
Y. Xia, "Skeletonization via the Realization of the Fire Front's Propagation and Extinction in Digital Binary Shapes," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 11, no. 10, pp. 1076-1086, Oct. 1989, doi:10.1109/34.42838
Usage of this product signifies your acceptance of the Terms of Use.