Skeletonizing Digital Images with Cellular Automata - Cellular Automata in Image Processing and Geometry - page 57

Fig. 3.10 Experimental time obtained for the Guo and Hall algorithm applied on 36 totally
black images of n × n pixels, from n = 125 to n = 4500 with a regular increment of 125
pixels. Top image shows the time of our parallel implementation in CA. Bottom image shows
the time for a sequential implementation.

bigger structure of the fingerprint. In many cases, the thickness of each line print
is not important and the skeletonized image provides the same information as the
original one.
We finish this section by showing the results of some experiments performed with
our CA implementation. We have taken 36 totally black images of n

× n pixels, from

n 4500 with a regular increment of 125 pixels of side. Figure 3.10 (top)

shows the time in milliseconds of the application of our implementation of the Guo
and Hall algorithm in CA for 1, 30, 60 and 90 steps in the skeletonizing process.
Figure 3.10 (bottom) shows the same study for a sequential implementation of the
algorithm. Finally, Figure 3.11 shows a comparison of our implementation vs. the
sequential one by taking 90 steps in the Guo and Hall algorithm.

= 125 to n =