Issue No. 02 - February (1994 vol. 16)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/34.273731
<p>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.</p>
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. Pai and J. Hansen, "Boundary-Constrained Morphological Skeleton Minimization and Skeleton Reconstruction," in IEEE Transactions on Pattern Analysis & Machine Intelligence, vol. 16, no. , pp. 201-208, 1994.