# Edge Detection in UAV Remote Sensing Images Using the Method Integrating Zernike Moments with Clustering Algorithms

Authors: Liang Huang; Xueqin Yu; Xiaoqing Zuo
Journal: International Journal of Aerospace Engineering
 (2017)

---

## Abstract

Due to the unmanned aerial vehicle remote sensing images (UAVRSI) within rich texture details of ground objects and obvious phenomenon, the same objects with different spectra, it is difficult to effectively acquire the edge information using traditional edge detection operator. To solve this problem, an edge detection method of UAVRSI by combining Zernike moments with clustering algorithms is proposed in this study. To begin with, two typical clustering algorithms, namely, fuzzyc-means (FCM) and K-means algorithms, are used to cluster the original remote sensing images so as to form homogeneous regions in ground objects. Then, Zernike moments are applied to carry out edge detection on the remote sensing images clustered. Finally, visual comparison and sensitivity methods are adopted to evaluate the accuracy of the edge information detected. Afterwards, two groups of experimental data are selected to verify the proposed method. Results show that the proposed method effectively improves the accuracy of edge information extracted from remote sensing images.


---

## Body

## 1. Introduction

Edges, an important geometrical feature of remote sensing images, can be used in various processing concerns of remote sensing images, such as registration [1], segmentation [2], classification [3], change detection [4], and fusion [5]. Edge detection is an essential technology for obtaining the edges of remote sensing images. Therefore, it has gradually become the basis for processing remote sensing images [6].At present, many researches have been carried out to explore the edge detection in remote sensing images. The existing edge detection methods for remote sensing images can be divided into three classes.(
1
) Edge detection is based on traditional edge detection operators. Traditional edge detection operators include Canny operator, Sobel operator, Susan operator, LOG operator, Laplace operator, and Prewitt operator. These are employed to perform edge detection of remote sensing images. For instance, Vishwakarma and Katiyar (2011) conducted a comparative analysis into the detected edges of remote sensing images, respectively, using Canny operator, Sobel operator, and Prewitt operator [7]. (
2
) Edge detection is based on specific mathematics theories. These methods are applied to perform edge detection in remote sensing images using mathematics theories, such as wavelet transform, mathematical morphology, neural network, fuzzy theory, genetic algorithm, and entropy theory. For example, Kaur and Garg (2011) carried out the edge detection of remote sensing images using mathematical morphology [8]; X. Guan and Z. Guan (2001) extracted different kinds of the edge information from remote sensing images through wavelet transform [9]; Xu et al. (2008) presented a method for detecting the edges of remote sensing images using a cellular neural network (CNN) [10]; Jubai et al. (2006) realized edge detection of remote sensing images by combining fuzzy theory with genetic algorithm [11]; Kiani and Sahebi (2015) performed edge detection of remote sensing images using Shannon entropy [6].   (
3
) Edge detection is based on integration methods. In order to make full use of the advantages of different algorithms, these methods are used to carry out edge detection by integrating multiple algorithms. For instance, Xi and Zhang (2012) extracted the edge information of remote sensing images using Canny operator through Hough Transform [12]; Huang et al. (2015) put forward an edge detection method of remote sensing images by combining pulse coupled neural networks (PCNN) and LOG operator [13]; Huang et al. (2013) proposed an edge detection method of remote sensing images by combining 2D-OTSU with Canny operator [14]. However, UAVRSI are characterized by abundant texture details, big data, and obvious phenomenon, the same object with different spectra, so their edges are difficult to be detected. Owing to noises interference and texture details in ground objects, detecting the edges of UAVRSI by the first class and the second class methods can result in a large number of pseudoedges and unreasonable profiles. In order to solve the following problems, such as lots of mixed noise, complex texture details of ground objects and long computation time, the filtering algorithms, clustering algorithms, region segmentation algorithms, and intelligent optimization algorithms can be used in edge detection of UAVRSI. Then, edge information can be detected by integrating these algorithms into the edge detection operators, and the accuracy and efficiency of the detected result can be effectively improved. Therefore, the edge detection methods integrated multiple algorithms which have become the main idea for studying the edge detection of UAVRSI.To reduce the influence of the texture details in ground objects on the edge detection of UAVRSI, a spatial clustering algorithm is used to achieve the homogenous regions by clustering the remote sensing images. On this basis, Zernike moments are used to perform edge detection in clustered remote sensing images.The rest of the study is organized as follows: Section2 briefly introduces two kinds of clustering algorithms: fuzzy c-means (FCM) and K-means, while the proposed edge detection method is described in Section 3; Section 4 depicts data sets; Section 5 analyzes the experimental results; conclusions and discussion are presented in Section 6.


## 2. Clustering Algorithms

Clustering refers to segmenting a data set into different categories according to a specific criterion (e.g., distance criterion) so as to maximize the similarity of the data objects of same category and difference among the data objects of different categories. In this research, two extensively applied clustering algorithms, namely, FCM andK-means, are mainly adopted.


### 2.1. FCM Clustering

FCM clustering is an algorithm to determine the category of each data point based on membership degree. Suppose that there is a data setX
=
{
x
1
,
x
2
,
…
,
x
n
}, its fuzzy c division can be represented by a fuzzy matrix U
=
[
u
i
j
]. The element u
i
j in the matrix U donates the membership degree of the j
t
h
(
j
=
1,2
,
…
,
n
) data point that belongs to the i
t
h category (
i
=
1,2
,
…
,
c
). u
i
j satisfies the following condition:(1)
∑
i
=
1
c
u
i
j
=
1
,
∀
j
,
∑
j
=
1
n
u
i
j
>
0
,
∀
i
,
j
u
i
j
∈
0,1
,
∀
i
.In this research, the clustering is performed by the minimum of the quadratic sum of weighted errors in a category [15]; that is,(2)
m
i
n
J
m
U
,
V
=
∑
j
=
1
n
∑
i
=
1
c
u
i
j
m
d
i
j
2
x
j
,
v
i
,whereVis the clustering center; m indicates the weighted index number, while d
i
j
(
x
j
,
v
i
)
=
v
i
-
x
j.


### 2.2.K-Means Clustering

K-means is one of the typical clustering methods used in image division. Since this algorithm shows a high computational efficiency, it has been widely applied in image segmentation and classification.By usingkas the parameter, K-means algorithm divides n objects into k categories so as to make objects in the same category show a high similarity while those in different categories present a small similarity. The specific process for carrying out the K-means algorithm is shown as follows: to begin with, k objects are selected randomly to initially denote the average value or center of a category; for the rest objects, they are classified into the closest category according to their distance to the centers of various categories; then, the average value of each category is calculated again. This process is repeated constantly until the criterion function converges. In general, square errors are used as the criterions, as defined as follows [16]:(3)
E
=
∑
i
=
1
k
∑
p
∈
C
i
p
-
m
i
2
,where E denotes the sum of the square errors of all objects in the data set; p represents a point in the space, while m
i is the average value of the category C
i. This objective function is used to make the generated categories compact and independent as much as possible with Euclidean distance. Of course, other distance measures can also be employed [16].


## 2.1. FCM Clustering

FCM clustering is an algorithm to determine the category of each data point based on membership degree. Suppose that there is a data setX
=
{
x
1
,
x
2
,
…
,
x
n
}, its fuzzy c division can be represented by a fuzzy matrix U
=
[
u
i
j
]. The element u
i
j in the matrix U donates the membership degree of the j
t
h
(
j
=
1,2
,
…
,
n
) data point that belongs to the i
t
h category (
i
=
1,2
,
…
,
c
). u
i
j satisfies the following condition:(1)
∑
i
=
1
c
u
i
j
=
1
,
∀
j
,
∑
j
=
1
n
u
i
j
>
0
,
∀
i
,
j
u
i
j
∈
0,1
,
∀
i
.In this research, the clustering is performed by the minimum of the quadratic sum of weighted errors in a category [15]; that is,(2)
m
i
n
J
m
U
,
V
=
∑
j
=
1
n
∑
i
=
1
c
u
i
j
m
d
i
j
2
x
j
,
v
i
,whereVis the clustering center; m indicates the weighted index number, while d
i
j
(
x
j
,
v
i
)
=
v
i
-
x
j.


## 2.2.K-Means Clustering

K-means is one of the typical clustering methods used in image division. Since this algorithm shows a high computational efficiency, it has been widely applied in image segmentation and classification.By usingkas the parameter, K-means algorithm divides n objects into k categories so as to make objects in the same category show a high similarity while those in different categories present a small similarity. The specific process for carrying out the K-means algorithm is shown as follows: to begin with, k objects are selected randomly to initially denote the average value or center of a category; for the rest objects, they are classified into the closest category according to their distance to the centers of various categories; then, the average value of each category is calculated again. This process is repeated constantly until the criterion function converges. In general, square errors are used as the criterions, as defined as follows [16]:(3)
E
=
∑
i
=
1
k
∑
p
∈
C
i
p
-
m
i
2
,where E denotes the sum of the square errors of all objects in the data set; p represents a point in the space, while m
i is the average value of the category C
i. This objective function is used to make the generated categories compact and independent as much as possible with Euclidean distance. Of course, other distance measures can also be employed [16].


## 3. The Proposed Edge Detection Method

### 3.1. Idea of the Proposed Method

Because of a large number of internal texture details and lots of mixed noise in UAVRSI, many traditional edge detection operators are sensitive to noise, such as Robert operator, Prewitt operator, and Laplacian operator; these result in low detection accuracy of UAVRSI. However, in practical application, the edges of UAVRSI are required to reach the subpixel level. The Zernike moments are obtained by integral operation, and it is insensitive to noise, so noise has little impact on the edges detected by Zernike moments in UAVRSI. At the same time, the location of edge detected by Zernike moments can reach subpixel, and it can overcome the limitation of physical resolution; thus it decreases the calculation cost for reaching the required accuracy [17, 18]. In view of this, the research of subpixel edge detection method based on Zernike moments for UAVRSI has important practical significance. However, with the continuous improvement of the spatial resolution of UAVRSI, the spectral difference of a ground object becomes greater that leads to a large number of pseudocontours edges detected in a ground object [14]. The edge detection method based on Zernike moments uses subpixel edge location; in this method, if the spectral heterogeneity in the same ground objects is enhanced, the more nonground object contour edges will be detected. These will have great impact on information extraction and change detection in UAVRSI. In order to solve the problem, a specific algorithm is used to obtain homogeneous regions and heterogeneity minimum in the same ground object. So the edge detection error by the internal texture details of the ground object can reduce and the accuracy of edge detection can improve. Clustering algorithm is an effective method to obtain homogeneous regions. Therefore, FCM and K-means clustering algorithm are used to the original UAVRSI clustering in this paper; the certain homogeneous regions in the same ground object are obtained after clustering processing; and then the edge detection method based on Zernike moments is used to detect the edge information for UAVRSI. The specific operation is shown in Figure 1.Figure 1
Flowchart of proposed method.


### 3.2. Principles of Edge Detection Based on Zernike Moments

Edge detection based on Zernike moments was proposed by Ghosal and Mehrotra in 1993 [19]. This operator is performed by adopting an ideal step edge model, as illustrated in Figure 2 [19]. To realize the edge detection based on Zernike moments, four parameters of the pixel point in remote sensing images obtained using unmanned aerial vehicle are required. They include background gray h, target gray k
+
h (where k means gray level difference), the angle φ between the normal of edges, and the coordinate axisx and the distance l from the pixel center to the edge [19].Figure 2
Step model for ideal edge.For the high spatial resolution UAVRSIf
(
x
,
y
), its Zernike moments of order n with repetition m are defined as follows [18–20]:(4)
M
n
m
=
n
+
1
π
∬
x
2
+
y
2
≤
1
V
n
m
∗
ρ
,
θ
f
x
,
y
d
x
d
y
, where n
+
1
/
π is the regularization factor; ρ shows the length of the vector from the origin to the pixel (
x
,
y
); θ denotes the angle between the vector ρ and the direction of the coordinate x; ∗ stands for the complex conjugate, while V
n
m
(
ρ
,
θ
)
=
∑
k
=
0
(
n
-
m
)
/
2
(
-
1
)
k
(
n
-
k
)
!
ρ
n
-
2
k
/
k
!
n
+
m
/
2
-
k
!
n
-
m
/
2
-
k
!
e
j
^
m
θ and j
^
=
-
1, separately.After the edges are clockwise rotated at an angle ofφ
z, the Zernike moments before and after the rotation show the following relationship: (5)
M
n
m
′
=
M
n
m
e
-
j
^
m
φ
z
.If the edges are rotated at an angle of-
φ, the edges is parallel to the y axis; thus (6)
∬
x
2
+
y
2
≤
1
f
′
x
,
y
y
d
x
d
y
=
0
,where f
′
(
x
,
y
) is the edge function acquired after the UAVRSI is rotated.When using Zernike moments to carry out edge detection in UAVRSI, it generally needs to use three Zernike moments of different orders with different repetitions, namely,M
00, M
11, and M
20. Their corresponding integral kernel functions are V
00
=
1, V
11
=
x
+
j
y, and V
20
=
2
x
2
+
2
y
2
-
1, respectively. Based on formulas (4) and (5), the corresponding relationship between the Zernike moments of UAVRSI before and after the rotation is written as(7)
M
00
′
=
M
00
,
M
11
′
=
M
11
e
j
φ
,
M
20
′
=
M
20
.According to formula (5), the imaginary part in the Zernike moments of the order one for one time in the rotated UAVRSI equals zero: when the edge is parallel to the y-axis, the imaginary part is equal to zero. We obtain(8)
I
m
M
11
′
=
sin
⁡
φ
R
e
M
11
-
cos
⁡
φ
I
m
M
11
=
0
,where I
m
[
M
11
′
] is the imaginary part of the rotated UAVRSI; I
m
[
M
11
] and R
e
[
M
11
] represent the imaginary part and the real part of the original UAVRSI, separately.According to formula (8), we obtain(9)
φ
=
t
a
n
-
1
I
m
M
11
R
e
M
11
.Based on Figure2, the following formulas can be acquired(10)
M
00
′
=
h
π
+
k
π
2
-
k
s
i
n
-
1
l
-
k
l
1
-
l
2
,
M
11
′
=
2
k
1
-
l
2
3
/
2
3
,
M
20
′
=
2
k
l
1
-
l
2
3
/
2
3
.On this basis, another three parameters are acquired(11)
l
=
M
20
M
11
′
,
k
=
3
M
11
′
2
1
-
l
2
3
/
2
,
h
=
M
00
-
k
π
/
2
+
k
s
i
n
-
1
l
+
k
l
2
1
-
l
2
π
.After four parameters are determined, the formula for subpixel edge detection can be deduced from Figure2:(12)
x
k
y
k
=
x
y
+
l
cos
⁡
φ
sin
⁡
φ
,where (
x
k
,
y
k
) is the subpixel coordinate of the edge of the UAVRSI, while (
x
,
y
) denotes the coordinate of the origin in Figure 2.


## 3.1. Idea of the Proposed Method

Because of a large number of internal texture details and lots of mixed noise in UAVRSI, many traditional edge detection operators are sensitive to noise, such as Robert operator, Prewitt operator, and Laplacian operator; these result in low detection accuracy of UAVRSI. However, in practical application, the edges of UAVRSI are required to reach the subpixel level. The Zernike moments are obtained by integral operation, and it is insensitive to noise, so noise has little impact on the edges detected by Zernike moments in UAVRSI. At the same time, the location of edge detected by Zernike moments can reach subpixel, and it can overcome the limitation of physical resolution; thus it decreases the calculation cost for reaching the required accuracy [17, 18]. In view of this, the research of subpixel edge detection method based on Zernike moments for UAVRSI has important practical significance. However, with the continuous improvement of the spatial resolution of UAVRSI, the spectral difference of a ground object becomes greater that leads to a large number of pseudocontours edges detected in a ground object [14]. The edge detection method based on Zernike moments uses subpixel edge location; in this method, if the spectral heterogeneity in the same ground objects is enhanced, the more nonground object contour edges will be detected. These will have great impact on information extraction and change detection in UAVRSI. In order to solve the problem, a specific algorithm is used to obtain homogeneous regions and heterogeneity minimum in the same ground object. So the edge detection error by the internal texture details of the ground object can reduce and the accuracy of edge detection can improve. Clustering algorithm is an effective method to obtain homogeneous regions. Therefore, FCM and K-means clustering algorithm are used to the original UAVRSI clustering in this paper; the certain homogeneous regions in the same ground object are obtained after clustering processing; and then the edge detection method based on Zernike moments is used to detect the edge information for UAVRSI. The specific operation is shown in Figure 1.Figure 1
Flowchart of proposed method.


## 3.2. Principles of Edge Detection Based on Zernike Moments

Edge detection based on Zernike moments was proposed by Ghosal and Mehrotra in 1993 [19]. This operator is performed by adopting an ideal step edge model, as illustrated in Figure 2 [19]. To realize the edge detection based on Zernike moments, four parameters of the pixel point in remote sensing images obtained using unmanned aerial vehicle are required. They include background gray h, target gray k
+
h (where k means gray level difference), the angle φ between the normal of edges, and the coordinate axisx and the distance l from the pixel center to the edge [19].Figure 2
Step model for ideal edge.For the high spatial resolution UAVRSIf
(
x
,
y
), its Zernike moments of order n with repetition m are defined as follows [18–20]:(4)
M
n
m
=
n
+
1
π
∬
x
2
+
y
2
≤
1
V
n
m
∗
ρ
,
θ
f
x
,
y
d
x
d
y
, where n
+
1
/
π is the regularization factor; ρ shows the length of the vector from the origin to the pixel (
x
,
y
); θ denotes the angle between the vector ρ and the direction of the coordinate x; ∗ stands for the complex conjugate, while V
n
m
(
ρ
,
θ
)
=
∑
k
=
0
(
n
-
m
)
/
2
(
-
1
)
k
(
n
-
k
)
!
ρ
n
-
2
k
/
k
!
n
+
m
/
2
-
k
!
n
-
m
/
2
-
k
!
e
j
^
m
θ and j
^
=
-
1, separately.After the edges are clockwise rotated at an angle ofφ
z, the Zernike moments before and after the rotation show the following relationship: (5)
M
n
m
′
=
M
n
m
e
-
j
^
m
φ
z
.If the edges are rotated at an angle of-
φ, the edges is parallel to the y axis; thus (6)
∬
x
2
+
y
2
≤
1
f
′
x
,
y
y
d
x
d
y
=
0
,where f
′
(
x
,
y
) is the edge function acquired after the UAVRSI is rotated.When using Zernike moments to carry out edge detection in UAVRSI, it generally needs to use three Zernike moments of different orders with different repetitions, namely,M
00, M
11, and M
20. Their corresponding integral kernel functions are V
00
=
1, V
11
=
x
+
j
y, and V
20
=
2
x
2
+
2
y
2
-
1, respectively. Based on formulas (4) and (5), the corresponding relationship between the Zernike moments of UAVRSI before and after the rotation is written as(7)
M
00
′
=
M
00
,
M
11
′
=
M
11
e
j
φ
,
M
20
′
=
M
20
.According to formula (5), the imaginary part in the Zernike moments of the order one for one time in the rotated UAVRSI equals zero: when the edge is parallel to the y-axis, the imaginary part is equal to zero. We obtain(8)
I
m
M
11
′
=
sin
⁡
φ
R
e
M
11
-
cos
⁡
φ
I
m
M
11
=
0
,where I
m
[
M
11
′
] is the imaginary part of the rotated UAVRSI; I
m
[
M
11
] and R
e
[
M
11
] represent the imaginary part and the real part of the original UAVRSI, separately.According to formula (8), we obtain(9)
φ
=
t
a
n
-
1
I
m
M
11
R
e
M
11
.Based on Figure2, the following formulas can be acquired(10)
M
00
′
=
h
π
+
k
π
2
-
k
s
i
n
-
1
l
-
k
l
1
-
l
2
,
M
11
′
=
2
k
1
-
l
2
3
/
2
3
,
M
20
′
=
2
k
l
1
-
l
2
3
/
2
3
.On this basis, another three parameters are acquired(11)
l
=
M
20
M
11
′
,
k
=
3
M
11
′
2
1
-
l
2
3
/
2
,
h
=
M
00
-
k
π
/
2
+
k
s
i
n
-
1
l
+
k
l
2
1
-
l
2
π
.After four parameters are determined, the formula for subpixel edge detection can be deduced from Figure2:(12)
x
k
y
k
=
x
y
+
l
cos
⁡
φ
sin
⁡
φ
,where (
x
k
,
y
k
) is the subpixel coordinate of the edge of the UAVRSI, while (
x
,
y
) denotes the coordinate of the origin in Figure 2.


## 4. Description of the Data Sets

To validate the effectiveness of the proposed method, two UAVRSI are selected as the experimental data sets. These two images are obtained in Anning of Yunnan province, China. The spatial resolution of these images is 0.1 m; these images show three wavebands, namely, red, green, and blue. The size of Data 1 is 1299 × 1066 pixels; data set 1 mainly covers buildings, woodland, bare land, roadway, and farmland, as demonstrated in Figure3(a), while data set 2 primarily contains buildings, huts, farmland, and vegetation, as shown in Figure 3(b), and the size of Data 2 is 1415 × 1173 pixels.Figure 3
Image of Anning area.
(a)
Data 1
(b)
Data 2


## 5. Experiments and Results

To verify the feasibility and effectiveness of the method, two groups of contrast experiments are performed. The first group is used to compare and analyze the results obtained using Zernike moments and the proposed method separately, while the results, respectively, acquired using Canny operator and the proposed method are analyzed in the second group. In order to evaluate the experimental results, visual comparison and sensitivity [21] are adopted to simultaneously validate the accuracy of the proposed method.In the experiment 1, Zernike moments and the proposed method are, respectively, applied to carry out edge detection on the two groups of data presented in Figure3, while Canny operator and the proposed method are adopted to detect the edges of the two groups of data shown in Figure 3, separately. Figures 4(a), 4(b), and 4(c) display the results, respectively, obtained by Zernike moments, Zernike moments combined with K-means clustering, and Zernike moments combined with FCM clustering (these results are from data set 1), while the results acquired using Zernike moments, Zernike moments combined with K-means clustering, and Zernike moments combined with FCM clustering from data set 2 are illustrated in Figures 5(a), 5(b), and 5(c). In addition, Figures 6(a) and 7(a), respectively, demonstrate the results using Canny operator from data sets 1 and 2.Figure 4
The results of first experiment for Data 1.
(a)
Zernike moments combined
(b)
Zernike moments combined withK-means clustering
(c)
Zernike moments with FCM clusteringFigure 5
The results of first experiment for Data 2.
(a)
Zernike moments combined
(b)
Zernike moments combined withK-means clustering
(c)
Zernike moments with FCM clusteringFigure 6
The results of second experiment for Data 1.
(a)
Canny operator
(b)
Zernike moments combined withK-means clustering
(c)
Zernike moments combined with FCM clusteringFigure 7
The results of second experiment for Data 2.
(a)
Canny operator
(b)
Zernike moments combined withK-means clustering
(c)
Zernike moments combined with FCM clusteringIt can be found from Figures4 and 5 that most information in UAVRSI is detected as edge points using Zernike moments; these cause the failure of recognizing the contour edges of ground objects. In contrast, the results obtained using the Zernike moments combined with K-means clustering and Zernike moments combined with FCM clustering are obviously superior to those obtained merely using Zernike moments. These indicate that the proposed method can well detect ground objects with apparent shape features, while it shows poor performance in detecting vegetation, woodland, and farmland. Meanwhile, by comparing the parts circled in red in the right of Figures 5(b) and 5(c), it is known that the method combining Zernike moments with K-means clustering shows some missed edges in comparison with the Zernike moments combined with FCM clustering. This is because a large quantity of details is lost in the clustering using K-means, so many edge details are lost in edge detection. Therefore, the proposed method presents a high requirement for the clustering results: the clustering results directly influence the accuracy of the results obtained in edge detection. Table 1 also indicates that the results acquired using Zernike moments show a largest sensitivity, indicating that most edge points are detected using this method. Meanwhile, Figure 4(a) shows that largest amounts of pseudoedges are detected. Based on the sensitivity of the method integrating Zernike moments with K-means clustering and Figure 4(b), this method fails to detect a large number of edges with the lowest sensitivity. According to the sensitivity and Figure 4, the method combining Zernike moments with FCM clustering shows superior to others.Table 1
Results of sensitivity.
Methods
Zernike
Zernike +K-means
Zernike + FCM
Canny
Data 1
0.041648
0.023812
0.037703
0.135656
Data 2
0.030556
0.030104
0.035075
0.091604It can be found from Figure7 that using Canny operator can detect a large number of pseudocontour edges, which can be effectively solved by the proposed method. However, for the images in which most ground objects show fuzzy shape features, the proposed method presents little advantage in comparison with the Canny operator. This is because Canny operator is not a method for subpixel edge detection; it is more sensitive than Zernike moments and the proposed method.


## 6. Conclusion and Discussion

To improve the accuracy of edge detection in UAVRSI, subpixel edge location algorithm is introduced into the edge detection of UAVRSI. On this basis, the edge detection of UAVRSI by combining Zernike moments and clustering algorithms is realized in this paper. Compared with the edge detection based on Zernike moments, the proposed method which is proved can significantly improve the accuracy of the detected results by comparing two groups of contrast experiments. Meanwhile, compared with Canny operator, the method in this research reduces the influence of the details of ground objects on the edge detection to some extent and the detected pseudoedges of ground objects are obviously less than those using Canny operator based edge detection.Because of complex surface features, great spectral differences between the ground objects and the noise, the edge detection of UAVRSI is difficult. In order to solve these problems, a specific algorithm needs to deal with UAVRSI to obtain homogeneous regions in the same ground object, and then a specific edge detection operator is used for edge detection. The clustering algorithm is an effective method to generate homogeneous regions. In this paper, two kinds of classical clustering algorithms, FCM andK-means, were selected, and the results were satisfactory. In addition to the clustering algorithm, threshold segmentation and region segmentation are effective ways to obtain homogeneous regions; the combination of the two methods and edge detection method based on Zernike moments needs to be further verified. However, the proposed method also has the following problems:(1)
The homogeneous regions are obtained by clustering algorithm, but part of edge information is lost in this process. Thus the accuracy of edge detection is reduced.
(2)
In this paper, the traditional clustering methods are used to obtained homogeneous regions. It is difficult to select the cluster center using traditional clustering methods, and the different cluster centers will generate different results; this results in the uncertainty of the results. In order to realize the intelligent selection of cluster centers, clustering method combined with intelligent optimization algorithm is a good choice.
(3)
The proposed method is more effective for edge information extraction of the building (structure) and the road. However, it is not good enough for the edge detection of vegetation, trees, crops, and other objects, so this needs further study.



---

*Source: 1793212-2017-02-15.xml*