CSDL Home IEEE Transactions on Pattern Analysis & Machine Intelligence 2007 vol.29 Issue No.03 - March
Issue No.03 - March (2007 vol.29)
Longin Jan Latecki , IEEE Computer Society
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TPAMI.2007.59
In this paper, we introduce a new skeleton pruning method based on contour partitioning. Any contour partition can be used, but the partitions obtained by Discrete Curve Evolution (DCE) yield excellent results. The theoretical properties and the experiments presented demonstrate that obtained skeletons are in accord with human visual perception and stable, even in the presence of significant noise and shape variations, and have the same topology as the original skeletons. In particular, we have proven that the proposed approach never produces spurious branches, which are common when using the known skeleton pruning methods. Moreover, the proposed pruning method does not displace the skeleton points. Consequently, all skeleton points are centers of maximal disks. Again, many existing methods displace skeleton points in order to produces pruned skeletons.
Skeleton, skeleton pruning, contour partition, discrete curve evolution.
Longin Jan Latecki, Xiang Bai, "Skeleton Pruning by Contour Partitioning with Discrete Curve Evolution", IEEE Transactions on Pattern Analysis & Machine Intelligence, vol.29, no. 3, pp. 449-462, March 2007, doi:10.1109/TPAMI.2007.59