Image Processing Reference
In-Depth Information
(
de
(
i, j, k
)
,
(
p, q, r
))
2
;
f
ijk
←
(
p,q,r
)
{
min
f
pqr
=
0
,
1
≤
p
≤
L,
1
≤
q
≤
M,
1
≤
r
≤
N
}
enddo
(Shift distance values by
20
for using integers
1
∼
19
as labels)
for
all (
i, j, k
)s
do
if
(
f
ijk
=
0
)
then
f
ijk
←
f
ijk
+
20
enddo
maxd
←
(Maximum of the Euclidean distance transformation values in the
image
F
)
mind
←
(Minimum of the nonzero values of the Euclidean distance
transformation in the image
F
)
(Main cycle processing)
[STEP 2]
for
distance = mind to maxd
do
[STEP 3]
(Extraction of
FPV
and classification of voxels to be tested the
deletability)
for
all (
i, j, k
)s
do
if
f
ijk
=distance
then
if
(
C
1
C
2)
then
f
ijk
←
∨
1
(
FPV
)
else
m
(the number of non-0 voxels in the 26-neighborhood of (
i, j, k
))
f
ijk
←
←
int(
m/
3
)+
7
(give a label showing a group of the voxel. Label
takes values
7
∼
15
)
endif
else
no operation is performed
endif
enddo
(Subcycle processing)
[STEP 4]
(Deletion of a voxel)
for
bordertype =
7
to
15
do
for
all (
i, j, k
)s
do
if
f
ijk
=bordertype
then
if
(
C
1
C
2)
then
f
ijk
←
∨
1
(
FPV
)
else
f
ijk
←
0
(Deletion of a 1-voxel)
endif
else
no operation is performed
endif
enddo
enddo
[STEP 5]
(Test of terminating rule)
Search WWH ::
Custom Search