2 SYSTEM DESCRIPTION
Our dynamic image segmentation system (Fujimoto
et al., 2008) was designed for a binary image. In this
paper, we consider introducing a multi-scaling sys-
tem (Zhao et al., 2003) into our original system so
that it can work well for a gray scale image.
2.1 Multi-scaling System of Gray Levels
In segmentation of a gray scale image, a fundamen-
tal task is to find an image region (connected compo-
nents) that consists of pixels with different gray levels.
As an approach, a multi-scaling technique for a gray
scale image has been proposed (Zhao et al., 2003).
The scheme consists of degradation of a gray scale
image like a K-means technique (Hartigan and Wong,
1979) and concurrent computation of the proximity
between pixels based on their gradated gray levels.
Moreover, it has an interested feature that it needs no
setting of the number of centroids and their initial ar-
rangements unlike the K-means method.
The scheme is performed by utilizing nonlinear
dynamics of the following discrete-time dynamical
system. Let p
i
(τ) be the ith pixel value normalized
in the range [0, 1]. It is updated according to
p
i
(τ+ 1) =
0 if p
i
(τ)+ ηF
i
(τ) ≤ 0
p
i
(τ)+ ηF
i
(τ) if 0 < p
i
(τ)+ ηF
i
(τ) < 1
1 if p
i
(τ)+ ηF
i
(τ) ≥ 1
(1)
and
F
i
(τ) =
1
S
i
(τ)
X
j∈∆
i
(τ)
p
j
(τ)− p
i
(τ)
|p
j
(τ)− p
i
(τ)|
e
−γ|p
j
(τ)−p
i
(τ)|
, (2)
where p
i
(0) is given as the normalized gray level of
the ith pixel in an input image; ∆
i
(τ) denotes a set
of pixels with approximately the same value as p
i
(τ);
and the sign |·| expresses the absolute value. S
i
(τ) rep-
resents the number of elements in ∆
i
(τ) and is counted
based on the proximity level q
ij
(τ) between the ith and
jth pixel values at every iteration. It is updated as
q
ij
(τ + 1) = βq
ij
(τ)+ (1− β)H
e
−γ|p
j
(τ)−p
i
(τ)|
− ψ
,
(3)
where H denotes the Heaviside step function and re-
turns zero or one if its argument value is negative or
non-negative, respectively. η, γ, β, and ψ are positive
parameters, and the each value except for γ is set as
less than one. Therefore, the value of q
ij
(τ) gradu-
ally converges to the return value of H, e.g., q
ij
(τ + 1)
approaches one when the values of p
i
(τ) and p
j
(τ)
are close. Based on the values of q
ij
(τ), the values
of p
i
(τ) are also converged to several clusters gradu-
ally, and eventually, a multi-scale image is obtained.
According to the values of p
i
and q
ij
after sufficient
iteration, couplings between adjacent chaotic neurons
are determined so that the ith and kth chaotic neurons
are coupled only if q
ik
= 1, where k ∈ L(i).
2.2 Coupled System of Chaotic Neurons
Our dynamic image segmentation system (Fujimoto
et al., 2008)consists of a global inhibitor and the same
number of chaotic neurons (Aihara et al., 1990) as
pixels of an input image. A chaotic neuron can gen-
erate an oscillatory response under adequate values of
system parameters. Dynamic image segmentation is
performed based on oscillatory responses.
The architecture of our system and dynamic image
segmentation scheme are illustrated in Fig. 1. Chaotic
neuronsare arranged in a two-dimensionalgrid so that
one corresponds to a pixel. Chaotic neurons corre-
sponding to high-gray-level pixels in an image region
are coupled and also have a positive self-feedback
coupling. The global inhibitor connects to all chaotic
neurons and suppress their activity levels when one
or more chaotic neurons fire. The dynamics of the
ith chaotic neuron with two state variables (x
i
, y
i
) is
described as
x
i
(t+ 1) = k
f
x
i
(t)+ I
i
+ C
i
(t) (4)
y
i
(t+ 1) = k
r
y
i
(t)− αg
(
x
i
(t)+ y
i
(t), 0
)
+ a, (5)
where t denotes the discrete time. I
i
takes a value
from 0 to 2, and we set the value of I
i
as the value
of lim
τ→∞
2p
i
(τ). C
i
(t) represents the sum of exter-
nal stimuli from chaotic neurons including itself in
the same image region and the global inhibitor. It is
described as
C
i
(t) =
X
k∈L(i)
W
M(i)
g
(
x
k
(t)+ y
k
(t), 0
)
− Wg
(
z(t), 0.5
)
,
(6)
where L(i) denotes a set of chaotic neurons corre-
sponding to almost the same gray levels of pixels as
the ith pixel in its four-neighborhood. M(i) is the
number of elements in L(i) and be calculated as the
number of chaotic neurons satisfying q
ik
= 1 in which
k ∈ L(i). g denotes the output function of a chaotic
neuron or the global inhibitor and is defined as
g(u(t), θ) =
1
1+ exp
(
−(u(t)− θ)/ε
)
. (7)
The dynamics of the global inhibitor with a state vari-
able (z) is expressed as
z(t+ 1) = φ
g
N
X
i=1
g
(
x
i
(t)+ y
i
(t), W
)
, 0
− z(t)
, (8)
where N denotes the number of chaotic neurons.
BIOSIGNALS 2010 - International Conference on Bio-inspired Systems and Signal Processing
160