Abstract
A Skeleton is a simplified and efficient descriptor for shapes, which is of great importance in computer graphics and vision. In this paper, we present a new method for computing skeletons from 2D binary shapes. The contour of each shape is represented by a set of dominant points, which are obtained by a nonparametric method. Then, a set of convex dominant points is used for building the skeleton. Finally, we iteratively remove some skeleton branches in order to get a clean skeleton representation. The proposed method is compared against other methods of the state of the art. The results show that the skeletons built by our method are more stable across a wider range of shapes than the skeletons obtained by other methods; and the shapes reconstructed from our skeletons are closer to the original shapes.
Chapter PDF
Similar content being viewed by others
References
Bai, X., Latecki, L.J.: Path Similarity Skeleton Graph Matching. IEEE Transactions on Pattern Analysis and Machine Intelligence 30(7) (2008)
Duan, H., Wang, J., Liu, X., Liu, H.: A Skeleton Pruning Approach Using Contour Length as the Significance Measure. In: Third International Conference on Pervasive Computing and Applications, ICPCA, vol. 1, pp. 360–364, 6-8 (2008)
Shen, W., Bai, X., Hu, R., Wang, H., Latecki, J.L.: Skeleton growing and pruning with bending potential ratio. Pattern Recognition 44, 196–209 (2011)
Montero, A.S., Lang, J.: Skeleton pruning by contour approximation and the integer medial axis transform. Computers and Graphics 36, 477–487 (2012)
Hesselink, W.H., Roerdink, B.T.M.: Euclidean Skeleton of Digital Image and Volume Data in Linear Time by the Integer Medial Axis Transform. IEEE Transactions on Pattern Analysis and Machine Intelligence 30(12) (2008)
Prasad, D.K., Quek, C., Leung, M.K.H., Cho, S.: A novel framework for making dominant point detection methods non-parametric. Image and Vision Computing (Elsevier) 30(11), 843–859 (2012)
Liu, H., Wu, Z., Zhang, X., Hsu, D.F.: A skeleton pruning algorithm based on information fusion. Pattern Recognition Letters 34, 1138–1145 (2013)
Liu, H., Wu, Z., Hsu, S.F., Peterson, B.S., Xu, D.: On the generation and pruning of skeletons using generalized Voronoi diagrams. Pattern Recognition Letters 33, 2113–2119 (2012)
Duan, H., Wang, J., Liu, X., Liu, H.: A Skeleton Pruning Approach Using Contour Length as the Significance Measure. In: Third International Conference on Pervasive Computing and Applications, ICPCA 2008, vol. 1, pp. 360–364 (2008)
Bai, X., Latecki, J.L., Liu, W.: Skeleton pruning by contour partitioning with Discrete Curve Evolution. IEEE Transactions on Pattern Analysis and Machine Intelligence 29(3), 449–462 (2007)
Zhang, T.Y., Suen, C.Y.: A fast parallel algotithm for thinning digital patterns. ACM Commun. 27, 236–239 (1984)
Douglas, D.H., Peucker, T.K.: Algorithms for the Reduction of the Number of Points Required to Represent a Digitized Line or its Caricature. Cartographica: The International Journal for Geographic Information and Geovisualization, 112–122 (1973)
Ramer, U.: An iterative procedure for the polygonal approximation of plane curves. Computational Graphics Image Process, 244–256 (1972)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Pinilla-Buitrago, L.A., Martínez-Trinidad, J.F., Carrasco-Ochoa, J.A. (2014). A New Method for Skeleton Pruning. In: Martínez-Trinidad, J.F., Carrasco-Ochoa, J.A., Olvera-Lopez, J.A., Salas-Rodríguez, J., Suen, C.Y. (eds) Pattern Recognition. MCPR 2014. Lecture Notes in Computer Science, vol 8495. Springer, Cham. https://doi.org/10.1007/978-3-319-07491-7_31
Download citation
DOI: https://doi.org/10.1007/978-3-319-07491-7_31
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-07490-0
Online ISBN: 978-3-319-07491-7
eBook Packages: Computer ScienceComputer Science (R0)