This paper presents a parallel algorithm to obtain the 8- connected labelled skeleton of a binary picture. It performs both the distance transformation and the erosion of the figure at the same time, and adopts directional information to guide such processes. The combination of directional and distance information leads to a reversible skeletonization which preserves both topological and geometrical properties of the figure, is largcly rotation invariant, and exhibits a low computational cost.
Parallel skeletonization by directional information
M Frucci;
1994
Abstract
This paper presents a parallel algorithm to obtain the 8- connected labelled skeleton of a binary picture. It performs both the distance transformation and the erosion of the figure at the same time, and adopts directional information to guide such processes. The combination of directional and distance information leads to a reversible skeletonization which preserves both topological and geometrical properties of the figure, is largcly rotation invariant, and exhibits a low computational cost.File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
