Title of article
Efficient Computation of the Euclidean Distance Transform
Author/Authors
Boxer، Laurence نويسنده , , Miller، Russ نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2000
Pages
-378
From page
379
To page
0
Abstract
Thinning algorithms on binary images are used to generate skeletons that preserve the same connectivity structures as the objects in the original images. Two kinds of skeletons may be appropriate for 3D thinning algorithms: digital curves and digital surfaces. We propose two thinning algorithms on 3D (18, 6) binary images. One algorithm generates skeletons as digital curves and the other algorithm generates skeletons as digital surfaces. Both algorithms are 6-subiteration algorithms-in each iteration, they are applied alternatively to delete border voxels from each of the six directions, upper, lower, north, south, east, and west.
Keywords
Euclidean distance transform , Hypercube , mesh-of-trees , RAM , mesh , EREW PRAM , Parallel algorithm , Binary image
Journal title
COMPUTER VISION & IMAGE UNDERSTANDING
Serial Year
2000
Journal title
COMPUTER VISION & IMAGE UNDERSTANDING
Record number
33981
Link To Document