Image Processing Reference
In-Depth Information
-
4 +
4- +
-
-
-
-+
( a )
( b )
6
( c )
+
-
-
6
-
6
( d )
6
76
( e )
Fig. 5.14. Illustration of reverse squared Euclidean distance transformation (Algo-
rithm 5.11) [Saito94b]: ( a ) f ijk
;( b )
<f ( i− 1) jk : substitute the part of
for
for g ijk ;( c ) an input picture; ( d ) the forward scan;
f ijk ≥ f ( i− 1) jk : substitute f ijk
( e ) the backward scan.
terminated are not the density values (or the squared density values) obtained
by DT. In other words, a DT image is not restored by this algorithm.
We will summarize properties of this algorithm below.
(1) The amount and the time of computation are about the same as those of
the squared DT realized by Algorithm 5.7.
Search WWH ::




Custom Search