The Hamilton-Jacobi approach has proved to be a powerful and elegant method for extracting the skeleton of a shape. The approach is based on the fact that the dynamics of the inward evolving boundary is conservative everywhere except at skeletal points. Nonetheless this method appears to overlook the fact that the linear density of the evolving boundary front is not constant where the front is curved. In this paper we present an analysis which takes into account variations of density due to boundary curvature. This yields a skeletonization algorithm that is both better localized and less susceptible to boundary noise than the Hamilton-Jacobi method. © Springer-Verlag; 2003.
CITATION STYLE
Torsello, A., & Hancock, E. R. (2003). Curvature Dependent Skeletonization. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2749, 200–207. https://doi.org/10.1007/3-540-45103-x_28
Mendeley helps you to discover research relevant for your work.