# Automatic Classification of Remote Sensing Images Using Multiple Classifier Systems

Authors: Bin Yang; Chunxiang Cao; Ying Xing; Xiaowen Li
Journal: Mathematical Problems in Engineering
 (2015)

---

## Abstract

It is a challenge to obtain accurate result in remote sensing images classification, which is affected by many factors. In this paper, aiming at correctly identifying land use types reflec ted in remote sensing images, support vector machine, maximum likelihood classifier, backpropagation neural network, fuzzy c-means, and minimum distance classifier were combined to construct three multiple classifier systems (MCSs). Two MCSs were implemented, namely, comparative major voting (CMV) and Bayesian average (BA). One method called WA-AHP was proposed, which introduced analytic hierarchy process into MCS. Classification results of base classifiers and MCSs were compared with the ground truth map. Accuracy indicators were computed and receiver operating characteristic curves were illustrated, so as to evaluate the performance of MCSs. Experimental results show that employing MCSs can increase classification accuracy significantly, compared with base classifiers. From the accuracy evaluation result and visual check, the best MCS is WA-AHP with overall accuracy of 94.2%, which overmatches BA and rivals CMV in this paper. The producer’s accuracy of each land use type proves the good performance of WA-AHP. Therefore, we can draw the conclusion that MCS is superior to base classifiers in remote sensing image classification, and WA-AHP is an efficient MCS.


---

## Body

## 1. Introduction

With the development of remote sensing technology, it has been widely applied in many different fields such as land use land cover (LULC) monitoring, investigation of forest resources, disaster monitoring, and urban planning [1, 2], where the identification of land use types by image classification technology plays a very important role. There are a large number of land use types with irregular distribution on the surface of earth. Remote sensing images reflect the complicated information of the earth’s surface, so it is a challenge to make accurate classification of remote sensing images.Many artificial intelligence (AI) methods have been utilized in remote sensing images classification including neural networks [3–5], support vector machine (SVM) [6–8], and maximum likelihood classifier (MLC) [9, 10]. Although the results of these classifiers are generally positive, they still have their own limitations. According to a large number of studies, there is no individual algorithm that performs perfectly in classification. Different classifiers have different accuracies for the same class, while the same classifier has different accuracies for different classes, due to the complementary advantages of different classifiers. As a result, multiple classifier systems (MCSs) naturally become a good choice. Combining strategies for multiple classifiers has been widely investigated, the aim of which is to determine an efficient combination method that makes full use of the complementary advantages of each classifier and tackles the drawbacks of individual classifiers, to improve the accuracy of classification. In the early period, MCS theory was developed in pattern recognition such as signal processing, handwriting recognition, face recognition, and fingerprint identification [11–14]. In recent years, MCS has been gradually introduced to remote sensing images processing [1, 7]. There are many methods combining multiple classifiers in previous work. According to the types of the output of the base classifiers, MCS methods can be grouped into three categories, namely, abstract level, ranked level, and measurement level. When it comes to remote sensing images classification, MCSs are usually implemented in abstract level and measurement level. Xu proposed standard methods of MCS that combined multiple classifiers in both levels in the pattern recognition field [11, 12]. Voting method and Bayesian average (BA) method are the classical methods in abstract level and measurement level, respectively.For the purpose of improving the accuracy of identifying LULC types, we applied some traditional AI methods in remote sensing images classification. Three MCS methods integrating support vector machine (SVM), maximum likelihood classifier (MLC), back propagation neural network (BPNN), fuzzy c-means (FCM), and minimum distance classifier (MDC) were implemented, one of which was proposed as a novel method called weighted average based on AHP (WA-AHP), making full use of the advantages of AHP and MCS. In this paper, we compared the voting method, BA, and WA-AHP. Confusion matrix and several indicators were computed to evaluate classification accuracy. Meanwhile, we illustrated the receiver operating characteristic (ROC) curve, from which area under curve (AUC) was derived, so as to evaluate the performance of the classifiers including base classifiers and MCSs. Finally, we discussed the application of MCSs in remote sensing images classification.


## 2. Data Sets

We chose a plot of the SPOT-5 satellite image in Liaoyang city of China as shown in Figure1(a). According to visual interpretation and field measured data, we made the ground truth map as shown in Figure 1(b). In this region covered by the remote sensing images, there were four main types of land use, namely, vegetable field, settlement place, farm land 1, and farm land 2. Meanwhile, as shown in Figure 2, we analyzed the spectral character of each type. The coordinate axes represent the bands of the SPOT-5 image. It can be seen that the four types have different spectral characters.Figure 1
The studied area: (a) remote sensing image of SPOT-5; (b) ground truth map.
(a)
(b)Figure 2
Location of the data for each class in feature space.


## 3. Methodology

We aimed at improving the classification accuracy for remote sensing images by combining multiple classifiers. As shown in Figure3, the framework consists of three major steps. Firstly, five base classifiers were selected and implemented, respectively. Secondly, based on the output of the five base classifiers, the classification results by comparative major voting (CMV), Bayesian average, and WA-AHP were obtained, respectively. Finally, the performance of all classification methods was evaluated including base classifiers and MCSs.Figure 3
Framework of remote sensing images classification using MCS.


### 3.1. Base Classifiers

#### 3.1.1. Support Vector Machine

SVM is a machine learning method which uses a certain distance between samples as the criterion of classification, based on the principle of structural risk minimization. This method has been found to be efficient for pattern recognition and recently for satellite image classification [7, 8, 15]. In SVM classification, the selection of the kernel function is an important step, and Gaussian radial basis function was selected in this paper.


#### 3.1.2. Maximum Likelihood Classifier

MLC is a well-known method for determining a class based on Bayesian formula [9, 10]. In theory, there is an assumption in MLC of the training samples with normal distribution. During the process of classification, MLC builds the probability density functions for each class. All unclassified pixels are assigned membership based on the relative likelihood (probability) of that pixel occurring within each class. The probability is calculated as follows. First, it is supposed that there are G predefined classes. Then, according to Bayesian formula, the posterior probability of X is labeled to class k, and P
(
G
k
/
X
) is defined by the following equation:(1)
P
G
k
X
=
P
X
/
G
k
P
(
G
k
)
P
X
,where P
(
G
k
) is the prior probability of class k, P
(
X
/
G
k
) is the conditional probability of X from G
k, and P
(
X
) is the probability of X and is the same for each class. When the statistical probability of the given pixel is calculated, pixel X will be assigned to the class with the highest probability.


#### 3.1.3. Back Propagation Neural Network

BPNN is widely used in pattern classification. BPNN with three layers of structure can solve arbitrary classification problem in theory. The three layers include input layer, hidden layer, and output layer [4, 5]. A simple sketch map of BPNN is shown in Figure 4.Figure 4
The structure of BPNN.BPNN needs some input sample sets and the known correct outputs of each case to learn. The learning process of BPNN consists of forward propagation and back propagation. In the process of forward propagation, information input from the input layer is propagated through the hidden layer to the output layer. The state of neurons in one layer affects the state of neurons only in the next layer. BPNN defines an object error function using mean squared error (MSE) as shown in (2), where Y
i is the actual output and Y
i
- is the predicted output. If there is a difference between Y
i and Y
-, then the neural network turns to the process of error back propagation. The error value is then propagated backwards through the network, and small changes are made to the weights of the neurons in each layer. The whole process is repeated until the error value drops below a predetermined threshold; then the network has learned the problem well:(2)
M
S
E
=
1
N
∑
i
=
1
N
Y
i
-
Y
i
¯
2
.


#### 3.1.4. Fuzzy c-Means

FCM is a method of clustering which allows one piece of data to belong to two or more clusters. This method is frequently used in pattern recognition [16]. It is based on minimization of the objective function J
m in (3), where C is the number of cluster centers, N is the number of data, x
i is the feature vector for the unknown input, c
j is the center of cluster j, u
i
j is the degree of membership of x
i belonging to cluster j, and m is a real number greater than 1:(3)
J
m
=
∑
i
=
1
C
∑
j
=
1
N
u
i
j
m
x
i
-
c
j
2
,
1
≤
m
<
+
∞
.FCM is carried out by iterative optimization of the objective functionJ
m through the update of membership u
i
j and the cluster centers c
j in (4). This iteration will stop when m
a
x
i
j
{
|
u
i
j
k
+
1
-
u
i
j
k
|
}
<
ε, where ε is a termination threshold between 0 and 1, and k is the iteration step. Objective function J
m will converge to a local minimum when this procedure is finished:(4)
u
i
j
=
1
∑
k
=
1
N
x
i
-
c
j
/
x
i
-
c
k
2
/
(
m
-
1
)
,
c
j
=
∑
i
=
1
C
u
i
j
m
x
i
∑
i
=
1
C
u
i
j
m
.


#### 3.1.5. Minimum Distance Classifier

MDC is a method which classifies an unknown class according to the distance between the unknown class and the centers of clusters, as shown in (5), where x
i is the ith feature vector for the unknown input and c
j is the center of the cluster j. This method aims to assign the class with the minimum distance to the unknown class pixel:(5)
d
j
=
x
i
-
c
j
.


### 3.2. Multiple Classifier Systems

#### 3.2.1. Abstract Level MCS-Comparative Major Voting

The voting method derives from the hypothesis that the decision of a group is superior to that of the individuals. It includes majority voting rule and conservative voting rule. In the principle of majority voting, if one pixel is identified as the same class by most base classifiers, the pixel is labelled to this class. And for conservative voting rule, unless one pixel is identified as the same class by all the base classifiers, it is labeled to the class. Otherwise, it cannot be classified. The rule of class determination is shown in (6), where V
E denotes the voting value which is the number of classifiers with consistent classification results and M
+
1 means the unclassified class. When α is 0.5 and 1, it is the majority voting and conservative voting, respectively:(6)
E
(
X
)
=
j
,
w
h
e
n
V
E
X
∈
C
j
=
m
a
x
V
E
X
∈
C
i
,
V
E
(
X
∈
C
j
)
≥
α
×
K
M
+
1
,
o
t
h
e
r
w
i
s
e
.However, this voting strategy has a drawback that when different classes obtain the same voting value for one pixel, the pixel cannot be labeled, which may greatly affect the classification accuracy. So we proposed a new approach called CMV to combine the base classifiers. The general flowchart of CMV is given in Figure5. In this rule, two principles are followed: the decision of the majority is superior to that of the individual; and if several different classes get the same voting value for one pixel, the class of this pixel is determined by comparing the summations of probability of the concerned classes outputted by all the base classifiers. The pixels were labeled to the class with the highest summation.Figure 5
Flowchart of CMV strategy.


#### 3.2.2. Measurement Level MCS-Bayesian Average

Most classifiers can output posterior probability, which represents the probability that input pixelX belongs to class C
i, as shown in (7). Specifically, we supposed that there are M classes and K base classifiers which can output a vector P
e
(
X
), and P
e
(
X
)
=
[
P
e
(
1
)
,
…
,
P
e
(
M
)
]
T. Here, P
e
(
C
i
) denotes the posterior probability that pixel X belongs to C
i through classifier e. One approach called Bayesian average calculates the average value of posterior probabilities. The final classification criterion is shown in (8), which means that pixel X is labeled by the class of the largest posterior probability:(7)
P
E
X
∈
C
i
=
1
K
∑
k
=
1
K
P
k
X
∈
C
i
,
i
=
1
,
…
,
M
,
(8)
E
(
X
)
=
j
,
w
h
e
n
P
E
X
∈
C
j
=
max
⁡
(
P
E
(
X
∈
C
i
)
)
M
+
1
,
o
t
h
e
r
w
i
s
e
.Some base classifiers are not capable of outputting posterior probability, in which case we adopted (9), where d
k
(
C
i
∣
X
) denotes the distance between pixel X and the center of cluster C
i through the kth classifier:(9)
P
k
(
X
∈
C
i
)
=
1
/
d
k
C
i
∣
X
∑
i
=
1
K
1
/
d
k
C
i
∣
X
.


#### 3.2.3. Weighted Average Based on AHP

(1) Analytic Hierarchy Process. Analytic hierarchy process (AHP) [17, 18] is a structured and expert grading-based technique for organizing and analyzing complex decisions. AHP uses experience and knowledge to order the indicators in the criteria layer and constructs judgment matrix to calculate the weight of each indicator. It was developed by Thomas L. Saaty in the 1970s and has been extensively studied and refined since then. It has particular application in group decision making and weights determination. It is widely used in many fields such as government, business, industry, healthcare, and education, however, rarely in remote sensing image classification.(2) WA-AHP. BA is a simple method to calculate the average posterior probability. There is an obvious drawback with it that it does not consider the accuracy difference between all the base classifiers. So we take the advantages of both AHP and BA and integrate them into a novel method as shown by (10), where w
k determined by AHP is the weight of each classifier and K is the number of base classifiers:(10)
P
E
X
∈
C
i
=
1
K
∑
k
=
1
K
w
k
P
k
X
∈
C
i
,
i
=
1
,
…
,
M
.To be specific, after comparing the classification accuracy of base classifiers, we calculated the classifier weight of each base classifier through AHP. The higher the classification accuracy is, the larger weight the classification has. In this paper, we selected producer’s accuracy to measure the classification accuracy of each base classifier for each class. By consistency check, the consistency ratio (CR) is less than 0.10, meaning that the judgment matrix has a reasonable consistency. The final classification rule is like the one used by BA. PixelX will be classified into the class with the largest posterior probability in all the predetermined classes.


### 3.3. Postprocessing

#### 3.3.1. Smooth Processing

Because of the complexity of the earth surface, there are some isolated pixels inconsistent with neighboring pixels in the classification results. Meanwhile, there are also many noise spots in the results. So, in order to obtain better classification results, we used mean filtering to smooth the classification results [19].


#### 3.3.2. Evaluation of Classification Accuracy

The classification algorithms mentioned in this paper are compared using the following evaluation methods.(1) ROC Curve. ROC curve is widely used in data mining, for it is an intuitive method that visually utilizes curves to evaluate the performance of classifiers. However, it is suitable for classification of two classes, so it is rarely applied in the classification of remote sensing images. In this paper, we adopted the following strategies to introduce ROC curve into accuracy evaluation of remote sensing image classification. There are many classes in the remote sensing images, and we suppose that all of them are divided into two classes, namely, target class and nontarget class. Target class is the one to be evaluated, while the remaining classes are considered to be of nontarget class. Then the classification of multiple classes was converted to binary classification, and consequently ROC curve can be obtained. Usually, a higher AUC which represents the area under the ROC curve denotes a better performance [20].(2) Indicators Derived from Confusion Matrix. We used ground truth map and classification results to calculate confusion matrix, with which the classification accuracy is evaluated. Confusion matrix is denoted by C in the following parts. Each element C
i
j in the confusion matrix is the number of records pertaining to class i that have been automatically classified in the class j. So the diagonal elements correspond to the numbers of records that have been correctly classified. Indicators such as overall accuracy (P
c), kappa coefficient (Kappa), producer’s accuracy (P
A
j), and user’s accuracy (P
U
i) are derived from confusion matrix as shown by (11), where C
i
+ and C
+
i represent the sums of the elements in the ith row and the ith column and N is the number of samples. Kappa ranges from 0 to 1. Higher values of indicators indicate more accurate results. Thus,(11)
P
c
=
∑
k
=
1
r
C
k
k
N
,
K
a
p
p
a
=
N
×
∑
i
=
1
r
C
i
i
-
∑
i
=
1
r
C
i
+
C
+
i
N
2
-
∑
i
=
1
r
C
i
+
C
+
i
,
P
A
j
=
C
j
j
C
j
+
,
P
U
i
=
C
i
i
C
i
+
.


## 3.1. Base Classifiers

### 3.1.1. Support Vector Machine

SVM is a machine learning method which uses a certain distance between samples as the criterion of classification, based on the principle of structural risk minimization. This method has been found to be efficient for pattern recognition and recently for satellite image classification [7, 8, 15]. In SVM classification, the selection of the kernel function is an important step, and Gaussian radial basis function was selected in this paper.


### 3.1.2. Maximum Likelihood Classifier

MLC is a well-known method for determining a class based on Bayesian formula [9, 10]. In theory, there is an assumption in MLC of the training samples with normal distribution. During the process of classification, MLC builds the probability density functions for each class. All unclassified pixels are assigned membership based on the relative likelihood (probability) of that pixel occurring within each class. The probability is calculated as follows. First, it is supposed that there are G predefined classes. Then, according to Bayesian formula, the posterior probability of X is labeled to class k, and P
(
G
k
/
X
) is defined by the following equation:(1)
P
G
k
X
=
P
X
/
G
k
P
(
G
k
)
P
X
,where P
(
G
k
) is the prior probability of class k, P
(
X
/
G
k
) is the conditional probability of X from G
k, and P
(
X
) is the probability of X and is the same for each class. When the statistical probability of the given pixel is calculated, pixel X will be assigned to the class with the highest probability.


### 3.1.3. Back Propagation Neural Network

BPNN is widely used in pattern classification. BPNN with three layers of structure can solve arbitrary classification problem in theory. The three layers include input layer, hidden layer, and output layer [4, 5]. A simple sketch map of BPNN is shown in Figure 4.Figure 4
The structure of BPNN.BPNN needs some input sample sets and the known correct outputs of each case to learn. The learning process of BPNN consists of forward propagation and back propagation. In the process of forward propagation, information input from the input layer is propagated through the hidden layer to the output layer. The state of neurons in one layer affects the state of neurons only in the next layer. BPNN defines an object error function using mean squared error (MSE) as shown in (2), where Y
i is the actual output and Y
i
- is the predicted output. If there is a difference between Y
i and Y
-, then the neural network turns to the process of error back propagation. The error value is then propagated backwards through the network, and small changes are made to the weights of the neurons in each layer. The whole process is repeated until the error value drops below a predetermined threshold; then the network has learned the problem well:(2)
M
S
E
=
1
N
∑
i
=
1
N
Y
i
-
Y
i
¯
2
.


### 3.1.4. Fuzzy c-Means

FCM is a method of clustering which allows one piece of data to belong to two or more clusters. This method is frequently used in pattern recognition [16]. It is based on minimization of the objective function J
m in (3), where C is the number of cluster centers, N is the number of data, x
i is the feature vector for the unknown input, c
j is the center of cluster j, u
i
j is the degree of membership of x
i belonging to cluster j, and m is a real number greater than 1:(3)
J
m
=
∑
i
=
1
C
∑
j
=
1
N
u
i
j
m
x
i
-
c
j
2
,
1
≤
m
<
+
∞
.FCM is carried out by iterative optimization of the objective functionJ
m through the update of membership u
i
j and the cluster centers c
j in (4). This iteration will stop when m
a
x
i
j
{
|
u
i
j
k
+
1
-
u
i
j
k
|
}
<
ε, where ε is a termination threshold between 0 and 1, and k is the iteration step. Objective function J
m will converge to a local minimum when this procedure is finished:(4)
u
i
j
=
1
∑
k
=
1
N
x
i
-
c
j
/
x
i
-
c
k
2
/
(
m
-
1
)
,
c
j
=
∑
i
=
1
C
u
i
j
m
x
i
∑
i
=
1
C
u
i
j
m
.


### 3.1.5. Minimum Distance Classifier

MDC is a method which classifies an unknown class according to the distance between the unknown class and the centers of clusters, as shown in (5), where x
i is the ith feature vector for the unknown input and c
j is the center of the cluster j. This method aims to assign the class with the minimum distance to the unknown class pixel:(5)
d
j
=
x
i
-
c
j
.


## 3.1.1. Support Vector Machine

SVM is a machine learning method which uses a certain distance between samples as the criterion of classification, based on the principle of structural risk minimization. This method has been found to be efficient for pattern recognition and recently for satellite image classification [7, 8, 15]. In SVM classification, the selection of the kernel function is an important step, and Gaussian radial basis function was selected in this paper.


## 3.1.2. Maximum Likelihood Classifier

MLC is a well-known method for determining a class based on Bayesian formula [9, 10]. In theory, there is an assumption in MLC of the training samples with normal distribution. During the process of classification, MLC builds the probability density functions for each class. All unclassified pixels are assigned membership based on the relative likelihood (probability) of that pixel occurring within each class. The probability is calculated as follows. First, it is supposed that there are G predefined classes. Then, according to Bayesian formula, the posterior probability of X is labeled to class k, and P
(
G
k
/
X
) is defined by the following equation:(1)
P
G
k
X
=
P
X
/
G
k
P
(
G
k
)
P
X
,where P
(
G
k
) is the prior probability of class k, P
(
X
/
G
k
) is the conditional probability of X from G
k, and P
(
X
) is the probability of X and is the same for each class. When the statistical probability of the given pixel is calculated, pixel X will be assigned to the class with the highest probability.


## 3.1.3. Back Propagation Neural Network

BPNN is widely used in pattern classification. BPNN with three layers of structure can solve arbitrary classification problem in theory. The three layers include input layer, hidden layer, and output layer [4, 5]. A simple sketch map of BPNN is shown in Figure 4.Figure 4
The structure of BPNN.BPNN needs some input sample sets and the known correct outputs of each case to learn. The learning process of BPNN consists of forward propagation and back propagation. In the process of forward propagation, information input from the input layer is propagated through the hidden layer to the output layer. The state of neurons in one layer affects the state of neurons only in the next layer. BPNN defines an object error function using mean squared error (MSE) as shown in (2), where Y
i is the actual output and Y
i
- is the predicted output. If there is a difference between Y
i and Y
-, then the neural network turns to the process of error back propagation. The error value is then propagated backwards through the network, and small changes are made to the weights of the neurons in each layer. The whole process is repeated until the error value drops below a predetermined threshold; then the network has learned the problem well:(2)
M
S
E
=
1
N
∑
i
=
1
N
Y
i
-
Y
i
¯
2
.


## 3.1.4. Fuzzy c-Means

FCM is a method of clustering which allows one piece of data to belong to two or more clusters. This method is frequently used in pattern recognition [16]. It is based on minimization of the objective function J
m in (3), where C is the number of cluster centers, N is the number of data, x
i is the feature vector for the unknown input, c
j is the center of cluster j, u
i
j is the degree of membership of x
i belonging to cluster j, and m is a real number greater than 1:(3)
J
m
=
∑
i
=
1
C
∑
j
=
1
N
u
i
j
m
x
i
-
c
j
2
,
1
≤
m
<
+
∞
.FCM is carried out by iterative optimization of the objective functionJ
m through the update of membership u
i
j and the cluster centers c
j in (4). This iteration will stop when m
a
x
i
j
{
|
u
i
j
k
+
1
-
u
i
j
k
|
}
<
ε, where ε is a termination threshold between 0 and 1, and k is the iteration step. Objective function J
m will converge to a local minimum when this procedure is finished:(4)
u
i
j
=
1
∑
k
=
1
N
x
i
-
c
j
/
x
i
-
c
k
2
/
(
m
-
1
)
,
c
j
=
∑
i
=
1
C
u
i
j
m
x
i
∑
i
=
1
C
u
i
j
m
.


## 3.1.5. Minimum Distance Classifier

MDC is a method which classifies an unknown class according to the distance between the unknown class and the centers of clusters, as shown in (5), where x
i is the ith feature vector for the unknown input and c
j is the center of the cluster j. This method aims to assign the class with the minimum distance to the unknown class pixel:(5)
d
j
=
x
i
-
c
j
.


## 3.2. Multiple Classifier Systems

### 3.2.1. Abstract Level MCS-Comparative Major Voting

The voting method derives from the hypothesis that the decision of a group is superior to that of the individuals. It includes majority voting rule and conservative voting rule. In the principle of majority voting, if one pixel is identified as the same class by most base classifiers, the pixel is labelled to this class. And for conservative voting rule, unless one pixel is identified as the same class by all the base classifiers, it is labeled to the class. Otherwise, it cannot be classified. The rule of class determination is shown in (6), where V
E denotes the voting value which is the number of classifiers with consistent classification results and M
+
1 means the unclassified class. When α is 0.5 and 1, it is the majority voting and conservative voting, respectively:(6)
E
(
X
)
=
j
,
w
h
e
n
V
E
X
∈
C
j
=
m
a
x
V
E
X
∈
C
i
,
V
E
(
X
∈
C
j
)
≥
α
×
K
M
+
1
,
o
t
h
e
r
w
i
s
e
.However, this voting strategy has a drawback that when different classes obtain the same voting value for one pixel, the pixel cannot be labeled, which may greatly affect the classification accuracy. So we proposed a new approach called CMV to combine the base classifiers. The general flowchart of CMV is given in Figure5. In this rule, two principles are followed: the decision of the majority is superior to that of the individual; and if several different classes get the same voting value for one pixel, the class of this pixel is determined by comparing the summations of probability of the concerned classes outputted by all the base classifiers. The pixels were labeled to the class with the highest summation.Figure 5
Flowchart of CMV strategy.


### 3.2.2. Measurement Level MCS-Bayesian Average

Most classifiers can output posterior probability, which represents the probability that input pixelX belongs to class C
i, as shown in (7). Specifically, we supposed that there are M classes and K base classifiers which can output a vector P
e
(
X
), and P
e
(
X
)
=
[
P
e
(
1
)
,
…
,
P
e
(
M
)
]
T. Here, P
e
(
C
i
) denotes the posterior probability that pixel X belongs to C
i through classifier e. One approach called Bayesian average calculates the average value of posterior probabilities. The final classification criterion is shown in (8), which means that pixel X is labeled by the class of the largest posterior probability:(7)
P
E
X
∈
C
i
=
1
K
∑
k
=
1
K
P
k
X
∈
C
i
,
i
=
1
,
…
,
M
,
(8)
E
(
X
)
=
j
,
w
h
e
n
P
E
X
∈
C
j
=
max
⁡
(
P
E
(
X
∈
C
i
)
)
M
+
1
,
o
t
h
e
r
w
i
s
e
.Some base classifiers are not capable of outputting posterior probability, in which case we adopted (9), where d
k
(
C
i
∣
X
) denotes the distance between pixel X and the center of cluster C
i through the kth classifier:(9)
P
k
(
X
∈
C
i
)
=
1
/
d
k
C
i
∣
X
∑
i
=
1
K
1
/
d
k
C
i
∣
X
.


### 3.2.3. Weighted Average Based on AHP

(1) Analytic Hierarchy Process. Analytic hierarchy process (AHP) [17, 18] is a structured and expert grading-based technique for organizing and analyzing complex decisions. AHP uses experience and knowledge to order the indicators in the criteria layer and constructs judgment matrix to calculate the weight of each indicator. It was developed by Thomas L. Saaty in the 1970s and has been extensively studied and refined since then. It has particular application in group decision making and weights determination. It is widely used in many fields such as government, business, industry, healthcare, and education, however, rarely in remote sensing image classification.(2) WA-AHP. BA is a simple method to calculate the average posterior probability. There is an obvious drawback with it that it does not consider the accuracy difference between all the base classifiers. So we take the advantages of both AHP and BA and integrate them into a novel method as shown by (10), where w
k determined by AHP is the weight of each classifier and K is the number of base classifiers:(10)
P
E
X
∈
C
i
=
1
K
∑
k
=
1
K
w
k
P
k
X
∈
C
i
,
i
=
1
,
…
,
M
.To be specific, after comparing the classification accuracy of base classifiers, we calculated the classifier weight of each base classifier through AHP. The higher the classification accuracy is, the larger weight the classification has. In this paper, we selected producer’s accuracy to measure the classification accuracy of each base classifier for each class. By consistency check, the consistency ratio (CR) is less than 0.10, meaning that the judgment matrix has a reasonable consistency. The final classification rule is like the one used by BA. PixelX will be classified into the class with the largest posterior probability in all the predetermined classes.


## 3.2.1. Abstract Level MCS-Comparative Major Voting

The voting method derives from the hypothesis that the decision of a group is superior to that of the individuals. It includes majority voting rule and conservative voting rule. In the principle of majority voting, if one pixel is identified as the same class by most base classifiers, the pixel is labelled to this class. And for conservative voting rule, unless one pixel is identified as the same class by all the base classifiers, it is labeled to the class. Otherwise, it cannot be classified. The rule of class determination is shown in (6), where V
E denotes the voting value which is the number of classifiers with consistent classification results and M
+
1 means the unclassified class. When α is 0.5 and 1, it is the majority voting and conservative voting, respectively:(6)
E
(
X
)
=
j
,
w
h
e
n
V
E
X
∈
C
j
=
m
a
x
V
E
X
∈
C
i
,
V
E
(
X
∈
C
j
)
≥
α
×
K
M
+
1
,
o
t
h
e
r
w
i
s
e
.However, this voting strategy has a drawback that when different classes obtain the same voting value for one pixel, the pixel cannot be labeled, which may greatly affect the classification accuracy. So we proposed a new approach called CMV to combine the base classifiers. The general flowchart of CMV is given in Figure5. In this rule, two principles are followed: the decision of the majority is superior to that of the individual; and if several different classes get the same voting value for one pixel, the class of this pixel is determined by comparing the summations of probability of the concerned classes outputted by all the base classifiers. The pixels were labeled to the class with the highest summation.Figure 5
Flowchart of CMV strategy.


## 3.2.2. Measurement Level MCS-Bayesian Average

Most classifiers can output posterior probability, which represents the probability that input pixelX belongs to class C
i, as shown in (7). Specifically, we supposed that there are M classes and K base classifiers which can output a vector P
e
(
X
), and P
e
(
X
)
=
[
P
e
(
1
)
,
…
,
P
e
(
M
)
]
T. Here, P
e
(
C
i
) denotes the posterior probability that pixel X belongs to C
i through classifier e. One approach called Bayesian average calculates the average value of posterior probabilities. The final classification criterion is shown in (8), which means that pixel X is labeled by the class of the largest posterior probability:(7)
P
E
X
∈
C
i
=
1
K
∑
k
=
1
K
P
k
X
∈
C
i
,
i
=
1
,
…
,
M
,
(8)
E
(
X
)
=
j
,
w
h
e
n
P
E
X
∈
C
j
=
max
⁡
(
P
E
(
X
∈
C
i
)
)
M
+
1
,
o
t
h
e
r
w
i
s
e
.Some base classifiers are not capable of outputting posterior probability, in which case we adopted (9), where d
k
(
C
i
∣
X
) denotes the distance between pixel X and the center of cluster C
i through the kth classifier:(9)
P
k
(
X
∈
C
i
)
=
1
/
d
k
C
i
∣
X
∑
i
=
1
K
1
/
d
k
C
i
∣
X
.


## 3.2.3. Weighted Average Based on AHP

(1) Analytic Hierarchy Process. Analytic hierarchy process (AHP) [17, 18] is a structured and expert grading-based technique for organizing and analyzing complex decisions. AHP uses experience and knowledge to order the indicators in the criteria layer and constructs judgment matrix to calculate the weight of each indicator. It was developed by Thomas L. Saaty in the 1970s and has been extensively studied and refined since then. It has particular application in group decision making and weights determination. It is widely used in many fields such as government, business, industry, healthcare, and education, however, rarely in remote sensing image classification.(2) WA-AHP. BA is a simple method to calculate the average posterior probability. There is an obvious drawback with it that it does not consider the accuracy difference between all the base classifiers. So we take the advantages of both AHP and BA and integrate them into a novel method as shown by (10), where w
k determined by AHP is the weight of each classifier and K is the number of base classifiers:(10)
P
E
X
∈
C
i
=
1
K
∑
k
=
1
K
w
k
P
k
X
∈
C
i
,
i
=
1
,
…
,
M
.To be specific, after comparing the classification accuracy of base classifiers, we calculated the classifier weight of each base classifier through AHP. The higher the classification accuracy is, the larger weight the classification has. In this paper, we selected producer’s accuracy to measure the classification accuracy of each base classifier for each class. By consistency check, the consistency ratio (CR) is less than 0.10, meaning that the judgment matrix has a reasonable consistency. The final classification rule is like the one used by BA. PixelX will be classified into the class with the largest posterior probability in all the predetermined classes.


## 3.3. Postprocessing

### 3.3.1. Smooth Processing

Because of the complexity of the earth surface, there are some isolated pixels inconsistent with neighboring pixels in the classification results. Meanwhile, there are also many noise spots in the results. So, in order to obtain better classification results, we used mean filtering to smooth the classification results [19].


### 3.3.2. Evaluation of Classification Accuracy

The classification algorithms mentioned in this paper are compared using the following evaluation methods.(1) ROC Curve. ROC curve is widely used in data mining, for it is an intuitive method that visually utilizes curves to evaluate the performance of classifiers. However, it is suitable for classification of two classes, so it is rarely applied in the classification of remote sensing images. In this paper, we adopted the following strategies to introduce ROC curve into accuracy evaluation of remote sensing image classification. There are many classes in the remote sensing images, and we suppose that all of them are divided into two classes, namely, target class and nontarget class. Target class is the one to be evaluated, while the remaining classes are considered to be of nontarget class. Then the classification of multiple classes was converted to binary classification, and consequently ROC curve can be obtained. Usually, a higher AUC which represents the area under the ROC curve denotes a better performance [20].(2) Indicators Derived from Confusion Matrix. We used ground truth map and classification results to calculate confusion matrix, with which the classification accuracy is evaluated. Confusion matrix is denoted by C in the following parts. Each element C
i
j in the confusion matrix is the number of records pertaining to class i that have been automatically classified in the class j. So the diagonal elements correspond to the numbers of records that have been correctly classified. Indicators such as overall accuracy (P
c), kappa coefficient (Kappa), producer’s accuracy (P
A
j), and user’s accuracy (P
U
i) are derived from confusion matrix as shown by (11), where C
i
+ and C
+
i represent the sums of the elements in the ith row and the ith column and N is the number of samples. Kappa ranges from 0 to 1. Higher values of indicators indicate more accurate results. Thus,(11)
P
c
=
∑
k
=
1
r
C
k
k
N
,
K
a
p
p
a
=
N
×
∑
i
=
1
r
C
i
i
-
∑
i
=
1
r
C
i
+
C
+
i
N
2
-
∑
i
=
1
r
C
i
+
C
+
i
,
P
A
j
=
C
j
j
C
j
+
,
P
U
i
=
C
i
i
C
i
+
.


## 3.3.1. Smooth Processing

Because of the complexity of the earth surface, there are some isolated pixels inconsistent with neighboring pixels in the classification results. Meanwhile, there are also many noise spots in the results. So, in order to obtain better classification results, we used mean filtering to smooth the classification results [19].


## 3.3.2. Evaluation of Classification Accuracy

The classification algorithms mentioned in this paper are compared using the following evaluation methods.(1) ROC Curve. ROC curve is widely used in data mining, for it is an intuitive method that visually utilizes curves to evaluate the performance of classifiers. However, it is suitable for classification of two classes, so it is rarely applied in the classification of remote sensing images. In this paper, we adopted the following strategies to introduce ROC curve into accuracy evaluation of remote sensing image classification. There are many classes in the remote sensing images, and we suppose that all of them are divided into two classes, namely, target class and nontarget class. Target class is the one to be evaluated, while the remaining classes are considered to be of nontarget class. Then the classification of multiple classes was converted to binary classification, and consequently ROC curve can be obtained. Usually, a higher AUC which represents the area under the ROC curve denotes a better performance [20].(2) Indicators Derived from Confusion Matrix. We used ground truth map and classification results to calculate confusion matrix, with which the classification accuracy is evaluated. Confusion matrix is denoted by C in the following parts. Each element C
i
j in the confusion matrix is the number of records pertaining to class i that have been automatically classified in the class j. So the diagonal elements correspond to the numbers of records that have been correctly classified. Indicators such as overall accuracy (P
c), kappa coefficient (Kappa), producer’s accuracy (P
A
j), and user’s accuracy (P
U
i) are derived from confusion matrix as shown by (11), where C
i
+ and C
+
i represent the sums of the elements in the ith row and the ith column and N is the number of samples. Kappa ranges from 0 to 1. Higher values of indicators indicate more accurate results. Thus,(11)
P
c
=
∑
k
=
1
r
C
k
k
N
,
K
a
p
p
a
=
N
×
∑
i
=
1
r
C
i
i
-
∑
i
=
1
r
C
i
+
C
+
i
N
2
-
∑
i
=
1
r
C
i
+
C
+
i
,
P
A
j
=
C
j
j
C
j
+
,
P
U
i
=
C
i
i
C
i
+
.


## 4. Experimental Results and Analysis

### 4.1. The Classification Results

We made classification of remote sensing images using SVM, MLC, BPNN, FCM, and MDC, respectively. The classification results of base classifiers were shown in Figure6.Figure 6
The classification results of base classifiers: (a) SVM; (b) MLC; (c) BPNN; (d) FCM; (e) MDC.
(a)
(b)
(c)
(d)
(e)We used CMV, BA, and WA-AHP to construct MCS to classify remote sensing images. When using WA-AHP, it is required to obtain the priorities of base classifiers by their classification accuracy. The producer’s accuracy of base classifiers was used to order the classifiers. Finally, the weight of each base classifier was obtained through AHP as shown in Table1. The classification results of the three MCSs were shown in Figure 7.Table 1
Weight of each base classifier in WA-AHP.
Class
SVM
MLC
BPNN
FCM
MDC
Vegetable field
0.3651
0.3651
0.1622
0.0796
0.0279
Settlement place
0.0702
0.1325
0.5057
0.0337
0.258
Farm land 1
0.4174
0.1602
0.0615
0.0975
0.2634
Farm land 2
0.0733
0.2467
0.1589
0.3828
0.1384Figure 7
The classification results of MCSs: (a) CMV; (b) BA; (c) WA-AHP.
(a)
(b)
(c)


### 4.2. Analysis of Classification Accuracy

We used ROC curve to evaluate the performance of all classifiers. Meanwhile, the confusion matrix is the base of calculating the accuracy evaluation indicators, so we constructed confusion matrix for each classifier including MCSs. More details are described as below.


#### 4.2.1. ROC Curve

ROC curves for each class of different classifiers were shown in Figure8, and Table 2 described the corresponding AUC. Although all the classifiers performed rather well, including base classifiers and MCSs, the performance of different classifiers varied for different land use types. To be specific, the best performances are SVM for vegetable field and farm land 1, BPNN for settlement place, and FCM for farm land 2, respectively. MCSs are superior to most base classifiers for different classes to a certain degree. We also found that AUC of WA-AHP is the largest for most classes except settlement place. As a result, the performance of WA-AHP rivals CMV and BA, proving its effectiveness in MCS.Table 2
AUC of each ROC curve.
Class
SVM
MLC
BPNN
FCM
MDC
CMV
BA
WA-AHP
Vegetable field
0.931
0.914
0.898
0.882
0.927
0.918
0.910
0.926
Settlement place
0.822
0.816
0.889
0.819
0.864
0.839
0.911
0.887
Farm land 1
0.949
0.902
0.869
0.943
0.911
0.920
0.923
0.955
Farm land 2
0.938
0.9327
0.925
0.950
0.925
0.939
0.936
0.956Figure 8
ROC curve for each class: (a) vegetable field; (b) settlement place; (c) farm land 1; (d) farm land 2.
(a)
(b)
(c)
(d)


#### 4.2.2. Overall Accuracy and Kappa Coefficient

By the equations described in Section3.3.2, we calculated the overall accuracy and kappa coefficient, as shown in Table 3, where BIC means the best individual classifier and SVM and MLC are two best base classifiers in this paper due to their better performance. MCS improved the classification accuracy significantly compared with base classifiers. The overall accuracy and kappa coefficient of WA-AHP were as good as those of CMV and are better than BA.Table 3
The comparison of overall accuracy and kappa coefficient.
SVM
MLC
BPNN
FCM
MDC
BIC
CMV
BA
WA-AHP
Overall accuracy
0.873
0.862
0.832
0.784
0.807
SVM
0.895
0.859
0.942
Kappa coefficient
0.814
0.802
0.766
0.694
0.719
SVM
0.848
0.801
0.896


#### 4.2.3. Producer’s Accuracy and User’s Accuracy

Producer’s accuracy and user’s accuracy were calculated to compare the classification accuracy of all the classifiers for each class, as shown in Tables4 and 5. Table 4 shows that, in terms of producer’s accuracy, the best individual classifiers (BIC) are SVM for vegetable field and farm land 1, BPNN for settlement place, and FCM for farm land 2, respectively. Table 5 shows that, in terms of user’s accuracy, BIC are MDC for vegetable field, SVM for settlement place and farm land 2, and FCM for farm land 1, respectively. Compared with base classifiers, three MCSs improved the producer’s accuracy for each land use type. We also found that the producer’s accuracy of each class using WA-AHP rivals the other two MCSs. So we can draw a conclusion that WA-AHP is an effective method for MCS.Table 4
The comparison of producer’s accuracy.
Class
SVM
MLC
BPNN
FCM
MDC
BIC
CMV
BA
WA-AHP
Vegetable field
0.939
0.894
0.833
0.727
0.500
SVM
0.939
0.864
0.955
Settlement place
0.689
0.778
0.933
0.533
0.889
BPNN
0.756
0.911
0.844
Farm land 1
0.890
0.842
0.767
0.815
0.884
SVM
0.884
0.808
0.904
Farm land 2
0.898
0.959
0.939
0.999
0.918
FCM
0.999
0.959
0.999Table 5
The comparison of user’s accuracy.
Class
SVM
MLC
BPNN
FCM
MDC
BIC
CMV
BA
WA-AHP
Vegetable field
0.705
0.720
0.833
0.696
0.917
MDC
0.747
0.814
0.840
Settlement place
0.939
0.897
0.618
0.800
0.563
SVM
0.944
0.672
0.950
Farm land 1
0.956
0.961
0.982
0.992
0.896
FCM
0.977
1.000
0.992
Farm land 2
0.898
0.825
0.793
0.563
0.818
SVM
0.891
0.825
0.845


## 4.1. The Classification Results

We made classification of remote sensing images using SVM, MLC, BPNN, FCM, and MDC, respectively. The classification results of base classifiers were shown in Figure6.Figure 6
The classification results of base classifiers: (a) SVM; (b) MLC; (c) BPNN; (d) FCM; (e) MDC.
(a)
(b)
(c)
(d)
(e)We used CMV, BA, and WA-AHP to construct MCS to classify remote sensing images. When using WA-AHP, it is required to obtain the priorities of base classifiers by their classification accuracy. The producer’s accuracy of base classifiers was used to order the classifiers. Finally, the weight of each base classifier was obtained through AHP as shown in Table1. The classification results of the three MCSs were shown in Figure 7.Table 1
Weight of each base classifier in WA-AHP.
Class
SVM
MLC
BPNN
FCM
MDC
Vegetable field
0.3651
0.3651
0.1622
0.0796
0.0279
Settlement place
0.0702
0.1325
0.5057
0.0337
0.258
Farm land 1
0.4174
0.1602
0.0615
0.0975
0.2634
Farm land 2
0.0733
0.2467
0.1589
0.3828
0.1384Figure 7
The classification results of MCSs: (a) CMV; (b) BA; (c) WA-AHP.
(a)
(b)
(c)


## 4.2. Analysis of Classification Accuracy

We used ROC curve to evaluate the performance of all classifiers. Meanwhile, the confusion matrix is the base of calculating the accuracy evaluation indicators, so we constructed confusion matrix for each classifier including MCSs. More details are described as below.


### 4.2.1. ROC Curve

ROC curves for each class of different classifiers were shown in Figure8, and Table 2 described the corresponding AUC. Although all the classifiers performed rather well, including base classifiers and MCSs, the performance of different classifiers varied for different land use types. To be specific, the best performances are SVM for vegetable field and farm land 1, BPNN for settlement place, and FCM for farm land 2, respectively. MCSs are superior to most base classifiers for different classes to a certain degree. We also found that AUC of WA-AHP is the largest for most classes except settlement place. As a result, the performance of WA-AHP rivals CMV and BA, proving its effectiveness in MCS.Table 2
AUC of each ROC curve.
Class
SVM
MLC
BPNN
FCM
MDC
CMV
BA
WA-AHP
Vegetable field
0.931
0.914
0.898
0.882
0.927
0.918
0.910
0.926
Settlement place
0.822
0.816
0.889
0.819
0.864
0.839
0.911
0.887
Farm land 1
0.949
0.902
0.869
0.943
0.911
0.920
0.923
0.955
Farm land 2
0.938
0.9327
0.925
0.950
0.925
0.939
0.936
0.956Figure 8
ROC curve for each class: (a) vegetable field; (b) settlement place; (c) farm land 1; (d) farm land 2.
(a)
(b)
(c)
(d)


### 4.2.2. Overall Accuracy and Kappa Coefficient

By the equations described in Section3.3.2, we calculated the overall accuracy and kappa coefficient, as shown in Table 3, where BIC means the best individual classifier and SVM and MLC are two best base classifiers in this paper due to their better performance. MCS improved the classification accuracy significantly compared with base classifiers. The overall accuracy and kappa coefficient of WA-AHP were as good as those of CMV and are better than BA.Table 3
The comparison of overall accuracy and kappa coefficient.
SVM
MLC
BPNN
FCM
MDC
BIC
CMV
BA
WA-AHP
Overall accuracy
0.873
0.862
0.832
0.784
0.807
SVM
0.895
0.859
0.942
Kappa coefficient
0.814
0.802
0.766
0.694
0.719
SVM
0.848
0.801
0.896


### 4.2.3. Producer’s Accuracy and User’s Accuracy

Producer’s accuracy and user’s accuracy were calculated to compare the classification accuracy of all the classifiers for each class, as shown in Tables4 and 5. Table 4 shows that, in terms of producer’s accuracy, the best individual classifiers (BIC) are SVM for vegetable field and farm land 1, BPNN for settlement place, and FCM for farm land 2, respectively. Table 5 shows that, in terms of user’s accuracy, BIC are MDC for vegetable field, SVM for settlement place and farm land 2, and FCM for farm land 1, respectively. Compared with base classifiers, three MCSs improved the producer’s accuracy for each land use type. We also found that the producer’s accuracy of each class using WA-AHP rivals the other two MCSs. So we can draw a conclusion that WA-AHP is an effective method for MCS.Table 4
The comparison of producer’s accuracy.
Class
SVM
MLC
BPNN
FCM
MDC
BIC
CMV
BA
WA-AHP
Vegetable field
0.939
0.894
0.833
0.727
0.500
SVM
0.939
0.864
0.955
Settlement place
0.689
0.778
0.933
0.533
0.889
BPNN
0.756
0.911
0.844
Farm land 1
0.890
0.842
0.767
0.815
0.884
SVM
0.884
0.808
0.904
Farm land 2
0.898
0.959
0.939
0.999
0.918
FCM
0.999
0.959
0.999Table 5
The comparison of user’s accuracy.
Class
SVM
MLC
BPNN
FCM
MDC
BIC
CMV
BA
WA-AHP
Vegetable field
0.705
0.720
0.833
0.696
0.917
MDC
0.747
0.814
0.840
Settlement place
0.939
0.897
0.618
0.800
0.563
SVM
0.944
0.672
0.950
Farm land 1
0.956
0.961
0.982
0.992
0.896
FCM
0.977
1.000
0.992
Farm land 2
0.898
0.825
0.793
0.563
0.818
SVM
0.891
0.825
0.845


## 4.2.1. ROC Curve

ROC curves for each class of different classifiers were shown in Figure8, and Table 2 described the corresponding AUC. Although all the classifiers performed rather well, including base classifiers and MCSs, the performance of different classifiers varied for different land use types. To be specific, the best performances are SVM for vegetable field and farm land 1, BPNN for settlement place, and FCM for farm land 2, respectively. MCSs are superior to most base classifiers for different classes to a certain degree. We also found that AUC of WA-AHP is the largest for most classes except settlement place. As a result, the performance of WA-AHP rivals CMV and BA, proving its effectiveness in MCS.Table 2
AUC of each ROC curve.
Class
SVM
MLC
BPNN
FCM
MDC
CMV
BA
WA-AHP
Vegetable field
0.931
0.914
0.898
0.882
0.927
0.918
0.910
0.926
Settlement place
0.822
0.816
0.889
0.819
0.864
0.839
0.911
0.887
Farm land 1
0.949
0.902
0.869
0.943
0.911
0.920
0.923
0.955
Farm land 2
0.938
0.9327
0.925
0.950
0.925
0.939
0.936
0.956Figure 8
ROC curve for each class: (a) vegetable field; (b) settlement place; (c) farm land 1; (d) farm land 2.
(a)
(b)
(c)
(d)


## 4.2.2. Overall Accuracy and Kappa Coefficient

By the equations described in Section3.3.2, we calculated the overall accuracy and kappa coefficient, as shown in Table 3, where BIC means the best individual classifier and SVM and MLC are two best base classifiers in this paper due to their better performance. MCS improved the classification accuracy significantly compared with base classifiers. The overall accuracy and kappa coefficient of WA-AHP were as good as those of CMV and are better than BA.Table 3
The comparison of overall accuracy and kappa coefficient.
SVM
MLC
BPNN
FCM
MDC
BIC
CMV
BA
WA-AHP
Overall accuracy
0.873
0.862
0.832
0.784
0.807
SVM
0.895
0.859
0.942
Kappa coefficient
0.814
0.802
0.766
0.694
0.719
SVM
0.848
0.801
0.896


## 4.2.3. Producer’s Accuracy and User’s Accuracy

Producer’s accuracy and user’s accuracy were calculated to compare the classification accuracy of all the classifiers for each class, as shown in Tables4 and 5. Table 4 shows that, in terms of producer’s accuracy, the best individual classifiers (BIC) are SVM for vegetable field and farm land 1, BPNN for settlement place, and FCM for farm land 2, respectively. Table 5 shows that, in terms of user’s accuracy, BIC are MDC for vegetable field, SVM for settlement place and farm land 2, and FCM for farm land 1, respectively. Compared with base classifiers, three MCSs improved the producer’s accuracy for each land use type. We also found that the producer’s accuracy of each class using WA-AHP rivals the other two MCSs. So we can draw a conclusion that WA-AHP is an effective method for MCS.Table 4
The comparison of producer’s accuracy.
Class
SVM
MLC
BPNN
FCM
MDC
BIC
CMV
BA
WA-AHP
Vegetable field
0.939
0.894
0.833
0.727
0.500
SVM
0.939
0.864
0.955
Settlement place
0.689
0.778
0.933
0.533
0.889
BPNN
0.756
0.911
0.844
Farm land 1
0.890
0.842
0.767
0.815
0.884
SVM
0.884
0.808
0.904
Farm land 2
0.898
0.959
0.939
0.999
0.918
FCM
0.999
0.959
0.999Table 5
The comparison of user’s accuracy.
Class
SVM
MLC
BPNN
FCM
MDC
BIC
CMV
BA
WA-AHP
Vegetable field
0.705
0.720
0.833
0.696
0.917
MDC
0.747
0.814
0.840
Settlement place
0.939
0.897
0.618
0.800
0.563
SVM
0.944
0.672
0.950
Farm land 1
0.956
0.961
0.982
0.992
0.896
FCM
0.977
1.000
0.992
Farm land 2
0.898
0.825
0.793
0.563
0.818
SVM
0.891
0.825
0.845


## 5. Conclusion

We used multiple classifier systems in remote sensing image classification. We selected five classifiers to be base classifiers, including SVM, MLC, BPNN, FCM, and MDC. Three MCSs were constructed, namely, comparative major voting, Bayesian average, and weighted average based AHP proposed in this paper. We compared base classifiers and MCSs. Meanwhile, ROC curve is illustrated and some accuracy indicators were calculated to evaluate the classification results. From this paper, we can draw some conclusions as follows.(1)
In terms of the overall classification accuracy, MCS is more accurate than base classifiers, such as MDC, MLC, BPNN, FCM, and SVM, because it integrates the advantage of each base classifier. The best base classifier is SVM in the selected five base classifiers. The overall accuracy and kappa coefficient of SVM are 0.873 and 0.814, respectively.
(2)
In terms of producer’s accuracy of each type, the best individual classifiers are SVM for vegetable field and farm land 1, BPNN for settlement place, and FCM for farm land 2, respectively.
(3)
In terms of classification accuracy evaluation, the performance of WA-AHP proposed in this paper is superior to Bayesian average method and rivals comparative major voting method. That is because WA-AHP takes the accuracy difference of different base classifiers into consideration.
(4)
ROC curve used in the classification accuracy evaluation of remote sensing images is effective.It is a challenge to improve classification accuracy of remote sensing images. And we introduced artificial intelligence technologies such as MCS, SVM, BPNN, MLC, FCM, and AHP to the research of remote sensing images classification, and the experimental results show that they improve the classification accuracy significantly. Our future research will focus on the application of more artificial intelligence technologies in processing of remote sensing images.



---

*Source: 954086-2015-10-07.xml*