<s>
Region	B-Algorithm
growing	I-Algorithm
is	O
a	O
simple	O
region-based	O
image	B-Algorithm
segmentation	I-Algorithm
method	O
.	O
</s>
<s>
It	O
is	O
also	O
classified	O
as	O
a	O
pixel-based	O
image	B-Algorithm
segmentation	I-Algorithm
method	O
since	O
it	O
involves	O
the	O
selection	O
of	O
initial	O
seed	O
points	O
.	O
</s>
<s>
This	O
approach	O
to	O
segmentation	B-Algorithm
examines	O
neighboring	O
pixels	O
of	O
initial	O
seed	O
points	O
and	O
determines	O
whether	O
the	O
pixel	O
neighbors	O
should	O
be	O
added	O
to	O
the	O
region	O
.	O
</s>
<s>
The	O
process	O
is	O
iterated	O
on	O
,	O
in	O
the	O
same	O
manner	O
as	O
general	O
data	B-Algorithm
clustering	I-Algorithm
algorithms	O
.	O
</s>
<s>
A	O
general	O
discussion	O
of	O
the	O
region	B-Algorithm
growing	I-Algorithm
algorithm	O
is	O
described	O
below	O
.	O
</s>
<s>
The	O
main	O
goal	O
of	O
segmentation	B-Algorithm
is	O
to	O
partition	O
an	O
image	O
into	O
regions	O
.	O
</s>
<s>
Some	O
segmentation	B-Algorithm
methods	O
such	O
as	O
thresholding	B-Algorithm
achieve	O
this	O
goal	O
by	O
looking	O
for	O
the	O
boundaries	O
between	O
regions	O
based	O
on	O
discontinuities	O
in	O
grayscale	O
or	O
color	O
properties	O
.	O
</s>
<s>
Region-based	O
segmentation	B-Algorithm
is	O
a	O
technique	O
for	O
determining	O
the	O
region	O
directly	O
.	O
</s>
<s>
is	O
a	O
logical	B-Algorithm
predicate	I-Algorithm
defined	O
over	O
the	O
points	O
in	O
set	O
and	O
is	O
the	O
null	O
set	O
.	O
</s>
<s>
(	O
a	O
)	O
means	O
that	O
the	O
segmentation	B-Algorithm
must	O
be	O
complete	O
;	O
that	O
is	O
,	O
every	O
pixel	O
must	O
be	O
in	O
a	O
region	O
.	O
</s>
<s>
(	O
e	O
)	O
indicates	O
that	O
region	O
and	O
are	O
different	O
in	O
the	O
sense	O
of	O
predicate	B-Algorithm
.	O
</s>
<s>
The	O
first	O
step	O
in	O
region	B-Algorithm
growing	I-Algorithm
is	O
to	O
select	O
a	O
set	O
of	O
seed	O
points	O
.	O
</s>
<s>
For	O
example	O
,	O
if	O
the	O
criterion	O
were	O
a	O
pixel	O
intensity	O
threshold	O
value	O
,	O
knowledge	O
of	O
the	O
histogram	B-Algorithm
of	O
the	O
image	O
would	O
be	O
of	O
use	O
,	O
as	O
one	O
could	O
use	O
it	O
to	O
determine	O
a	O
suitable	O
threshold	O
value	O
for	O
the	O
region	O
membership	O
criterion	O
.	O
</s>
<s>
One	O
can	O
use	O
4-connected	B-Algorithm
neighborhood	I-Algorithm
to	O
grow	O
from	O
the	O
seed	O
points	O
.	O
</s>
<s>
An	O
alternative	O
for	O
pixels	O
adjacent	O
relationship	O
is	O
the	O
8-connected	B-Algorithm
neighborhood	I-Algorithm
.	O
</s>
<s>
Then	O
probably	O
,	O
we	O
can	O
examine	O
the	O
histogram	B-Algorithm
and	O
choose	O
the	O
seed	O
points	O
from	O
the	O
highest	O
range	O
of	O
it	O
.	O
</s>
<s>
No	O
region	O
in	O
region	B-Algorithm
growing	I-Algorithm
method	O
result	O
will	O
be	O
smaller	O
than	O
this	O
threshold	O
in	O
the	O
segmented	O
image	O
.	O
</s>
<s>
It	O
usually	O
depends	O
on	O
the	O
original	O
image	O
and	O
the	O
segmentation	B-Algorithm
result	O
we	O
want	O
.	O
</s>
<s>
Can	O
provide	O
the	O
original	O
images	O
which	O
have	O
clear	O
edges	O
with	O
good	O
segmentation	B-Algorithm
results	O
.	O
</s>
