A combinatorial pruning algorithm for Voronoi skeletonization

0Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Voronoi skeletons have been used extensively in image processing and analysis due to its fast computation and good properties. However, they are very sensitive to boundary noise which may cause a large number of insignificant branches that need to be pruned. Commonly used measurements of significance can be divided into two types: local and global. Local measurements of significance are context-aware but sensitive to noise. Global measurements of significance are robust to noise but unaware of context information. In this paper, we propose a combinatorial branch pruning algorithm that integrates both local and global measurements. Experimental results show that the proposed method is stable with different shapes and robust to boundary noise. © 2013 Springer-Verlag.

Cite

CITATION STYLE

APA

Liu, H., Wu, Z., Zhang, X., & Frank Hsu, D. (2013). A combinatorial pruning algorithm for Voronoi skeletonization. In Lecture Notes in Electrical Engineering (Vol. 212 LNEE, pp. 325–333). https://doi.org/10.1007/978-3-642-34531-9_34

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free