# Quaternion-Based Improved Artificial Bee Colony Algorithm for Color Remote Sensing Image Edge Detection

Authors: Dujin Liu; Huajun Wang; Sen Wang; Guolin Pu; Xiaoya Deng; Xiang Hou
Journal: Mathematical Problems in Engineering
 (2015)

---

## Abstract

As the color remote sensing image has the most notable features such as huge amount of data, rich image details, and the containing of too much noise, the edge detection becomes a grave challenge in processing of remote sensing image data. To explore a possible solution to the urgent problem, in this paper, we first introduced the quaternion into the representation of color image. In this way, a color can be represented and analyzed as a single entity. Then a novel artificial bee colony method named improved artificial bee colony which can improve the performance of conventional artificial bee colony was proposed. In this method, in order to balance the exploration and the exploitation, two new search equations were presented to generate candidate solutions in the employed bee phase and the onlookers phase, respectively. Additionally, some more reasonable artificial bee colony parameters were proposed to improve the performance of the artificial bee colony. Then we applied the proposed method to the quaternion vectors to perform the edge detection of color remote sensing image. Experimental results show that our method can get a better edge detection effect than other methods.


---

## Body

## 1. Introduction

Edge detection in remote sensing image is very important for a wide range of applications such as environment monitoring [1], image analysis and classification [2, 3], change detection [4], and geographic image retrieval [5].With the development of remote sensing technology, a large number of remote sensing images with high spectral and spatial resolutions are acquired by the satellites, and the revisiting time is greatly reduced. As a result, the users obtain the larger archives of digital remote sensing image, which facilitates the edge detection of remote sensing image. However, there is still a challenging problem to achieve reliable image edges in remote sensing image, not only due to the large amount of data and the rich image details, but also because of the containing of too much noise.Artificial bee colony algorithm (ABC) [6] is widely used in image processing [7, 8] and engineering optimization [9, 10]. For example, Draan and Bouaziz [11] proposed a new artificial bee colony (ABC) algorithm for image contrast enhancement. The proposed algorithm has been extended to color image enhancement and given very promising results. Szeto and Jiang [12] proposed a hybrid enhanced artificial bee colony algorithm (HEABC) for solving the problem of bus network design. The HEABC relies mainly on the enhanced artificial bee colony algorithm to determine the route structure and could produce a design that was better than the existing design for maximum intermediate stops, total travel time, number of transfers, maximum headway, and total fuel cost. But it has not yet been improved to solve remote sensing image edge detection problem. This study enhances the ABC algorithm to solve this problem.The color image can provide a large amount of appearance information of the object. However, conventional ABC cannot take full advantage of the color image. Now, there are many kinds of color remote sensing image edge detection methods [13, 14], but each method performed remote sensing image edge detection by splitting the strong spectral relationship between each channel of the color image [15]. The vector method [16] takes a color image pixel as a three-dimensional vector, which to some extent considered each channel nature of the color image making the effect better than the synthetic method [17]. But the vector method does not process a color as a whole in transformation, operation, and treatment of the image vector, which lead to some edges undetected, local color uncoordinated, and local edge details damaged. It is even worse for the effect when the complex noise exists [18].How to choose a mathematic tool to effectively represent a color image, which makes the three color components be considered simultaneously as a whole without loss of the spectral relation that is present in them, is a challenging problem.It is a good way to use a quaternion [19] representing a color pixel. A quaternion can be seen as a composition of four real numbers. We can let the first one of the four real numbers be zero for representing a pixel, and let the other three real numbers be, respectively, the values of the three entries of a color pixel. Through quaternion representation of color image, you can make full use of the whole color information for each pixel of the image. A color image can be represented as a quaternion matrix, while each pixel of the color image is represented by a quaternion vector. Then according to quaternion vector rotation principle and tone offset mechanisms, the edge points can be determined [20], which implements the whole processing of each quaternion pixel. In recent years, there have been a number of studies on the quaternion [21, 22].In this paper, we aim at using the quaternion to represent the color pixel and reducing the dimension for multispectral remote sensing images by using PCA (principal component analysis) [23, 24]. Then we propose a novel ABC method called IABC (improved artificial bee colony) and use it for the image edge detection, based on which, aquaternion-based improved artificial bee colony algorithm for edge detection of color remote sensing image will be introduced.The remainder of the paper is organized as follows. In Section2, quaternion representation for a color image edge will be present. In Section 3, we introduce our algorithm. In Section 4, we do some experiments and analyze their results. In Section 5, conclusion is offered.


## 2. Quaternion Representation for the Color Image Edge

Although the quaternion theory [19] still has some issues to be resolved, its representation is convenient, simple, and widely used in image processing. Based on quaternion theory, a quaternion is a four-dimensional number, which consists of a real part and three imaginary parts. For example, the quaternion q can be expressed as follows:
(1)
q
=
a
+
b
i
+
c
j
+
d
k
,
where a, b, c, and d are four real coefficients. And i, j, and k are three orthogonal imaginary units that satisfy the following rules:
(2)
i
2
=
j
2
=
k
2
=
i
j
k
=
-
1
,
i
j
=
k
,
j
k
=
i
,
k
i
=
j
,
j
i
=
-
k
,
k
j
=
-
i
,
i
k
=
-
j
.Let the real part of quaterniona
=
0; then q is a pure quaternion. Let Re
(
q
)
=
a represent the real part of quaternion q, and let Im
(
q
)
=
b
i
+
c
j
+
d
k represent imaginary part of quaternion q. Thus q
=
Re
(
q
)
+
Im
(
q
). Mold and conjugate of quaternion q are defined as follows:
(3)
q
=
a
2
+
b
2
+
c
2
+
d
2
,
q
-
=
a
-
b
i
-
c
j
-
d
k
.Denote each color pixel of a color image by quaternionq
=
a
+
b
i
+
c
j
+
d as follows: a, b, c, and d are set as a
=
0, b
=
r, c
=
g, and d
=
b. r, g, and b stand for the first, second, and third components of the color pixel, respectively.Addition or subtraction with two quaternions is addition or subtraction of their respective components, and according to the rules of quaternion multiplication, the quaternion does not satisfy the multiplication commutative law.


### 2.1. Polar Coordinates for Quaternions

Feature axis and feature angle of quaternionq are defined as follows:
(4)
μ
=
1
b
2
+
c
2
+
d
2
b
i
+
c
j
+
d
k
,
θ
=
ta
n
-
1
b
2
+
c
2
+
d
2
a
,
a
≠
0
π
2
,
a
=
0
,
where q
=
a
+
b
i
+
c
j
+
d
k.Whereq can be derived after calculation as follows: q
=
q
(
cos
⁡
θ
+
μ
sin
θ
)
=
q
e
μ
θ, meanwhile u denotes the eigenaxis, and θ denotes the eigenangle.If vectorα rotating angle θ becomes vector β and e
n denotes unit vector of rotating shaft direction perpendicular to the plane which includes vectors α, β, rotating shaft direction meets the right-hand rule, and then a quaternion will be represented in polar coordinates as follows:
(5)
β
=
cos
⁡
θ
+
e
n
sin
θ
α
.And the corresponding formula of the reverse rotation is as follows:(6)
β
=
cos
⁡
-
θ
+
e
n
sin
-
θ
α
.If the vectorα is not perpendicular to the rotary shaft e
n and it rotates angle θ about the axis of rotation becoming the vector β, the quaternion in polar coordinates is expressed as
(7)
β
=
cos
⁡
θ
2
+
e
n
sin
θ
2
α
cos
⁡
θ
2
-
e
n
sin
θ
2
,
where every color pixel denoted by a quaternion is a three-component vector of integer values in the interval [
0
,
255
].Letx
i
j
=
r
i
j
,
g
i
j
,
b
i
j
T, where r
i
j, g
i
j, b
i
j
∈
{
0
,
1
,
2
,
…
,
255
}. For reasons of symmetry, we transfer the RGB color space from the coordinate origin (
0,0
,
0
) to the center (
127.5
,
127.5
,
127.5
) of the RGB space. Then pure imaginary quaternion of a color pixel x
i
j is expressed as q
i
j
=
(
r
i
j
-
127.5
)
i
+
(
g
i
j
-
127.5
)
j
+
(
b
i
j
-
127.5
)
k, and any unit quaternion U can be represented as R
=
e
u
θ
=
cos
⁡
θ
+
μ
sin
θ. According to the three-dimensional rotation quaternion principle mentioned above, R
X
R
* indicates a three-dimensional vector X (represented by purely imaginary quaternions) rotating an angle 2
θ around theU-axis  [25, 26].


### 2.2. Quaternion Representation of Color Image Edge Points

If color pixels in RGB three-dimensional space are expressed as vectors, the vector modulus value of every pixel would indicate brightness of this pixel, of which direction means the color hue and saturation of the pixel. In order to detect image edge, grayscale pixel vectorμ
=
i
+
j
+
k would be regarded as the rotation axis; that is, when θ
=
π
/
2, it can be expressed in polar coordinates as R
=
e
u
θ
=
i
+
j
+
k. So for any pure imaginary quaternion vector X, R
X
R
* indicates three-dimensional vector X rotating 2
θ angle (180°) around the axis μ, which means X is relative to the vector μ on the axis of symmetry in the opposite direction. According to this principle, for any one of the color pixel vector q, there is q
+
R
q
R
* being a purely imaginary quaternion and q
+
R
q
R
*
=
0. Then for any two color pixel vectors q
1
=
r
1
i
+
g
1
j
+
b
1
k and q
2
=
r
2
i
+
g
2
j
+
b
2
k, we assume q
3
=
q
1
+
R
q
2
R
*. If the two vectors q
1, q
2 are of the same color pixel, q
3 will be a gray pixel vector, which means the direction coincides with the direction of the rotation axis u. If the two vectors q
1, q
2 are not identical, the resultant vector q
3 will deviate from the rotation axis u and be a color pixel. If the hues of q
1 and q
2 are close, q
3 will be located near the gray vector μ. In other words, if there is an arbitrarily small positive number δ, there is q
1
+
R
q
2
R
*
<
δ (δ is an arbitrary small positive number). By this method, if these two color pixel vectors q
1 and q
2 correspond with the pixels in the image edge, it can be naturally judged [27].In fact, for grayscale images, the edges can be considered as brightness discontinuous jump, and for color images, the edge not only has the mutation of the brightness (even the same color on both sides of the border), but also should meet the condition that different color regions are on both sides of the edges (even if the same brightness on both sides of the border). Thus the edge detection problem is to find out the pixel points meeting these two conditions, that is, to detect a pixel set not in the local area of ​​the same color but connecting the pixels of local same color area. If there are two pixels, when a pixel is on the edge, the other pixel is outside the edge, we rotate one pixel 180° around the gray axisu
=
i
+
j
+
k and add it to the other one. The result represents a pixel which must be color. On this basis, for any pixel q
=
r
i
+
g
j
+
b
k, in order to determine whether the pixel is on the edge, we can use the left template and the right template [28] to perform convolution operation as follows:
(8)
β
β
β
0
0
0
1
1
1
c
1
c
2
c
3
0
0
0
c
4
c
5
c
6
β
′
β
′
β
′
0
0
0
1
1
1
,
where c
1
,
c
2
,
c
3
,
c
4
,
c
5
,
and
c
6 are pixels in the image, while
(9)
β
=
cos
⁡
θ
2
+
u
sin
θ
2
,
β
′
=
cos
⁡
θ
2
-
u
sin
θ
2
,
u
=
i
+
j
+
k
.Equation (8) means that the pixels c
1, c
2, and c
3 around the gray axis u rotate 180° according to the right hand rule, and then c
4, c
5, and c
6 will be, respectively, added. Finally, the result obtained is as follows:
(10)
c
′
m
,
n
=
β
c
1
β
′
+
c
4
+
β
c
2
β
′
+
c
5
+
β
c
3
β
′
+
c
6
.If the three color components of the vectorc
′
(
m
,
n
) are equal or approximately equal, then it will be a local pixel of the same color, and if not, it will be an edge pixel. According to this method, we can determine whether a color pixel is an edge point. Our algorithm will be established on the basis of this method.


## 2.1. Polar Coordinates for Quaternions

Feature axis and feature angle of quaternionq are defined as follows:
(4)
μ
=
1
b
2
+
c
2
+
d
2
b
i
+
c
j
+
d
k
,
θ
=
ta
n
-
1
b
2
+
c
2
+
d
2
a
,
a
≠
0
π
2
,
a
=
0
,
where q
=
a
+
b
i
+
c
j
+
d
k.Whereq can be derived after calculation as follows: q
=
q
(
cos
⁡
θ
+
μ
sin
θ
)
=
q
e
μ
θ, meanwhile u denotes the eigenaxis, and θ denotes the eigenangle.If vectorα rotating angle θ becomes vector β and e
n denotes unit vector of rotating shaft direction perpendicular to the plane which includes vectors α, β, rotating shaft direction meets the right-hand rule, and then a quaternion will be represented in polar coordinates as follows:
(5)
β
=
cos
⁡
θ
+
e
n
sin
θ
α
.And the corresponding formula of the reverse rotation is as follows:(6)
β
=
cos
⁡
-
θ
+
e
n
sin
-
θ
α
.If the vectorα is not perpendicular to the rotary shaft e
n and it rotates angle θ about the axis of rotation becoming the vector β, the quaternion in polar coordinates is expressed as
(7)
β
=
cos
⁡
θ
2
+
e
n
sin
θ
2
α
cos
⁡
θ
2
-
e
n
sin
θ
2
,
where every color pixel denoted by a quaternion is a three-component vector of integer values in the interval [
0
,
255
].Letx
i
j
=
r
i
j
,
g
i
j
,
b
i
j
T, where r
i
j, g
i
j, b
i
j
∈
{
0
,
1
,
2
,
…
,
255
}. For reasons of symmetry, we transfer the RGB color space from the coordinate origin (
0,0
,
0
) to the center (
127.5
,
127.5
,
127.5
) of the RGB space. Then pure imaginary quaternion of a color pixel x
i
j is expressed as q
i
j
=
(
r
i
j
-
127.5
)
i
+
(
g
i
j
-
127.5
)
j
+
(
b
i
j
-
127.5
)
k, and any unit quaternion U can be represented as R
=
e
u
θ
=
cos
⁡
θ
+
μ
sin
θ. According to the three-dimensional rotation quaternion principle mentioned above, R
X
R
* indicates a three-dimensional vector X (represented by purely imaginary quaternions) rotating an angle 2
θ around theU-axis  [25, 26].


## 2.2. Quaternion Representation of Color Image Edge Points

If color pixels in RGB three-dimensional space are expressed as vectors, the vector modulus value of every pixel would indicate brightness of this pixel, of which direction means the color hue and saturation of the pixel. In order to detect image edge, grayscale pixel vectorμ
=
i
+
j
+
k would be regarded as the rotation axis; that is, when θ
=
π
/
2, it can be expressed in polar coordinates as R
=
e
u
θ
=
i
+
j
+
k. So for any pure imaginary quaternion vector X, R
X
R
* indicates three-dimensional vector X rotating 2
θ angle (180°) around the axis μ, which means X is relative to the vector μ on the axis of symmetry in the opposite direction. According to this principle, for any one of the color pixel vector q, there is q
+
R
q
R
* being a purely imaginary quaternion and q
+
R
q
R
*
=
0. Then for any two color pixel vectors q
1
=
r
1
i
+
g
1
j
+
b
1
k and q
2
=
r
2
i
+
g
2
j
+
b
2
k, we assume q
3
=
q
1
+
R
q
2
R
*. If the two vectors q
1, q
2 are of the same color pixel, q
3 will be a gray pixel vector, which means the direction coincides with the direction of the rotation axis u. If the two vectors q
1, q
2 are not identical, the resultant vector q
3 will deviate from the rotation axis u and be a color pixel. If the hues of q
1 and q
2 are close, q
3 will be located near the gray vector μ. In other words, if there is an arbitrarily small positive number δ, there is q
1
+
R
q
2
R
*
<
δ (δ is an arbitrary small positive number). By this method, if these two color pixel vectors q
1 and q
2 correspond with the pixels in the image edge, it can be naturally judged [27].In fact, for grayscale images, the edges can be considered as brightness discontinuous jump, and for color images, the edge not only has the mutation of the brightness (even the same color on both sides of the border), but also should meet the condition that different color regions are on both sides of the edges (even if the same brightness on both sides of the border). Thus the edge detection problem is to find out the pixel points meeting these two conditions, that is, to detect a pixel set not in the local area of ​​the same color but connecting the pixels of local same color area. If there are two pixels, when a pixel is on the edge, the other pixel is outside the edge, we rotate one pixel 180° around the gray axisu
=
i
+
j
+
k and add it to the other one. The result represents a pixel which must be color. On this basis, for any pixel q
=
r
i
+
g
j
+
b
k, in order to determine whether the pixel is on the edge, we can use the left template and the right template [28] to perform convolution operation as follows:
(8)
β
β
β
0
0
0
1
1
1
c
1
c
2
c
3
0
0
0
c
4
c
5
c
6
β
′
β
′
β
′
0
0
0
1
1
1
,
where c
1
,
c
2
,
c
3
,
c
4
,
c
5
,
and
c
6 are pixels in the image, while
(9)
β
=
cos
⁡
θ
2
+
u
sin
θ
2
,
β
′
=
cos
⁡
θ
2
-
u
sin
θ
2
,
u
=
i
+
j
+
k
.Equation (8) means that the pixels c
1, c
2, and c
3 around the gray axis u rotate 180° according to the right hand rule, and then c
4, c
5, and c
6 will be, respectively, added. Finally, the result obtained is as follows:
(10)
c
′
m
,
n
=
β
c
1
β
′
+
c
4
+
β
c
2
β
′
+
c
5
+
β
c
3
β
′
+
c
6
.If the three color components of the vectorc
′
(
m
,
n
) are equal or approximately equal, then it will be a local pixel of the same color, and if not, it will be an edge pixel. According to this method, we can determine whether a color pixel is an edge point. Our algorithm will be established on the basis of this method.


## 3. Quaternion-Based Improved Artificial Bee Colony Algorithm for Color Remote Sensing Image Edge Detection

In order to solve the optimization problems characterized by the nonconvex, the discontinuous, as well as the nondifferentiable, and so on, much effort has been made during the past decades, which lead to some great success in evolutionary algorithms. The most prominent evolutionary algorithms are particle swarm optimization (PSO) [29], ant colony optimization (ACO) [30], genetic algorithm (GA) [31], biogeography-based optimization (BBO) [32], and so on.ABC has better performance comparing with population-based algorithms such as GA, DE, and PSO. Now, there have been several types of improvements for conventional ABC algorithms. Here we mention a few. The first type of improvement is Rosenbrock ABC (RABC) [33], whose main idea is giving two alternative phases of RABC: the exploration phase realized by ABC and the exploitation phase completed by the rotational direction method. The second one is taking advantage of the information of the best solutions [34, 35]. The third one [36] proposed an interactive ABC, which introduced the concept of universal gravitation into the consideration of the affection between the employed bees and the onlooker bees. But cannot obtain the desired balance between the exploration and the exploitation, convergence of all ABC algorithms is relatively poor when solving complex problems.


### 3.1. Artificial Bee Colony Algorithm

In ABC, bee behavior has the features of autonomy, division of labor, self-organization, and other features. Colony system includes the following elements: bees, honey, and information exchange mechanisms between individuals. Quality of nectar is mainly decided by several aspects: the abundance of nectar, the distance between the point of nectar and bee, and the angle formed between the nectar and sunlight. Worker bees in colonies can be divided into employed bees, onlookers, and scouts. Half of the colony consists of employed bees, and the other half includes onlooker bees. Gathering honey is the basis of survival of swarm, and the basic behaviors of bees are searching nectar, guiding employed bees to the qualified nectar and abandoning the inferior one. The quality and quantity of nectar represent the honey benefits. Finding the most effective source of nectar is a process of exploring the optimal solution. Employed bees master the information of nectar source with high efficiency indexes. Then they pass their food information to the onlooker bees and guide them. But sometimes they exploit the bee nectar themselves. Onlookers are obliged to select good food sources from those found by employed bees to further search the foods. If the food source is abandoned by its employed bees, the employed bees will become the scouts and start to search for a new food source in the vicinity of the hive. Exchange of information between individuals is achieved by the individual dance in the hive dance area.In ABC, location of a food source corresponds to a possible optimal solution. The quantity of the sources of honey represents their fitness of a possible solution. The number of employed bees equalsto the number of food sources. At the initialization step, ABC generates a randomly distributed initial population L of EB solutions(food source positions), where EB denotes the size of employed bees or onlooker bees. The initial solution as follows:C
X
i
=
{
c
x
i
,
1
,
c
x
i
,
2
,
…
c
x
i
,
D
} is produced randomly in the range of the borders with the parameters as follows:
(11)
C
X
i
,
j
=
C
X
l
,
j
+
β
C
X
u
,
j
-
C
X
l
,
j
,
β
∈
-
1,1
,
u
≠
l
,
where i
=
1,2
,
…
,
EB, j
=
1,2
,
…
,
D, and D is the problem dimension; C
X
u
,
j and C
X
l
,
j are the lower and upper borders for the dimension j, respectively.After the initialization step, the population is constantly changing. The employed bees, onlookerbees, and scout bees constantly repeat their search process, which means each employed bee constantly explores new locations and remembers the old best position. If an employed bee finds a new food source that has equal or better quality than the old food source, the old food source will be replaced by the new food source. Otherwise, the old food source will be retained. Each onlooker chooses a food source depending on the probability p
i associated with its fitness fit
i:
(12)
p
i
=
fi
t
i
∑
t
=
1
EB
fi
t
t
,
where fit
i is fitness of solution i.ABC finds a new food location from the old best food location by the following equation:(13)
C
V
i
,
j
=
C
X
i
,
j
+
μ
i
,
j
C
X
i
,
j
-
C
X
k
,
j
,
where k
≠
i  k
∈
{
1,2
,
…
,
EB
}  j
∈
{
1,2
,
…
,
D
}. k and j are randomly chosen indexes, μ
i
,
j is a random number, and μ
i
,
j
∈
[
-
1,1
].If a position cannot be improved further over a predetermined number of cycles, then that food source will be abandoned, and the scout will try to discover a new food source randomly as in (13) to replace C
X
i.


### 3.2. Two New Improved Search Equations

How to improve the performance of the ABC algorithm for balancing between two contradictory aspects of their performance: exploration and exploitation? The key is to improve the search equation. So far there has appeared several improved search equation [35, 37]. But they only improve the performance in certain specific areas. The most representative algorithm is Gbest-guided artificial bee colony algorithm GABC [34]. It proposed ​​the search equation as follows:
(14)
C
V
i
,
j
=
C
X
i
,
j
+
σ
i
,
j
C
X
best
,
j
-
C
X
i
,
j
+
μ
i
,
j
C
X
i
,
j
-
C
X
k
,
j
.The method add the second term in the right side of (14), C
X
best
,
j is thejth element of the global best solution, and σ
i
,
j is a random number within [
0,1.5
]. But the experiment results show that this algorithm improvement of the performance is not obvious.Convergence performance of all the current search equations is not ideal. In this paper, inspired by PSO and combining (13) with (14), we proposed a new improved ABC algorithm (IABC), where two novel search equations are proposed for employed bees and onlookers, respectively, as follows:
(15)
C
V
i
,
j
=
C
X
i
,
j
+
σ
i
,
j
C
X
best
,
j
-
C
X
i
,
j
+
μ
i
,
j
C
X
m
,
j
-
C
X
k
,
j
,
(16)
C
V
i
,
j
=
C
X
m
,
j
+
τ
i
,
j
C
X
best
,
j
+
ω
+
μ
i
,
j
C
X
i
,
j
-
C
X
k
,
j
,
h
h
h
h
h
h
h
h
h
h
h
h
h
h
h
h
h
h
h
h
h
h
h
h
h
h
h
h
h
h
h
h
h
h
h
h
h
p
=
0.2
,
where k, m, i, and best are not equal to each other, k
,
m
∈
{
1,2
,
…
EB
}, and j
∈
{
1,2
,
…
D
}. σ
i
,
j is a random number in the range of [
0,1.5
]. τ
i
,
j is a random number in the range of [
0,1
]. μ
i
,
j is a random number, μ
i
,
j
∈
[
-
1,1
], and ω
=
p
2
/
C
X
best
,
j
2
+
p
2.The main difference is that the GABC algorithm employs one search equation (14), but the IABC algorithm employs two different search equations (15) and (16) based on different emphases.Note that (15) has some similarity with (14). Only the third term is different in (14) and (15); in other words, only the subscripts of the third term i and m are different in (14) and (15). In (15), X
m is a randomly selected individual from the population, which is more diversity and easier to converge. It can bring a more promising candidate solution compared with (15) and (14). Equation (16) is proposed for onlookers. The first term and the second term have changed in (16) compared with (14), while the subscripts of the first term i and m are different in (14) and (16). C
X
m
,
j instead of C
X
i
,
j can improve the exploration capability. Experimental results show that the larger value for coefficient σ
i
,
j leads to the worse solution quality in a certain range, that is why τ
i
,
j instead of σ
i
,
j can improve the quality of the solution. In (16), ω instead of C
X
i
,
j can not only enhance the exploitation but also improve search efficiency. Thus, (16) may be beneficial to not only the convergence, but also the quality of the solution. That is to say, (15) focuses on the exploration, while (16) emphasizes on the exploitation. The emphases of (15) are consistent with the employed bees stage, and the ones of (16) are consistent with the onlookers stage.


### 3.3. We Proposed the Algorithm

Based on the improved colony algorithm, firstly we set the conditions for the end of the cycle (according to actual situation, we probably set a smaller number of cycles, different times, or the conditions for the end of the firstN-effectiveness values, which ​​are greater than a present threshold). According to the conditions, if IABC does not converge and gets some local optimal solutions, these local optima will correspond to the point on the edge of the image. Continue searching until we get the global optimal solution. The global optimal solution and all the local optima constitute edge points of this remote sensing image. Mark all these points, and then we can form the edge of the image.Algorithm process is as follows.(1)
At initialization colony step, we randomly generaten bees including employed bees and onlookers and all the employed bees randomly search the nectars. At last we set the stopping condition (subjective effects or maximum number of iterations).
(2)
According to the fitness function, we evaluate the (corresponding nectar sources) fitness indicators of individual bees.
(3)
When the stopping condition is not satisfied, we select the firstS
n bees with the highest value of fitness to be the employers. Then the employed bees hired S
o onlookers, which will follow the employed bees to the neighborhood of S
n nectar sources to search for new nectar source locations, and assess the efficiency indicators.
(4)
If a position cannot be improved further over a predetermined number of cycles, then that food source will be abandoned, and the current position will be retained; otherwise, the employer bees will become scout ones.
(5)
Scouts randomly search the nectars and evaluate their value of fitness.
(6)
When setting condition, we update all the local nectar pbest (i) (i
=
1
,
2
,
3
,
…
,
n) and the global nectar gbest (i) (i
=
1
,
2
,
3
,
…
,
N).
(7)
Seti
=
i
+
1 and return to (2) until i
=
MAX or reach the stop condition.
(8)
Mark position corresponding to the global optimal solution and all the local optima.
(9)
End.


### 3.4. The Fitness Function

In the image, the function which is strongly associated with the information of edge points can be used for IABC algorithm fitness. Pixel values correspond to the higher fitness, the greater possibility that the pixel can be the edge point. Fitness function can refer to pheromone function of the literature [38].


### 3.5. Parameter Settings

In the conventional ABC, the colony of artificial bees contains three types of bees: employed bees, onlookers, and scouts. Half of the colony consists of employed bees, and the other half includes onlooker bees. But in fact, we use ABC to perform image edge detection, and changing the parameters has a greater impact on the image edge detection effect. Above all parameter setting is crucial. Based on the experimental results, we adjust the parameters of the conventional ABC as follows.Let the number of all the worker bees beS with a more reasonable value range 600 ≤ S ≤ 1600. Let the number of employed bees be S
e, where 0.35S ≤ S
e ≤ 0.55S. If S and S
e are too small, it will result in the detection of the image that has missed too many points. If S is too large for image edge detection without obvious contribution, that will only waste more time. Set onlookers scale S
o, where 0.40S ≤ S
o ≤ 0.60S; let the number of scouts be S
s, where 0.05S ≤ S
s ≤ 0.10S. If S
s is too small, it will increase the algorithm difficulties for jumping out of local optimal solution. If too large, it will increase search computation. In each iteration, bees can be moved along 8-direction of the neighborhood. After calculating the maximum probability for bees of 8-direction of the neighborhood, we select the next locations and steps. Fitness values of bees on each pixel constitute a matrix of fitness values. After the bees had flied to the appropriate number of steps, the fitness value matrix is updated.


## 3.1. Artificial Bee Colony Algorithm

In ABC, bee behavior has the features of autonomy, division of labor, self-organization, and other features. Colony system includes the following elements: bees, honey, and information exchange mechanisms between individuals. Quality of nectar is mainly decided by several aspects: the abundance of nectar, the distance between the point of nectar and bee, and the angle formed between the nectar and sunlight. Worker bees in colonies can be divided into employed bees, onlookers, and scouts. Half of the colony consists of employed bees, and the other half includes onlooker bees. Gathering honey is the basis of survival of swarm, and the basic behaviors of bees are searching nectar, guiding employed bees to the qualified nectar and abandoning the inferior one. The quality and quantity of nectar represent the honey benefits. Finding the most effective source of nectar is a process of exploring the optimal solution. Employed bees master the information of nectar source with high efficiency indexes. Then they pass their food information to the onlooker bees and guide them. But sometimes they exploit the bee nectar themselves. Onlookers are obliged to select good food sources from those found by employed bees to further search the foods. If the food source is abandoned by its employed bees, the employed bees will become the scouts and start to search for a new food source in the vicinity of the hive. Exchange of information between individuals is achieved by the individual dance in the hive dance area.In ABC, location of a food source corresponds to a possible optimal solution. The quantity of the sources of honey represents their fitness of a possible solution. The number of employed bees equalsto the number of food sources. At the initialization step, ABC generates a randomly distributed initial population L of EB solutions(food source positions), where EB denotes the size of employed bees or onlooker bees. The initial solution as follows:C
X
i
=
{
c
x
i
,
1
,
c
x
i
,
2
,
…
c
x
i
,
D
} is produced randomly in the range of the borders with the parameters as follows:
(11)
C
X
i
,
j
=
C
X
l
,
j
+
β
C
X
u
,
j
-
C
X
l
,
j
,
β
∈
-
1,1
,
u
≠
l
,
where i
=
1,2
,
…
,
EB, j
=
1,2
,
…
,
D, and D is the problem dimension; C
X
u
,
j and C
X
l
,
j are the lower and upper borders for the dimension j, respectively.After the initialization step, the population is constantly changing. The employed bees, onlookerbees, and scout bees constantly repeat their search process, which means each employed bee constantly explores new locations and remembers the old best position. If an employed bee finds a new food source that has equal or better quality than the old food source, the old food source will be replaced by the new food source. Otherwise, the old food source will be retained. Each onlooker chooses a food source depending on the probability p
i associated with its fitness fit
i:
(12)
p
i
=
fi
t
i
∑
t
=
1
EB
fi
t
t
,
where fit
i is fitness of solution i.ABC finds a new food location from the old best food location by the following equation:(13)
C
V
i
,
j
=
C
X
i
,
j
+
μ
i
,
j
C
X
i
,
j
-
C
X
k
,
j
,
where k
≠
i  k
∈
{
1,2
,
…
,
EB
}  j
∈
{
1,2
,
…
,
D
}. k and j are randomly chosen indexes, μ
i
,
j is a random number, and μ
i
,
j
∈
[
-
1,1
].If a position cannot be improved further over a predetermined number of cycles, then that food source will be abandoned, and the scout will try to discover a new food source randomly as in (13) to replace C
X
i.


## 3.2. Two New Improved Search Equations

How to improve the performance of the ABC algorithm for balancing between two contradictory aspects of their performance: exploration and exploitation? The key is to improve the search equation. So far there has appeared several improved search equation [35, 37]. But they only improve the performance in certain specific areas. The most representative algorithm is Gbest-guided artificial bee colony algorithm GABC [34]. It proposed ​​the search equation as follows:
(14)
C
V
i
,
j
=
C
X
i
,
j
+
σ
i
,
j
C
X
best
,
j
-
C
X
i
,
j
+
μ
i
,
j
C
X
i
,
j
-
C
X
k
,
j
.The method add the second term in the right side of (14), C
X
best
,
j is thejth element of the global best solution, and σ
i
,
j is a random number within [
0,1.5
]. But the experiment results show that this algorithm improvement of the performance is not obvious.Convergence performance of all the current search equations is not ideal. In this paper, inspired by PSO and combining (13) with (14), we proposed a new improved ABC algorithm (IABC), where two novel search equations are proposed for employed bees and onlookers, respectively, as follows:
(15)
C
V
i
,
j
=
C
X
i
,
j
+
σ
i
,
j
C
X
best
,
j
-
C
X
i
,
j
+
μ
i
,
j
C
X
m
,
j
-
C
X
k
,
j
,
(16)
C
V
i
,
j
=
C
X
m
,
j
+
τ
i
,
j
C
X
best
,
j
+
ω
+
μ
i
,
j
C
X
i
,
j
-
C
X
k
,
j
,
h
h
h
h
h
h
h
h
h
h
h
h
h
h
h
h
h
h
h
h
h
h
h
h
h
h
h
h
h
h
h
h
h
h
h
h
h
p
=
0.2
,
where k, m, i, and best are not equal to each other, k
,
m
∈
{
1,2
,
…
EB
}, and j
∈
{
1,2
,
…
D
}. σ
i
,
j is a random number in the range of [
0,1.5
]. τ
i
,
j is a random number in the range of [
0,1
]. μ
i
,
j is a random number, μ
i
,
j
∈
[
-
1,1
], and ω
=
p
2
/
C
X
best
,
j
2
+
p
2.The main difference is that the GABC algorithm employs one search equation (14), but the IABC algorithm employs two different search equations (15) and (16) based on different emphases.Note that (15) has some similarity with (14). Only the third term is different in (14) and (15); in other words, only the subscripts of the third term i and m are different in (14) and (15). In (15), X
m is a randomly selected individual from the population, which is more diversity and easier to converge. It can bring a more promising candidate solution compared with (15) and (14). Equation (16) is proposed for onlookers. The first term and the second term have changed in (16) compared with (14), while the subscripts of the first term i and m are different in (14) and (16). C
X
m
,
j instead of C
X
i
,
j can improve the exploration capability. Experimental results show that the larger value for coefficient σ
i
,
j leads to the worse solution quality in a certain range, that is why τ
i
,
j instead of σ
i
,
j can improve the quality of the solution. In (16), ω instead of C
X
i
,
j can not only enhance the exploitation but also improve search efficiency. Thus, (16) may be beneficial to not only the convergence, but also the quality of the solution. That is to say, (15) focuses on the exploration, while (16) emphasizes on the exploitation. The emphases of (15) are consistent with the employed bees stage, and the ones of (16) are consistent with the onlookers stage.


## 3.3. We Proposed the Algorithm

Based on the improved colony algorithm, firstly we set the conditions for the end of the cycle (according to actual situation, we probably set a smaller number of cycles, different times, or the conditions for the end of the firstN-effectiveness values, which ​​are greater than a present threshold). According to the conditions, if IABC does not converge and gets some local optimal solutions, these local optima will correspond to the point on the edge of the image. Continue searching until we get the global optimal solution. The global optimal solution and all the local optima constitute edge points of this remote sensing image. Mark all these points, and then we can form the edge of the image.Algorithm process is as follows.(1)
At initialization colony step, we randomly generaten bees including employed bees and onlookers and all the employed bees randomly search the nectars. At last we set the stopping condition (subjective effects or maximum number of iterations).
(2)
According to the fitness function, we evaluate the (corresponding nectar sources) fitness indicators of individual bees.
(3)
When the stopping condition is not satisfied, we select the firstS
n bees with the highest value of fitness to be the employers. Then the employed bees hired S
o onlookers, which will follow the employed bees to the neighborhood of S
n nectar sources to search for new nectar source locations, and assess the efficiency indicators.
(4)
If a position cannot be improved further over a predetermined number of cycles, then that food source will be abandoned, and the current position will be retained; otherwise, the employer bees will become scout ones.
(5)
Scouts randomly search the nectars and evaluate their value of fitness.
(6)
When setting condition, we update all the local nectar pbest (i) (i
=
1
,
2
,
3
,
…
,
n) and the global nectar gbest (i) (i
=
1
,
2
,
3
,
…
,
N).
(7)
Seti
=
i
+
1 and return to (2) until i
=
MAX or reach the stop condition.
(8)
Mark position corresponding to the global optimal solution and all the local optima.
(9)
End.


## 3.4. The Fitness Function

In the image, the function which is strongly associated with the information of edge points can be used for IABC algorithm fitness. Pixel values correspond to the higher fitness, the greater possibility that the pixel can be the edge point. Fitness function can refer to pheromone function of the literature [38].


## 3.5. Parameter Settings

In the conventional ABC, the colony of artificial bees contains three types of bees: employed bees, onlookers, and scouts. Half of the colony consists of employed bees, and the other half includes onlooker bees. But in fact, we use ABC to perform image edge detection, and changing the parameters has a greater impact on the image edge detection effect. Above all parameter setting is crucial. Based on the experimental results, we adjust the parameters of the conventional ABC as follows.Let the number of all the worker bees beS with a more reasonable value range 600 ≤ S ≤ 1600. Let the number of employed bees be S
e, where 0.35S ≤ S
e ≤ 0.55S. If S and S
e are too small, it will result in the detection of the image that has missed too many points. If S is too large for image edge detection without obvious contribution, that will only waste more time. Set onlookers scale S
o, where 0.40S ≤ S
o ≤ 0.60S; let the number of scouts be S
s, where 0.05S ≤ S
s ≤ 0.10S. If S
s is too small, it will increase the algorithm difficulties for jumping out of local optimal solution. If too large, it will increase search computation. In each iteration, bees can be moved along 8-direction of the neighborhood. After calculating the maximum probability for bees of 8-direction of the neighborhood, we select the next locations and steps. Fitness values of bees on each pixel constitute a matrix of fitness values. After the bees had flied to the appropriate number of steps, the fitness value matrix is updated.


## 4. Experiments and Results

To verify the efficiency of the proposed method in color remote sensing image edge detection, experiments have been carried on with a lot of color remote sensing images, which are obtained in actual experiments. In this section, there are two experiments. In the first experiment, we assess the impact caused by the various numbers of different bees on the image edge detection. In the second experiment, we compare our method to other methods on color remote sensing image edge detection. However the results always show that our method is better.


### 4.1. Assess the Impact Caused by the Various Numbers of Different Bees on Color Remote Sensing Image Edge Detection

In this experiment, we use the remote sensing image of an island. Select a480
×
521 pixel area as the study area. Set the number of employed bees S
e
=
0.50
S, the number of onlookers S
o
=
0.45
S, and the number of scouts S
s
=
0.05
S; when the bees’ scale S was 600, 800, 1200, and 1600, we perform the image edge detection. In Figures 1(b)–1(e), it, respectively, shows the image edge detection result with s
=
600, s
=
800, s
=
1200, and s
=
1600. In Figure 1, when the colony size S is relatively small such as s
=
600, s
=
800, the edge of the island is affected by noise and image texture as shown in Figures 1(b)-1(c). There is a clear phenomenon of false edges and missed points leading to rough edges. Additionally, color contrast of shallow water area at the edge of the island is not obvious making it unable to be extracted. However when the number of bees is set 1200 and 1600, not only the island edges can be more clearly extracted and much less noise exists, but also the shallow edge of the island can be extracted. As seen from Figure 1, when the remote sensing image detail in the image is not too complicated or rich, the colony number can be reduced appropriately.Performance evaluation: (a) “island” original image, (b) “island” image edge detection result with 600 bees, (c) “island” image edge detection result with 800 bees, (d) “island” image edge detection result with 1200 bees, and (e) “island” image edge detection result with 1600 bees.
(a)
(b)
(c)
(d)
(e)


### 4.2. Experiment on IABC Algorithm for Remote Sensing Images Edge Detection

In this experiment, we use different types of color remote sensing images to illustrate the effect of our method, including the image of sports center and the image of forest fires. We, respectively, select728
×
656 and 325
×
245 pixel region as research subjects, where S
=
1600. This study is divided into two parts. The first part is a subjective evaluation, and three algorithms were carried out on two remote sensing images. Edge detection results are shown in Figures 2(b)–2(d) and Figures 3(b)–3(d). From left to right, there are sequentially ABC of nonquaternion representation result image, ABC of quaternion representation result image, and IABC of quaternion representation result image in Figures 2-3.“Sports center” original image and the three algorithms results: (a) “sports center” original image, (b) ABC of nonquaternion representation result image, (c) ABC of quaternion representation result image, and (d) IABC of quaternion representation result image.
(a)
(b)
(c)
(d)“Forest fires” original image and the three algorithms results: (a) “forest fires” original image, (b) ABC of nonquaternion representation result image, (c) ABC of quaternion representation result image, and (d) IABC of quaternion representation result image.
(a)
(b)
(c)
(d)As seen in Figures2(b)–2(d), Figure 2(d) is the best, while Figure 2(b) is the worst. In Figures 2(b)-2(c), there have been a considerable number of undetected points and wrong points. But in Figure 2(d), there are less wrong points, and the entire structure, contour of sports center image, and the runway have been clearly detected. In Figures 2(c)-2(d) and Figures 3(c)-3(d), noise is effectively suppressed. This is mainly due to using quaternions to describe the vectors of color pixels, making noise point be a singular point. So it is easy to separate the noise points and general pixels. In Figure 3(b), the effect of image edge detection is the worst. The red part of the forest fire edge line is interrupted, and the river edge in the forest fire image is not even completely extracted. In Figures 3(c)-3(d), the effect of image edge detection is relatively better. Additionally image edge detection effect in Figure 3(d) is even better and the forest fire edges line is more complete, the edge of the forest and the river’s edge is more clear. Even the noise is also smaller.The second part of the experiment is the one about the objective. By summarizing and analysing the numerical results listed in Tables1–5, some conclusions can be drawn.Table 1
Comparison of three algorithms on time in sports center image.
Times
Quaternion representation
Nonquaternion representation
IABC
ABC
ABC
1
122.21
160.71
294.03
2
124.03
155.94
293.12
3
118.20
160.37
283.59
4
121.11
156.56
298.45
5
122.37
167.01
303.23
6
122.79
160.32
301.09
7
118.19
154.52
287.43
8
120.49
159.01
292.16
9
118.66
161.75
294.62
10
118.23
155.36
308.10
11
121.21
158.19
303.22
12
122.49
154.32
295.98
13
122.20
157.50
289.56
14
119.18
152.29
303.09
15
119.49
158.98
349.92
16
121.29
159.22
269.85
17
118.20
153.09
289.72
18
119.17
153.45
305.89
19
117.78
155.99
319.04
20
119.32
154.93
343.24
21
120.35
158.92
321.03
22
119.24
160.24
313.32
23
118.90
152.92
321.49
24
119.92
158.39
294.34
25
118.17
163.96
302.44
26
117.79
152.24
292.37
27
119.95
155.76
300.20
28
125.39
154.04
299.13
29
116.89
157.84
321.50
30
120.25
154.42
345.67
31
119.64
156.23
323.89
32
117.93
158.60
317.21
33
118.42
153.33
340.26
34
122.72
157.50
321.29
35
120.29
161.34
334.03
36
121.83
152.99
304.18
37
120.30
161.76
298.01
38
121.49
158.54
313.94
39
118.07
155.62
298.99
40
120.80
154.27
302.95
41
118.56
162.04
299.48
42
119.98
163.76
287.65
43
117.95
164.03
269.24
44
119.22
163.62
294.67
45
117.92
159.32
325.24
46
116.75
162.92
331.08
47
118.91
153.02
332.12
48
122.34
164.36
302.79
49
121.80
161.29
289.70
50
120.24
154.40
291.46
Mean
119.97
157.94
306.3Table 2
Comparison of three algorithms on time in forest fires image.
Times
Quaternion representation
Nonquaternion representation
IABC
ABC
ABC
1
26.12
38.33
63.22
2
24.16
35.25
62.35
3
25.38
36.29
64.92
4
24.67
35.47
63.27
5
27.24
34.90
66.78
6
27.38
37.23
62.20
7
24.35
38.89
70.39
8
29.27
35.47
65.32
9
26.87
37.18
61.12
10
28.63
38.47
69.37
11
25.89
35.27
63.92
12
26.70
37.98
64.94
13
28.25
33.50
63.03
14
29.30
36.54
65.34
15
29.88
36.95
66.29
16
26.95
35.83
67.36
17
29.13
34.92
62.29
18
27.19
33.24
70.23
19
28.99
36.19
68.24
20
26.03
35.49
67.25
21
27.89
35.19
63.37
22
28.98
35.20
69.19
23
26.40
36.29
65.29
24
27.09
36.08
68.30
25
28.49
36.79
63.36
26
26.59
37.59
61.27
27
28.25
39.99
66.32
28
28.20
38.29
65.25
29
27.13
35.29
68.24
30
27.16
35.79
67.20
31
26.12
34.89
64.81
32
27.39
38.34
65.29
33
27.80
37.94
62.45
34
28.98
38.46
65.29
35
27.51
38.29
65.28
36
26.00
39.19
69.29
37
27.37
35.65
70.66
38
28.28
37.98
68.29
39
28.67
36.04
65.33
40
27.39
34.34
63.39
41
27.18
36.28
66.02
42
26.09
32.40
64.04
43
26.98
36.40
67.21
44
25.79
35.85
65.32
45
27.92
34.45
64.29
46
28.79
35.58
65.28
47
25.20
36.98
62.22
48
26.23
36.55
68.09
49
28.27
36.98
65.21
50
26.68
34.76
67.90
Mean
27.26
36.34
65.63Table 3
ABC algorithm based on nonquaternion representation experimental data table.
Image
Edge points (A)
4-connected number (B)
8-connected number (C)
C
/
A
C
/
B
Sports center
126745
3540
2408
0.018999
0.680226
Forest fires
21387
528
336
0.01571
0.636364Table 4
ABC algorithm based on quaternion representation experimental data table.
Image
Edge points (A)
4-connected number (B)
8-connected number (C)
C
/
A
C
/
B
Sports center
139681
3897
2519
0.018034
0.646395
Forest fires
26476
723
436
0.016468
0.603043Table 5
IABC algorithm based on quaternion representation experimental data table.
Image
Edge points (A)
4-connected number (B)
8-connected number (C)
C
/
A
C
/
B
Sports center
168173
4467
2793
0.016608
0.625252
Forest fires
320123
831
489
0.001528
0.588448After analysing the time and quantity of the two remote sensing images and independently performing each of these three algorithms 50 times, in terms of time, the results are shown in Tables1 and 2. In terms of quantity, according to the literature [39], we use quantitative analysis method to perform the image edge detection. This is a typical method to evaluate the effect of image edge detection. The experimental data is shown in Tables 3–5.As seen from Tables1 and 2, for color images using quaternion representation, compared with the average time, in Table 1, average running time of IABC is 75.96% of ABC and is 39.21% of ABC based on nonquaternion representation. In Table 2, for color images using quaternion representation, average running time of IABC is 75.01% of ABC and is 41.45% of ABC based on the nonquaternion representation. For color images using quaternion representation, the result not only means the average running speed of IABC is faster than the ABC, but also means that the average running speed of ABC based on quaternion representation is faster than ABC based on the nonquaternion representation. Above all, the proposed method is faster than the other two methods. In Tables 1 and 2, 728
×
656 pixel region of sports center image is selected as the research subjects, and 325
×
245 pixel region of forest fires image is selected as the research subjects. So the data volume of sports center image is about six times as large as the one of forest fires image. But the running time of IABC based on quaternion representation in the sports center image is 4.3 times the one of IABC based on quaternion representation in the forest fires image. The running time of ABC based on quaternion representation in the sports center image is 4.4 times the one of ABC based on quaternion representation in the forest fires image. The running time of ABC based on nonquaternion representation in the sports center image is 4.7 times the one of ABC based on nonquaternion representation in the forest fires image. This shows that one of the advantages of the proposed method with the remote sensing image data volume is a great acceleration in terms of speed. On one hand, it is because the IABC algorithm has a higher efficiency. On the other hand, it is due to the quaternion representation of color image. Vector of a color pixel is described by using only a triple array, rather than the three color separation method of the red, green, and blue. Therefore the proposed method runs faster, and results are more accurate and stable.Tables3–5 are the result of the three algorithms applied to the two remote sensing images in the experiment. Quantitative analysis of the effect of edge detection is shown in Tables 3–5. A, B, and C stand, respectively, for the edge points, 4-connected numbers, and 8-connected numbers. The sizes ofC/A andC/B reflect the tightness of the edge line connection, which have a significant impact on the overall evaluation of the edges. That is to say, the values ofC/A andC/B represent the number of error points detected and points missed in the image edge detection. Obviously, if the values ofC/A andC/B are smaller, the edge line connection will be better and the points missed and the wrong points detected will be fewer in the image edge detection. Thus the result of edge detection is more accurate, and the effect is better. On the contrary, if the values ofC/A andC/B are larger, the edge line connection will be poorer, the points missed and the wrong points detected will be the more, and the edge extraction effect will be worse. Additionally we know that theC/B has a greater impact thanC/A on the image edge detection from the analysis of the results of edge detection. In Tables 3–5,C/A andC/B of IABC based on quaternion representation are the smallest, which means that our method is the best in remote sensing image edge detection. In Tables 3 and 4,C/A in Table 3 andC/A in Table 4 are almost equal in sports center image, andC/A in Table 3 is slightly smaller thanC/A in Table 4 in forest fire image. HoweverC/B in Table 3 is significantly larger thanC/B in Table 4 in sports center image, andC/B in Table 3 is significantly larger thanC/B in Table 4 in forest fires image. AsC/B has a greater impact thanC/A on remote sensing image edge detection, ABC algorithm based on quaternion representation has a better effect than ABC algorithm based on nonquaternion representation in remote sensing image edge detection; that is to say, the edge line connection is better and the points missed and the wrong points detected are fewer in the image edge detection. Further in Tables 4 and 5,C/A andC/B in Table 5 of IABC algorithm based on quaternion representation are both smaller thanC/A andC/B in Table 4, which means it has a better edge detection effect than ABC algorithm based on quaternion representation.In short, the effect of ABC based on nonquaternion representation is the worst in remote sensing image edge detection. The effect of IABC algorithm based on quaternion representation is the best in remote sensing image edge detection.


## 4.1. Assess the Impact Caused by the Various Numbers of Different Bees on Color Remote Sensing Image Edge Detection

In this experiment, we use the remote sensing image of an island. Select a480
×
521 pixel area as the study area. Set the number of employed bees S
e
=
0.50
S, the number of onlookers S
o
=
0.45
S, and the number of scouts S
s
=
0.05
S; when the bees’ scale S was 600, 800, 1200, and 1600, we perform the image edge detection. In Figures 1(b)–1(e), it, respectively, shows the image edge detection result with s
=
600, s
=
800, s
=
1200, and s
=
1600. In Figure 1, when the colony size S is relatively small such as s
=
600, s
=
800, the edge of the island is affected by noise and image texture as shown in Figures 1(b)-1(c). There is a clear phenomenon of false edges and missed points leading to rough edges. Additionally, color contrast of shallow water area at the edge of the island is not obvious making it unable to be extracted. However when the number of bees is set 1200 and 1600, not only the island edges can be more clearly extracted and much less noise exists, but also the shallow edge of the island can be extracted. As seen from Figure 1, when the remote sensing image detail in the image is not too complicated or rich, the colony number can be reduced appropriately.Performance evaluation: (a) “island” original image, (b) “island” image edge detection result with 600 bees, (c) “island” image edge detection result with 800 bees, (d) “island” image edge detection result with 1200 bees, and (e) “island” image edge detection result with 1600 bees.
(a)
(b)
(c)
(d)
(e)


## 4.2. Experiment on IABC Algorithm for Remote Sensing Images Edge Detection

In this experiment, we use different types of color remote sensing images to illustrate the effect of our method, including the image of sports center and the image of forest fires. We, respectively, select728
×
656 and 325
×
245 pixel region as research subjects, where S
=
1600. This study is divided into two parts. The first part is a subjective evaluation, and three algorithms were carried out on two remote sensing images. Edge detection results are shown in Figures 2(b)–2(d) and Figures 3(b)–3(d). From left to right, there are sequentially ABC of nonquaternion representation result image, ABC of quaternion representation result image, and IABC of quaternion representation result image in Figures 2-3.“Sports center” original image and the three algorithms results: (a) “sports center” original image, (b) ABC of nonquaternion representation result image, (c) ABC of quaternion representation result image, and (d) IABC of quaternion representation result image.
(a)
(b)
(c)
(d)“Forest fires” original image and the three algorithms results: (a) “forest fires” original image, (b) ABC of nonquaternion representation result image, (c) ABC of quaternion representation result image, and (d) IABC of quaternion representation result image.
(a)
(b)
(c)
(d)As seen in Figures2(b)–2(d), Figure 2(d) is the best, while Figure 2(b) is the worst. In Figures 2(b)-2(c), there have been a considerable number of undetected points and wrong points. But in Figure 2(d), there are less wrong points, and the entire structure, contour of sports center image, and the runway have been clearly detected. In Figures 2(c)-2(d) and Figures 3(c)-3(d), noise is effectively suppressed. This is mainly due to using quaternions to describe the vectors of color pixels, making noise point be a singular point. So it is easy to separate the noise points and general pixels. In Figure 3(b), the effect of image edge detection is the worst. The red part of the forest fire edge line is interrupted, and the river edge in the forest fire image is not even completely extracted. In Figures 3(c)-3(d), the effect of image edge detection is relatively better. Additionally image edge detection effect in Figure 3(d) is even better and the forest fire edges line is more complete, the edge of the forest and the river’s edge is more clear. Even the noise is also smaller.The second part of the experiment is the one about the objective. By summarizing and analysing the numerical results listed in Tables1–5, some conclusions can be drawn.Table 1
Comparison of three algorithms on time in sports center image.
Times
Quaternion representation
Nonquaternion representation
IABC
ABC
ABC
1
122.21
160.71
294.03
2
124.03
155.94
293.12
3
118.20
160.37
283.59
4
121.11
156.56
298.45
5
122.37
167.01
303.23
6
122.79
160.32
301.09
7
118.19
154.52
287.43
8
120.49
159.01
292.16
9
118.66
161.75
294.62
10
118.23
155.36
308.10
11
121.21
158.19
303.22
12
122.49
154.32
295.98
13
122.20
157.50
289.56
14
119.18
152.29
303.09
15
119.49
158.98
349.92
16
121.29
159.22
269.85
17
118.20
153.09
289.72
18
119.17
153.45
305.89
19
117.78
155.99
319.04
20
119.32
154.93
343.24
21
120.35
158.92
321.03
22
119.24
160.24
313.32
23
118.90
152.92
321.49
24
119.92
158.39
294.34
25
118.17
163.96
302.44
26
117.79
152.24
292.37
27
119.95
155.76
300.20
28
125.39
154.04
299.13
29
116.89
157.84
321.50
30
120.25
154.42
345.67
31
119.64
156.23
323.89
32
117.93
158.60
317.21
33
118.42
153.33
340.26
34
122.72
157.50
321.29
35
120.29
161.34
334.03
36
121.83
152.99
304.18
37
120.30
161.76
298.01
38
121.49
158.54
313.94
39
118.07
155.62
298.99
40
120.80
154.27
302.95
41
118.56
162.04
299.48
42
119.98
163.76
287.65
43
117.95
164.03
269.24
44
119.22
163.62
294.67
45
117.92
159.32
325.24
46
116.75
162.92
331.08
47
118.91
153.02
332.12
48
122.34
164.36
302.79
49
121.80
161.29
289.70
50
120.24
154.40
291.46
Mean
119.97
157.94
306.3Table 2
Comparison of three algorithms on time in forest fires image.
Times
Quaternion representation
Nonquaternion representation
IABC
ABC
ABC
1
26.12
38.33
63.22
2
24.16
35.25
62.35
3
25.38
36.29
64.92
4
24.67
35.47
63.27
5
27.24
34.90
66.78
6
27.38
37.23
62.20
7
24.35
38.89
70.39
8
29.27
35.47
65.32
9
26.87
37.18
61.12
10
28.63
38.47
69.37
11
25.89
35.27
63.92
12
26.70
37.98
64.94
13
28.25
33.50
63.03
14
29.30
36.54
65.34
15
29.88
36.95
66.29
16
26.95
35.83
67.36
17
29.13
34.92
62.29
18
27.19
33.24
70.23
19
28.99
36.19
68.24
20
26.03
35.49
67.25
21
27.89
35.19
63.37
22
28.98
35.20
69.19
23
26.40
36.29
65.29
24
27.09
36.08
68.30
25
28.49
36.79
63.36
26
26.59
37.59
61.27
27
28.25
39.99
66.32
28
28.20
38.29
65.25
29
27.13
35.29
68.24
30
27.16
35.79
67.20
31
26.12
34.89
64.81
32
27.39
38.34
65.29
33
27.80
37.94
62.45
34
28.98
38.46
65.29
35
27.51
38.29
65.28
36
26.00
39.19
69.29
37
27.37
35.65
70.66
38
28.28
37.98
68.29
39
28.67
36.04
65.33
40
27.39
34.34
63.39
41
27.18
36.28
66.02
42
26.09
32.40
64.04
43
26.98
36.40
67.21
44
25.79
35.85
65.32
45
27.92
34.45
64.29
46
28.79
35.58
65.28
47
25.20
36.98
62.22
48
26.23
36.55
68.09
49
28.27
36.98
65.21
50
26.68
34.76
67.90
Mean
27.26
36.34
65.63Table 3
ABC algorithm based on nonquaternion representation experimental data table.
Image
Edge points (A)
4-connected number (B)
8-connected number (C)
C
/
A
C
/
B
Sports center
126745
3540
2408
0.018999
0.680226
Forest fires
21387
528
336
0.01571
0.636364Table 4
ABC algorithm based on quaternion representation experimental data table.
Image
Edge points (A)
4-connected number (B)
8-connected number (C)
C
/
A
C
/
B
Sports center
139681
3897
2519
0.018034
0.646395
Forest fires
26476
723
436
0.016468
0.603043Table 5
IABC algorithm based on quaternion representation experimental data table.
Image
Edge points (A)
4-connected number (B)
8-connected number (C)
C
/
A
C
/
B
Sports center
168173
4467
2793
0.016608
0.625252
Forest fires
320123
831
489
0.001528
0.588448After analysing the time and quantity of the two remote sensing images and independently performing each of these three algorithms 50 times, in terms of time, the results are shown in Tables1 and 2. In terms of quantity, according to the literature [39], we use quantitative analysis method to perform the image edge detection. This is a typical method to evaluate the effect of image edge detection. The experimental data is shown in Tables 3–5.As seen from Tables1 and 2, for color images using quaternion representation, compared with the average time, in Table 1, average running time of IABC is 75.96% of ABC and is 39.21% of ABC based on nonquaternion representation. In Table 2, for color images using quaternion representation, average running time of IABC is 75.01% of ABC and is 41.45% of ABC based on the nonquaternion representation. For color images using quaternion representation, the result not only means the average running speed of IABC is faster than the ABC, but also means that the average running speed of ABC based on quaternion representation is faster than ABC based on the nonquaternion representation. Above all, the proposed method is faster than the other two methods. In Tables 1 and 2, 728
×
656 pixel region of sports center image is selected as the research subjects, and 325
×
245 pixel region of forest fires image is selected as the research subjects. So the data volume of sports center image is about six times as large as the one of forest fires image. But the running time of IABC based on quaternion representation in the sports center image is 4.3 times the one of IABC based on quaternion representation in the forest fires image. The running time of ABC based on quaternion representation in the sports center image is 4.4 times the one of ABC based on quaternion representation in the forest fires image. The running time of ABC based on nonquaternion representation in the sports center image is 4.7 times the one of ABC based on nonquaternion representation in the forest fires image. This shows that one of the advantages of the proposed method with the remote sensing image data volume is a great acceleration in terms of speed. On one hand, it is because the IABC algorithm has a higher efficiency. On the other hand, it is due to the quaternion representation of color image. Vector of a color pixel is described by using only a triple array, rather than the three color separation method of the red, green, and blue. Therefore the proposed method runs faster, and results are more accurate and stable.Tables3–5 are the result of the three algorithms applied to the two remote sensing images in the experiment. Quantitative analysis of the effect of edge detection is shown in Tables 3–5. A, B, and C stand, respectively, for the edge points, 4-connected numbers, and 8-connected numbers. The sizes ofC/A andC/B reflect the tightness of the edge line connection, which have a significant impact on the overall evaluation of the edges. That is to say, the values ofC/A andC/B represent the number of error points detected and points missed in the image edge detection. Obviously, if the values ofC/A andC/B are smaller, the edge line connection will be better and the points missed and the wrong points detected will be fewer in the image edge detection. Thus the result of edge detection is more accurate, and the effect is better. On the contrary, if the values ofC/A andC/B are larger, the edge line connection will be poorer, the points missed and the wrong points detected will be the more, and the edge extraction effect will be worse. Additionally we know that theC/B has a greater impact thanC/A on the image edge detection from the analysis of the results of edge detection. In Tables 3–5,C/A andC/B of IABC based on quaternion representation are the smallest, which means that our method is the best in remote sensing image edge detection. In Tables 3 and 4,C/A in Table 3 andC/A in Table 4 are almost equal in sports center image, andC/A in Table 3 is slightly smaller thanC/A in Table 4 in forest fire image. HoweverC/B in Table 3 is significantly larger thanC/B in Table 4 in sports center image, andC/B in Table 3 is significantly larger thanC/B in Table 4 in forest fires image. AsC/B has a greater impact thanC/A on remote sensing image edge detection, ABC algorithm based on quaternion representation has a better effect than ABC algorithm based on nonquaternion representation in remote sensing image edge detection; that is to say, the edge line connection is better and the points missed and the wrong points detected are fewer in the image edge detection. Further in Tables 4 and 5,C/A andC/B in Table 5 of IABC algorithm based on quaternion representation are both smaller thanC/A andC/B in Table 4, which means it has a better edge detection effect than ABC algorithm based on quaternion representation.In short, the effect of ABC based on nonquaternion representation is the worst in remote sensing image edge detection. The effect of IABC algorithm based on quaternion representation is the best in remote sensing image edge detection.


## 5. Conclusion

In this paper, at the first time, we propose the quaternion-based improved ABC (IABC) method for color remote sensing image edge detection. By this method, when using quaternions to describe color pixel vectors, noise point becomes a singular point making it easy to separate the noise points and the general pixels. In IABC, two modified search equations are introduced to generate candidate solutions in the employed bee phase and the onlookers phase, respectively, which significantly improve the convergence speed. In addition, a more reasonable ABC parameter is proposed. Then the new method is used in color image. The comparison of experiment results among the new method, the quaternion-based ABC method, and the conventional ABC method shows that the new method can get a higher accuracy and be easier to suppress the noise. Above all, our method is a very competent method.



---

*Source: 138930-2015-03-02.xml*