Image Processing Reference
In-Depth Information
5-
,
-
0
+
(
1
/
-.
--
-+
-,
3
2
5+
+
,
(
-
0
-
+
,
(
0
5,
57
-
+
,
(
0
Fig. 5.16.
Illustration of Algorithm 5.16 (extraction of Skeleton 2) [Saito94b].
U
V
be preserved. In [STEP 3], two 3D arrays
may also be allocated to
the same place of the memory space if we perform labeling repeatedly using
the array
and
V
, instead of referring to a label image
U
to find the location of a
particular label.
In [STEP 2], two 1D arrays of the same size as a row and a column are
needed as work areas. Thus, the minimum requirement for memory space for
Search WWH ::
Custom Search