Two symmetrical thinning algorithms for 3D binary images, based on -simple points
| Autor: | Gilles Bertrand, Christophe Lohou |
|---|---|
| Rok vydání: | 2007 |
| Předmět: |
Surface (mathematics)
Iterative method Binary image ComputingMethodologies_IMAGEPROCESSINGANDCOMPUTERVISION Image processing Topology (electrical circuits) Skeleton (category theory) Artificial Intelligence Simple (abstract algebra) Signal Processing Computer Vision and Pattern Recognition Digital topology Algorithm Software Mathematics |
| Zdroj: | Pattern Recognition. 40:2301-2314 |
| ISSN: | 0031-3203 |
| DOI: | 10.1016/j.patcog.2006.12.032 |
| Popis: | In this paper, we propose two 3D symmetrical thinning algorithms based on the parallel deletion of P-simple points. The first one permits surface skeletons to be obtained. The second one permits curve skeletons to be extracted, and as far as we know, this is the only symmetrical curve thinning algorithm which preserves topology. These algorithms have been conceived in order to obtain precise results on simple specific objects (parallelepipeds). Consequently, we can predict the number of deletion iterations, the number of deleted points, and the skeleton of these objects obtained by the two algorithms, which is hardly ever possible to assess with other algorithms even on these simple objects. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Full Text from ScienceDirect