This Article 
 Bibliographic References 
 Add to: 
Boundary-Constrained Morphological Skeleton Minimization and Skeleton Reconstruction
February 1994 (vol. 16 no. 2)
pp. 201-208

A new algorithm for minimizing a morphological skeleton entitled boundary-constrained skeleton minimization (BCSM), as well as a new algorithm for reconstructing an original image from its minimized skeletal structure termed boundary-constrained skeleton reconstruction (BCSR), are proposed. The new algorithms are shown to reduce data storage requirements from (N+1) binary images represented as separate skeleton subsets with their corresponding indices, to 2 binary images composed of a binary morphological skeleton and its corresponding morphological boundary structure. In addition to a reduction in memory storage, BCSM and BCSR result in substantial savings in computational complexity. The proposed algorithms are evaluated in the context of image analysis and coding, and their performance is compared to previous algorithms proposed by Serra (1982, 1988) and by Maragos and Schafer (1986). Sample evaluations indicate a greater than 22-fold savings in computational requirements and 11-fold reduction in memory requirements.

[1] H. Blum, "A transformation for extracting new descriptors of shape," inModels for the Perception of Speech and Visual Forms, W. Wathen-Dunn, Ed. Cambridge, MA: M.I.T. Press, 1967.
[2] H. Blum, "Biological shape and visual sciences (part I),"J. Theoret. Biology, vol. 38, pp. 205-287, 1973.
[3] R. J. Feehs and G. R. Arce, "Multidimensional morphological edge detection," inVisual Communications and Image Processing II, T. R. Hsing, Ed. Proc. SPIE 845, 1987, pp. 285-292.
[4] C. Lantuejoul, "La squelettisation et son application aux mesures topologuiques des mosaiques polycristallines," these de Docteur-ingenieur, School of Mines, Paris, France, 1978.
[5] C. Lantuejoul, "Skeletonization in quantitative metallography," inIssues of Digital Image Processing, R. M. Haralick and J. C. Simon, Eds. Groningen, The Netherlands: Sijthoff and Noordhoff, 1980.
[6] J. S. J. Lee, R. M. Haralick, and L. G. Shapiro, "Morphologic edge detection,"IEEE Trans. Rob. Autom., vol. RA-3, pp. 142-156, Apr. 1987.
[7] P. A. Maragos, R. W. Schafer, "Morphological skeleton representation and coding of binary images,"IEEE Trans. Acoustics Speech Signal Processing, vol. ASSP-34, pp. 1228-1244, 1986.
[8] P. Maragos and R. Ziff, "Threshold superposition in morphological image analysis systems,"IEEE Trans. Patt. Anal. Machine Intell., vol. 12, pp. 498-504, May 1990.
[9] G. Matheron,Random Sets and Integral Geometry. New York: Wiley, 1975.
[10] T. W. Pai and J. H. L. Hansen, "An improved image coding algorithm using morphological operator theory," inProc. IEEE Int. Conf. Acoustics, Speech, and Signal Processing, Toronto, Canada, May 1991, pp. 2761-2764.
[11] J. Serra,Image Analysis and Mathematical Morphology, vol. 1 and 2. San Diego: Academic Press, 1982 and 1988.

Index Terms:
image processing; mathematical morphology; computational complexity; boundary-constrained morphological skeleton minimization; boundary-constrained skeleton reconstruction; data storage requirement reduction; binary morphological skeleton; morphological boundary structure; computational complexity; image analysis; image coding
T.W. Pai, J.H.L. Hansen, "Boundary-Constrained Morphological Skeleton Minimization and Skeleton Reconstruction," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 16, no. 2, pp. 201-208, Feb. 1994, doi:10.1109/34.273731
Usage of this product signifies your acceptance of the Terms of Use.