Computing stable skeletons with particle filters

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

Abstract

We present a novel method to obtain high quality skeletons of binary shapes. The obtained skeletons are connected and one pixel thick. They do not require any pruning or any other post-processing. The computation is composed of two major parts. First, a small set of salient contour points is computed. We use Discrete Curve Evolution, but any other robust method could be used. Second, particle filters are used to obtain the skeleton. The main idea is that the particles walk along the skeletal paths between pairs of the salient points. We provide experimental results that clearly demonstrate that the proposed method significantly outperforms other well-known methods for skeleton computation. © 2008 Springer Berlin Heidelberg.

Cite

CITATION STYLE

APA

Bai, X., Yang, X., Latecki, L. J., Xu, Y., & Liu, W. (2008). Computing stable skeletons with particle filters. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5351 LNAI, pp. 30–41). https://doi.org/10.1007/978-3-540-89197-0_7

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