Image Processing Reference
In-Depth Information
Transitional rules for generation the pattern of letter
using von Neumann neigh-
borhood
1.
for
n=1 to 2
do
a.
if
(N==1)
then
S=1
do
// where N and S stand for North and South neigh-borhoods, respectively.
1.
for
n=1 to 5
do
a.
if
(E==1)
then
W=1
do
//where E and W stand for East and West neigh-borhoods, respectively.
1.
for
n=1 to 2
do
a.
if
(S==1)
then
N=1
do
Fig. 12.11
The process of generating the pattern of letter
using von Neumann neigh-
borhoods.
Fig. 12.12
The process of generating the pattern of letter
using Moore neighborhoods.
previous letter, which is impossible in a considerable number of cases using the
structure of von Neumann neighborhood. Despite the fact that the Moore neigh-
borhood checks more cells than von Neumann does, it is observed in the course of
experiments (Fig. 12.12) that it can produce Kufic form of letter but it still
suffers from same defects and can only reduce the steps of producing letters a bit.
This letter can be produced by the following transitional rules:
In order to resolve the mentioned weakness, the impact of using extended Moore
neighborhood is examined, in which the cellular automata can supervise 25 cells
simultaneously. In light of the fact that defined rules for this neighborhood have the
capability of regulating more cells, it seems to have got rarely eased the process of
word generation.
Minoofam and Bastanfard [14] utilized this neighborhood with the aim of sim-
ulating the holy word of 'Muhammad' with Ma'qeli script and this neighborhood.
They reported this procedure takes 25 steps of rule execution, and the results are
promising (see Fig 12.13a. In order to achieve this aim, they combined predefined
rules with XOR operator (
↗
), which are as follows below: (Consider a central cell,
Search WWH ::
Custom Search