Skip to Main content Skip to Navigation
Conference papers

Ultra-Fast Skeleton Based on an Isotropic Fully Parallel Algorithm

Abstract : In this paper we introduce a new thinning algorithm, called MB, which is optimized with respect to the total number of elementary Boolean operators needed to perform it. We first emphasize the sound foundations of the algorithm, which is built by expressing into the Boolean language the three following constraints: (1) homotopy, (2) median axis and (3) isotropy. The MB algorithm benefits from both novel algorithmic ideas and systematic logic minimization. By hunting down any redundancy in the expressions of topological/geometrical features , we achieve a procedure that is: dramatically low-cost, as it is completely computed in 18 Boolean binary operators per iteration, and secondly, fully parallel, or one-single-pass, which guarantees that the number of iterations equals half the biggest object thickness.
Complete list of metadata

Cited literature [22 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-01245393
Contributor : Antoine Manzanera Connect in order to contact the contributor
Submitted on : Thursday, December 17, 2015 - 10:31:47 AM
Last modification on : Wednesday, June 24, 2020 - 4:18:23 PM
Long-term archiving on: : Friday, March 18, 2016 - 11:51:13 AM

File

dgci99.pdf
Files produced by the author(s)

Identifiers

Citation

Antoine Manzanera, Thierry Bernard, Françoise Prêteux, Bernard Longuet. Ultra-Fast Skeleton Based on an Isotropic Fully Parallel Algorithm. Discrete Geometry for Computer Imagery (DGCI'99), Mar 1999, Marne-la-vallée, France. ⟨10.1007/3-540-49126-0_24⟩. ⟨hal-01245393⟩

Share

Metrics

Record views

122

Files downloads

283