DMCA
Skeleton Pruning by Contour Partitioning with Discrete Curve Evolution (2007)
Cached
Download Links
- [www.cis.temple.edu]
- [www.cis.temple.edu]
- DBLP
Other Repositories/Bibliography
| Venue: | IEEE TRANS. PATTERN ANAL. MACH. INTELL |
| Citations: | 75 - 13 self |
BibTeX
@ARTICLE{Bai07skeletonpruning,
author = {Xiang Bai and Longin Jan Latecki and Wen-yu Liu},
title = {Skeleton Pruning by Contour Partitioning with Discrete Curve Evolution},
journal = {IEEE TRANS. PATTERN ANAL. MACH. INTELL},
year = {2007},
volume = {29},
number = {3},
pages = {449--462}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
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.
Keyphrases
discrete curve evolution skeleton pruning skeleton point new skeleton original skeleton contour partitioning human visual perception yield excellent result pruning method obtained skeleton theoretical property maximal disk contour partition significant noise shape variation spurious branch
