Image Processing Reference
In-Depth Information
N
length of the list
for bordertype = 7 to 15 do
for n = 1 to N do
if ( l n =bordertype)
then
if C 2(=( i n ,j n ,k n ) is not deletable)
then l n
16 ( TPV )
else
if (( i n ,j n ,k n )isanedgevoxel)
then exclude e n from the list ( FPV )
else
f i n j n k n
0 (Deletion of a voxel ( i n ,j n ,k n ))
exclude e n from the list
for (all voxels in the 6-neighborhood of ( i n ,j n ,k n )) do
if ( f i j k > 20 )
then
add( i ,j ,k ,f i j k ) to the list
f i j k
1
endif
enddo
endif
endif
endif
enddo
enddo
[STEP 5] (Test of the terminating rule)
N
length of the list
mind
minimum of the distance values in the list (the minimum value in
the list over 20 )
m
the number of nondeletable voxels ( l n = 16 ) in the list
if (mind < maxd or m>N )
then go to [STEP 3]
endif
[STEP 6] (postprocessing)
Same as Algorithm 5.5 [STEP 6]
5.4.7 Examples of surface/axis thinning algorithm (parallel type)
The formal definition of the parallel type algorithm was already described in
Chapter 2. In the context of the surface/axis thinning, it will be stated as
follows:
In every cycle of iteration the whole of an input image is examined to give
a mark to all voxels that are deemed deletable and those which are to be
Search WWH ::




Custom Search