# Active Learning Algorithms for the Classification of Hyperspectral Sea Ice Images

Authors: Yanling Han; Jing Ren; Zhonghua Hong; Yun Zhang; Long Zhang; Wanting Meng; Qiming Gu
Journal: Mathematical Problems in Engineering
 (2015)

---

## Abstract

Sea ice is one of the most critical marine disasters, especially in the polar and high latitude regions. Hyperspectral image is suitable for monitoring the sea ice, which contains continuous spectrum information and has better ability of target recognition. The principal bottleneck for the classification of hyperspectral image is a large number of labeled training samples required. However, the collection of labeled samples is time consuming and costly. In order to solve this problem, we apply the active learning (AL) algorithm to hyperspectral sea ice detection which can select the most informative samples. Moreover, we propose a novel investigated AL algorithm based on the evaluation of two criteria: uncertainty and diversity. The uncertainty criterion is based on the difference between the probabilities of the two classes having the highest estimated probabilities, while the diversity criterion is based on a kernelk-means clustering technology. In the experiments of Baffin Bay in northwest Greenland on April 12, 2014, our proposed AL algorithm achieves the highest classification accuracy of 89.327% compared with other AL algorithms and random sampling, while achieving the same classification accuracy, the proposed AL algorithm needs less labeling cost.


---

## Body

## 1. Introduction

As a member of the global marine and atmospheric system, sea ice with the high albedo has impacted the marine, power between the atmospheres, and heart and material exchange. Also sea ice plays a key role in the radiation balance, energy balance, and mass balance on the ocean surface [1]. Expect for the influence on marine hydrology, atmospheric circulation, and ecosystems, sea ice has a great threat to the shipping and the facilities of marine resource development and has become one of the most prominent oceanic disasters in the polar and high latitude regions.For the prevention and mitigation of the ice disasters and the hazard assessment, we not only need to obtain real-time sea ice area and the outer line information, but also need more detailed data about types, thickness, and distribution of sea ice. However, for the traditional methods of sea ice detection, it is very difficult to get the continuous and large-area sea ice condition, while, remote sensing is an effective mean that can get the large area of sea ice data rapidly. Currently, the main research areas of sea ice detection with the remote sensing are in the polar and high latitude regions. Furthermore, the countries carrying out the relevant research include America, Canada, Norway, Australia, and German. These researches mainly aimed at the moderate-resolution remote sensing detections, such as airborne remote sensing, moderate-resolution imaging spectrometer (MODIS) [2], and synthetic aperture radar (SAR). Shi et al. [3] extracted the information of sea ice by the surface temperature based on NOAA/AVHRR and got the relation between ice thickness and reflectivity by empirical formula; Meyer et al. [4] introduced an approach to map landfast ice extent based on L-band SAR data; Ozsoy-Cicek et al. [5] verified that active microwave can depart the ice edge and floating ice by field survey; Hong [6] proposed to use passive microwave for the inversion of small-scale roughness on ice surface and refractive index of sea ice. In contrast with the traditional remote sensing technology, the hyperspectral remote images contain nearly continuous spectral information and the abundant spatial information, which has a higher capability of the target recognition and can greatly improve the accuracy of target detection. From the published literatures, the researches on sea ice detection with hyperspectral technology are rarely involved by far.Many methods have been developed in the classification of hyperspectral images, which can be mainly concluded in two types [7, 8]: the unsupervised classification and supervised classification. Unsupervised classification does not need priori knowledge and can classify the primary hyperspectral images directly, which is simple and easy to implement, but the classification accuracy is low; the supervised classification needs some priori knowledge in advance and to get the classifier by training the labeled samples; finally we can use the trained classifier to categorize the unlabeled samples, which can get accurate classification accuracies. The classifier based on supervised classification can be obtained by the following ways: probabilistic model, empirical risk minimization (ERM) and structural risk minimization (SRM) [9, 10]. The most classic method based on probabilistic model is maximum likelihood classifier (MLC), which has higher computational complexity and requires a large number of training samples in order to get better classification results [11]; the commonly used methods based on ERM theory include the decision tree and neural network, which are easier to face the problems of “Hughes” and “overfitting” in the case of high dimension and small sample; the SRM principle considers the ERM and SRM simultaneously and increases the generalization capabilities for future samples, where the classic method based on the SRM principle is support vector machine (SVM). At present, SVM has got great progress in the way of theory research and algorithm realization and has obtained better classification results compared with traditional classifiers [12–16]. For example, Melgani and Bruzzone [17] compared the different SVM methods with the k-means and neural network based on radial basis function (RBF) in the original feature space and the feature subspace. Camps-Valls et al. [18] put forward to classify the crop by SVM and compare with other neural network methods, such as a multilayer perception neural network and RBF. Pal and Mather [19] compared the SVM with MLC and multilayer perception neural network and verified the results with Landsat-7.The classification of hyperspectral remote sensing image often applies the supervised classification techniques, which require a large amount of labeled samples. The quality and the number of the available training samples are important for the accurate classification images. Because of the limitations of environment and conditions, the measured data used in the sea ice detection are very rare. The interpretation of hyperspectral images need to be analyzed by traditional remote sensing images with the higher spatial resolution at the same time and scene. But the available training samples are usually not enough for adequate learning of the classifier. How to mark as few samples as possible artificially and obtain better classification performance becomes the key issues of sea ice detection. In order to solve the classification problems, active learning (AL) approaches are proposed based on SVM which have got remarkable success in the real-world learning. The SVM classifier is fit for AL because its classification rule can be characterized by a small number of support vectors that can be easy to update over the successive iterations [20]. At each iteration, the classifiers do not passively accept the training samples provided by the user but actively select the most valuable samples for the current classification model. The obtained labeled samples by the user are incorporated in the training set and the classifiers is retrained and updated. In this way, we can greatly reduce the labeling time and improve the classification accuracy. In recent years, researchers have conducted a large number of studies on the active learning and proposed many AL methods. Tong et al. [21, 22] proposed the margin sampling (MS), which selects the samples closest to the current separating hyperplane as the most uncertainty and informative samples. Another popular strategy is given by committee-based active learners. A set of unlabeled samples are trained by different classifiers. The approach selects the examples where the disagreement is maximal between the classifiers. Afterward, the method based on entropy is proposed. Examples with the highest value of entropy are selected to query the user. In [23], Joshi et al. put forward the best versus second-best (BvSB) approach, which is based on the difference between the probabilities of the two classes having the highest estimated probabilities as a measure of uncertainty. In addition, there are many other AL algorithms, such as the Fisher information matrix method. In this paper, we propose a novel investigated AL technology on the classification of hyperspetral sea ice images, which can select the most informative samples and get good classification results.


## 2. AL Algorithms

### 2.1. AL Process Model

AL was put forward by professor Angluin from Yale University in the paper of “Queries and concept learning” [24]. Currently, the AL algorithms are widely used in the text classification and image retrieval. However, AL can be applied to the classification of remote sensing images by considering the specific features of this area. In the remote sensing problems, the land-cover types of the area are selected by the three methods, such as photo interpretation, ground survey and mixed strategies. But, these strategies are implemented with high costs and much time. So we expect that the AL process can be conducted with few labeled training samples without reducing the convergence capability. The classification framework based on AL is described as shown as the Figure 1.Figure 1
The classification framework based on AL.The active learning process is conducted according to an iterative process that can be described by the form (C, Q, E, T, U) [25], in which, C is a supervised classifier trained; T is the labeled training set; Q is the query function, in order to select the most informative unlabeled samples from the unlabeled sample pool U; E is an human expert who can label the selected samples with the above mentioned three strategies.The iterative process of AL can be described as follows. First, the classifierC is trained on the initial training set T which made up of few labeled samples. After the initialization, the set of samples are selected by Q query function from the pool U and query the expert E. Then, these labeled samples are included into T and the classifier C is retained by the updated training set. The retrained process continues until a stopping criterion (e.g., the labeling costs or the generalization accuracy reached some standard) is satisfied. The algorithm is described as follows.Algorithm 1 (active learning).
Inputs. The inputs are labeled sample set T, unlabeled sample set U, classifier C (Initial), and query function Q.
Output. the output is updated classifier C.(1)
Train the initial classifierC on labeled sample set T.(2)
Classify the unlabeled samplesU by classifier C.(3)
Repeat.(4)
Select the unlabeled samples with the query functionQ from the unlabeled sample pool U.(5)
Label the unlabeled samples by human expertE.(6)
Add the new labeled samples to the training setT.(7)
Retrain the classifierC.(8)
Until the stopping criteria is satisfied.From the above mentioned descriptions, the selection of classifier and sampling strategy are two important components of AL.


### 2.2. The Classification Model

Because SVM shows the outstanding performance in solving small sample, nonlinear and high-dimensional pattern recognitions, we choose the SVM classifier in this paper. SVM is only directly applicable for two-class tasks. Aiming at solving the multiclass classification problems of hyperspectral sea ice images, the implementation of SVM is approached by multiclass strategy.Supposing that the training sample setT is made up of N independent samples, which can be described (xi,yi)i=1N, where xi denotes the training samples and yi∈+1,-1 denotes the associated labels. The basic thought of SVM is to map the data through a proper nonlinear transformation into a higher dimensional feature space, in order to find an optimal hyperplane which maximizes the margin between the two classes.The classification problem can be transformed into a typical convex programming problem [5] on the basis of Kuhn-Tucker theorem. Accordingly, the convex programming problem can be converted into the following the dual linear programming problem by Lagrange multipliers αi associated with the original training patterns xi:(1)Max⁡Ja=Max⁡∑i=1Nαi-12∑i=1j=1NαiαjyiyjKxi,xjs.t.∑i=1Nαiyi=0αi≥0;i=1,…,N.The dual linear problem has global optimization. Theαi values corresponding with the nonsupport vectors are zero, so the optimal classification decision function used for binary problem is obtained by solving above problems:(2)fx=sgn∑SVαiyiKxi·x+b,where SV is the set of support vectors, αi and b are the parameters used to define the optimal hyperplane, and K(·,·) is the kernel function (we adopt the radial basis kernel function with better classification performance).The multiclass classification problems depend on the binary classification, which can be transformed into multiple binary classification problems to solve. The construction of multiclass SVM classifier can be approached in two methods [26, 27]. Firstly, by constructing a series of binary classifiers, the decision is taken by combining the partial decisions of the single members of the ensemble [26, 27]. There are two common techniques, namely, the one-against-all (OAA) strategy and one-against-one (OAO) strategy. Secondly, the method is represented by SVM formulated directly as a multiclass optimization problem. The second method has poor stability and can affect the classification accuracy for the multiclass optimization. The OAO method for SVM is computationally efficient and shows good classification performance [28]. So we use OAO approach for multiclass classification in the paper. If there are k classes of data, then we need to construct k(k-1)/2 binary classifiers in total. In this case, the binary classifier can separate class i from class j by means of a discriminant function fij(x):(3)fijx=sgnwij·x+biji=1,…,k;j=1,…,k;i<j,where wij is the normal vector of the hyperplane discriminating the class i and the class j. The final decision in the OAO strategy is taken on the basis of the “winner-takes-all” rule, which corresponds to the following maximization:(4)M=argmax∑j=1,j≠iksgnfijx.Sometimes, conflict situations may occur between two different classes characterized by the same score. Such ambiguities can be solved by selecting the class with the smaller index value of the class.


### 2.3. The Sampling Strategy

The sampling strategy is crucial to distinguish the pros and cons of different AL algorithms. The selection of unlabeled samples with different strategies depends on the information content of the samples (i.e., the influence of the unlabeled samples on the generalization capabilities of classifier). Currently, the sampling strategy is widely used on the basis of uncertainty. In which, MS is one of the popular and effective measure for active SVM learning, but this method is only applicable to binary SVM classification problem. Although the entropy method is suitable for multiclass classification, it has a drawback. A major shortcoming of the entropy method is that its value is heavily affected by probability values of unimportant classes, which make the classifier confused [23]. In order to solve the aformentioned problems, the BvSB method was proposed which can achieve better performance in the multiclass classification.It is very important to observe that the above mentioned strategies consider only the uncertainty. In the way, the selected samples may have the same label after querying the user. It means that there will be a lot of redundant samples selected, which do not provide additional information and are unfavorable for the algorithm convergence. In order to address the shortcomings, we adopted the enhanced clustering-based diversity criterion (ECBD) based on the diversity distribution of the samples. In the following sections, we will introduce the BvSB method and the EBCD method, respectively.


## 2.1. AL Process Model

AL was put forward by professor Angluin from Yale University in the paper of “Queries and concept learning” [24]. Currently, the AL algorithms are widely used in the text classification and image retrieval. However, AL can be applied to the classification of remote sensing images by considering the specific features of this area. In the remote sensing problems, the land-cover types of the area are selected by the three methods, such as photo interpretation, ground survey and mixed strategies. But, these strategies are implemented with high costs and much time. So we expect that the AL process can be conducted with few labeled training samples without reducing the convergence capability. The classification framework based on AL is described as shown as the Figure 1.Figure 1
The classification framework based on AL.The active learning process is conducted according to an iterative process that can be described by the form (C, Q, E, T, U) [25], in which, C is a supervised classifier trained; T is the labeled training set; Q is the query function, in order to select the most informative unlabeled samples from the unlabeled sample pool U; E is an human expert who can label the selected samples with the above mentioned three strategies.The iterative process of AL can be described as follows. First, the classifierC is trained on the initial training set T which made up of few labeled samples. After the initialization, the set of samples are selected by Q query function from the pool U and query the expert E. Then, these labeled samples are included into T and the classifier C is retained by the updated training set. The retrained process continues until a stopping criterion (e.g., the labeling costs or the generalization accuracy reached some standard) is satisfied. The algorithm is described as follows.Algorithm 1 (active learning).
Inputs. The inputs are labeled sample set T, unlabeled sample set U, classifier C (Initial), and query function Q.
Output. the output is updated classifier C.(1)
Train the initial classifierC on labeled sample set T.(2)
Classify the unlabeled samplesU by classifier C.(3)
Repeat.(4)
Select the unlabeled samples with the query functionQ from the unlabeled sample pool U.(5)
Label the unlabeled samples by human expertE.(6)
Add the new labeled samples to the training setT.(7)
Retrain the classifierC.(8)
Until the stopping criteria is satisfied.From the above mentioned descriptions, the selection of classifier and sampling strategy are two important components of AL.


## 2.2. The Classification Model

Because SVM shows the outstanding performance in solving small sample, nonlinear and high-dimensional pattern recognitions, we choose the SVM classifier in this paper. SVM is only directly applicable for two-class tasks. Aiming at solving the multiclass classification problems of hyperspectral sea ice images, the implementation of SVM is approached by multiclass strategy.Supposing that the training sample setT is made up of N independent samples, which can be described (xi,yi)i=1N, where xi denotes the training samples and yi∈+1,-1 denotes the associated labels. The basic thought of SVM is to map the data through a proper nonlinear transformation into a higher dimensional feature space, in order to find an optimal hyperplane which maximizes the margin between the two classes.The classification problem can be transformed into a typical convex programming problem [5] on the basis of Kuhn-Tucker theorem. Accordingly, the convex programming problem can be converted into the following the dual linear programming problem by Lagrange multipliers αi associated with the original training patterns xi:(1)Max⁡Ja=Max⁡∑i=1Nαi-12∑i=1j=1NαiαjyiyjKxi,xjs.t.∑i=1Nαiyi=0αi≥0;i=1,…,N.The dual linear problem has global optimization. Theαi values corresponding with the nonsupport vectors are zero, so the optimal classification decision function used for binary problem is obtained by solving above problems:(2)fx=sgn∑SVαiyiKxi·x+b,where SV is the set of support vectors, αi and b are the parameters used to define the optimal hyperplane, and K(·,·) is the kernel function (we adopt the radial basis kernel function with better classification performance).The multiclass classification problems depend on the binary classification, which can be transformed into multiple binary classification problems to solve. The construction of multiclass SVM classifier can be approached in two methods [26, 27]. Firstly, by constructing a series of binary classifiers, the decision is taken by combining the partial decisions of the single members of the ensemble [26, 27]. There are two common techniques, namely, the one-against-all (OAA) strategy and one-against-one (OAO) strategy. Secondly, the method is represented by SVM formulated directly as a multiclass optimization problem. The second method has poor stability and can affect the classification accuracy for the multiclass optimization. The OAO method for SVM is computationally efficient and shows good classification performance [28]. So we use OAO approach for multiclass classification in the paper. If there are k classes of data, then we need to construct k(k-1)/2 binary classifiers in total. In this case, the binary classifier can separate class i from class j by means of a discriminant function fij(x):(3)fijx=sgnwij·x+biji=1,…,k;j=1,…,k;i<j,where wij is the normal vector of the hyperplane discriminating the class i and the class j. The final decision in the OAO strategy is taken on the basis of the “winner-takes-all” rule, which corresponds to the following maximization:(4)M=argmax∑j=1,j≠iksgnfijx.Sometimes, conflict situations may occur between two different classes characterized by the same score. Such ambiguities can be solved by selecting the class with the smaller index value of the class.


## 2.3. The Sampling Strategy

The sampling strategy is crucial to distinguish the pros and cons of different AL algorithms. The selection of unlabeled samples with different strategies depends on the information content of the samples (i.e., the influence of the unlabeled samples on the generalization capabilities of classifier). Currently, the sampling strategy is widely used on the basis of uncertainty. In which, MS is one of the popular and effective measure for active SVM learning, but this method is only applicable to binary SVM classification problem. Although the entropy method is suitable for multiclass classification, it has a drawback. A major shortcoming of the entropy method is that its value is heavily affected by probability values of unimportant classes, which make the classifier confused [23]. In order to solve the aformentioned problems, the BvSB method was proposed which can achieve better performance in the multiclass classification.It is very important to observe that the above mentioned strategies consider only the uncertainty. In the way, the selected samples may have the same label after querying the user. It means that there will be a lot of redundant samples selected, which do not provide additional information and are unfavorable for the algorithm convergence. In order to address the shortcomings, we adopted the enhanced clustering-based diversity criterion (ECBD) based on the diversity distribution of the samples. In the following sections, we will introduce the BvSB method and the EBCD method, respectively.


## 3. AL Algorithm Based on Uncertainty and Diversity

### 3.1. The BvSB Method Based on the Uncertainty

Let us assume that the unlabeled sample set isU={x1,…,xn} and the associated labels are denoted by Y={y1,…,yk}, where pyi∣xi denotes the membership probability [29]. Under the BvSB criterion, we only consider the difference as a measure of uncertainty between the probabilities of the two classes having the highest estimated probability. The optimal label and the suboptimal label are denoted by yBest and ySecond-best, respectively, but the other classes are ignored.The probabilities of the optimal label and the suboptimal label for samplexi are represented by pyBest∣xi and pySecond-best∣xi; then the criterion can be described as(5)cuncertaintyxi=argmin⁡xi∈U⁡pyBest∣xi-pySecond-best∣xi.The BvSB method is taken as a more greedy approach as a measure of uncertainty. We use the OAO strategy for multiclass classification. We assume thatCi,j  i,j∈Y is the classifier used to discriminate the sample x between the class i and class j. If the true class label of an unlabeled sample x is l, once its label is marked and added to the training set, which will modify the boundary of the classifiers that separate class l from the other classes. We denote these classifiers by Cl={Cl,ii,l∈Y,i≠l}. Because the true label of the sample x is unknown, we use the optimal label ybest as the evaluation of the true label. Thus, the classification set in contention is called Cybest={Cybest,yii,ybest∈Y,yi≠ybest}. For the classifier set Cybest, the uncertainty degree of sample x can be denoted by the difference in the estimated class probability value pybest-pi, which can be taken as an indicator describing the information content of sample x. By minimizing the value of pybest-pyi, that is maximizing the classification uncertainty, the BvSB criterion is obtained:(6)cuncertaintyx=argmin⁡xi∈U⁡min⁡y∈Y,yi≠yBest⁡pybest∣x-pyi∣x=argmin⁡xi∈U⁡pybest∣x-pysecond-best∣x.According to formula (6), m samples with lower cuncertainty are selected as uncertainty samples. From the view of changing the classification boundaries, the BvSB criterion can be considered an efficient approximation for selecting the informative samples. Figure 2 shows the architecture based on the BvSB method.Figure 2
Architecture of the BvSB method.


### 3.2. The ECBD Method Based on the Diversity

Considering the distribution of uncertain samples at the diversity step, clustering is an effective solution to select the most diverse samples. In the previous section, the similar samples may be selected as the informative samples by the BvSB method. So we consider combining the sampling strategy with unsupervised clustering. In this case, the representative samples are selected to label from different clusters. That is to say, theh<m samples are selected by clustering, where m samples are obtained in the uncertainty step. The standard k-means clustering algorithm is applicable to original feature space, while the SVM classification hyperplane works in the kernel space. Therefore, the selected samples in the original space may not be fit for the kernel space. To overcome this shortcoming, we adopt the enhanced clustering-based diversity method (ECBD) by clustering in kernel space, which is improved based on the standard k-means clustering. The ECBD is described as follows [20].Assuming thatm samples (x1,x2,…,xm) are selected at the uncertainty step, the idea of kernel k-means is to divide m samples into h clusters (C1,C2,…,Ch) in the kernel space, then the most uncertainty samples of each cluster is taken as the representative sample. The center of each cluster is denoted by (ρ1,ρ2,…,ρh). We suppose that sample xi mapped into the kernel space is indicated by φi=∅xi. The Euclidean distance between the sample φi and the sample φj is written as(7)D2φi,φj=∅xi-∅xj2=∅2xi-2∅xi·∅xj+∅2xj=Kxi,xi-2Kxi,xj+Kxj,xj.Let∇k be the cluster center in the kernel space that(8)∇k=1Ck∑i=1mδ(φi,Ck)φi,where Ck denotes the total number of samples in the cluster Ck and is computed as Ck=∑i=1mδxi,Ck. δ(xi,Ck)  1≤k≤h shows the indicator function:(9)δxi,Ck=1Dxi,mk<Dxi,mj∀j≠k0otherwise.The distance betweenφi and ∇k can be expressed as(10)D2φi,∇k=φi-1Ck∑j=1mδφj,Ckφj2=Kxi,xi+fxi,Ck+gCk,where(11)fxi,Ck=-1Ck∑j=1mδφj,CkKxi,xj,gCk=1Ck2∑j=1m∑s=1mδφj,Ckδφs,CkK(xj,xs).By applying (10) to the standard k-means clustering, we obtain the kernel-based k-means algorithm described as follows:(1)
Assign the initial value ofδxi,Ck  (i=1,2,…,m, k=1,2,…,h), and h initial clusters C1,C2,…,Ch are obtained.(2)
For each clusterCk, compute Ck, fxi,Ck and gCk.(3)
For each training samplexi and cluster Ck, assign xi to the closest cluster:(12)δxi,Ck=1fxi,Ck+gCk<fxi,Cj+gCj∀j≠k0otherwise(4)
Repeat step (2) and step (3) until converge.(5)
For each clusterCk, select the sample that is closest to the center in the kernel space as the pseudocenter of Ck:(13)mk=argmin⁡xithatδxi,Ck=1⁡(D2∅xi,∇k).AfterC1,C2,…,Ch are obtained, the most informative sample is selected as the representative sample of each cluster. This sample is defined as follows:(14)xkBvSB+ECBD=argmin⁡xithatδxi,Ck=1⁡cuncertaintyxiBvSBk=1,2,…,h,where xkBvSB+ECBD represents the kth sample chosen by the sampling strategy (i.e., BvSB + ECBD), and it is the most uncertain sample of the kth cluster (i.e., the sample that has minimum cuncertainty(x) in the kth cluster). Totally, h samples are selected using (14), one for each cluster.


### 3.3. AL Algorithm Based on BvSB + ECBD

Based on the considerations of the uncertainty of the current classifier and the diversity of the sample distribution, we design the multiclass classification algorithm based on the BvSB + ECBD method. The BvSB criterion aims at selecting the most informative samples; ECBD criterion is used to select the diversity samples by clustering in the kernel space. In this case, the most representative samples are selected to query the user for sample labels. Then the obtained samples and the corresponding labels are together incorporated into the training samples and the classifier is retrained. The algorithm can be summarized as follows.Algorithm 2 (Proposed BvSB + ECBD).
Inputs
m is the number of samples selected based on the BvSB method
h is the number of samples selected to add to training set at each iteration
K
ini is the number of samples selected as initial training samples
Output
X is set of unlabeled samples added in the training set
(1) The Selection of Training Samples and the Classifier. The training set and the unlabeled pool are marked as T and U, respectively. In the initial classification, Kini samples from the pool U are selected and labeled by the user, and the sample set is denoted by Sini. The training sample set T and the unlabeled pool U are updated: T=Sini, U→U∖Sini. The SVM classifier is trained by the training set T, then we compute the probabilities of all unlabeled samples in the pool U samples belonging to each class, which is denoted by pyi∣x, yi∈Y, and x∈U.
Repeat
(2) AL Based on the BvSB Method. According to aforeobtained probabilities pyi∣x of each unlabeled samples, m samples are chosen from U by formula (5), which is marked as XBvSB={x1BvSB,x2BvSB,…,xmBvSB}.
(3) The Clustering Based on ECBD in the Kernel Space. The m samples are clustered in the kernel space, and detailed description is shown in Section 3.2. The h samples are selected according to formula (14), which is marked as XBvSB+ECBD={x1BvSB+ECBD,x2BvSB+ECBD,…,xhBvSB+ECBD}. These selected samples are marked as the representative samples by the user and denote them by X=XBvSB+ECBD.
(4) Updating the Training Sample Set and Retraining the Classifier. Renew the training sample set and unlabeled sample set with new selected sample T=T∪X, U→U∖X, then the SVM classifier are retrained with the novel training sample set.
Until algorithm converges or satisfies the number of iterations.


## 3.1. The BvSB Method Based on the Uncertainty

Let us assume that the unlabeled sample set isU={x1,…,xn} and the associated labels are denoted by Y={y1,…,yk}, where pyi∣xi denotes the membership probability [29]. Under the BvSB criterion, we only consider the difference as a measure of uncertainty between the probabilities of the two classes having the highest estimated probability. The optimal label and the suboptimal label are denoted by yBest and ySecond-best, respectively, but the other classes are ignored.The probabilities of the optimal label and the suboptimal label for samplexi are represented by pyBest∣xi and pySecond-best∣xi; then the criterion can be described as(5)cuncertaintyxi=argmin⁡xi∈U⁡pyBest∣xi-pySecond-best∣xi.The BvSB method is taken as a more greedy approach as a measure of uncertainty. We use the OAO strategy for multiclass classification. We assume thatCi,j  i,j∈Y is the classifier used to discriminate the sample x between the class i and class j. If the true class label of an unlabeled sample x is l, once its label is marked and added to the training set, which will modify the boundary of the classifiers that separate class l from the other classes. We denote these classifiers by Cl={Cl,ii,l∈Y,i≠l}. Because the true label of the sample x is unknown, we use the optimal label ybest as the evaluation of the true label. Thus, the classification set in contention is called Cybest={Cybest,yii,ybest∈Y,yi≠ybest}. For the classifier set Cybest, the uncertainty degree of sample x can be denoted by the difference in the estimated class probability value pybest-pi, which can be taken as an indicator describing the information content of sample x. By minimizing the value of pybest-pyi, that is maximizing the classification uncertainty, the BvSB criterion is obtained:(6)cuncertaintyx=argmin⁡xi∈U⁡min⁡y∈Y,yi≠yBest⁡pybest∣x-pyi∣x=argmin⁡xi∈U⁡pybest∣x-pysecond-best∣x.According to formula (6), m samples with lower cuncertainty are selected as uncertainty samples. From the view of changing the classification boundaries, the BvSB criterion can be considered an efficient approximation for selecting the informative samples. Figure 2 shows the architecture based on the BvSB method.Figure 2
Architecture of the BvSB method.


## 3.2. The ECBD Method Based on the Diversity

Considering the distribution of uncertain samples at the diversity step, clustering is an effective solution to select the most diverse samples. In the previous section, the similar samples may be selected as the informative samples by the BvSB method. So we consider combining the sampling strategy with unsupervised clustering. In this case, the representative samples are selected to label from different clusters. That is to say, theh<m samples are selected by clustering, where m samples are obtained in the uncertainty step. The standard k-means clustering algorithm is applicable to original feature space, while the SVM classification hyperplane works in the kernel space. Therefore, the selected samples in the original space may not be fit for the kernel space. To overcome this shortcoming, we adopt the enhanced clustering-based diversity method (ECBD) by clustering in kernel space, which is improved based on the standard k-means clustering. The ECBD is described as follows [20].Assuming thatm samples (x1,x2,…,xm) are selected at the uncertainty step, the idea of kernel k-means is to divide m samples into h clusters (C1,C2,…,Ch) in the kernel space, then the most uncertainty samples of each cluster is taken as the representative sample. The center of each cluster is denoted by (ρ1,ρ2,…,ρh). We suppose that sample xi mapped into the kernel space is indicated by φi=∅xi. The Euclidean distance between the sample φi and the sample φj is written as(7)D2φi,φj=∅xi-∅xj2=∅2xi-2∅xi·∅xj+∅2xj=Kxi,xi-2Kxi,xj+Kxj,xj.Let∇k be the cluster center in the kernel space that(8)∇k=1Ck∑i=1mδ(φi,Ck)φi,where Ck denotes the total number of samples in the cluster Ck and is computed as Ck=∑i=1mδxi,Ck. δ(xi,Ck)  1≤k≤h shows the indicator function:(9)δxi,Ck=1Dxi,mk<Dxi,mj∀j≠k0otherwise.The distance betweenφi and ∇k can be expressed as(10)D2φi,∇k=φi-1Ck∑j=1mδφj,Ckφj2=Kxi,xi+fxi,Ck+gCk,where(11)fxi,Ck=-1Ck∑j=1mδφj,CkKxi,xj,gCk=1Ck2∑j=1m∑s=1mδφj,Ckδφs,CkK(xj,xs).By applying (10) to the standard k-means clustering, we obtain the kernel-based k-means algorithm described as follows:(1)
Assign the initial value ofδxi,Ck  (i=1,2,…,m, k=1,2,…,h), and h initial clusters C1,C2,…,Ch are obtained.(2)
For each clusterCk, compute Ck, fxi,Ck and gCk.(3)
For each training samplexi and cluster Ck, assign xi to the closest cluster:(12)δxi,Ck=1fxi,Ck+gCk<fxi,Cj+gCj∀j≠k0otherwise(4)
Repeat step (2) and step (3) until converge.(5)
For each clusterCk, select the sample that is closest to the center in the kernel space as the pseudocenter of Ck:(13)mk=argmin⁡xithatδxi,Ck=1⁡(D2∅xi,∇k).AfterC1,C2,…,Ch are obtained, the most informative sample is selected as the representative sample of each cluster. This sample is defined as follows:(14)xkBvSB+ECBD=argmin⁡xithatδxi,Ck=1⁡cuncertaintyxiBvSBk=1,2,…,h,where xkBvSB+ECBD represents the kth sample chosen by the sampling strategy (i.e., BvSB + ECBD), and it is the most uncertain sample of the kth cluster (i.e., the sample that has minimum cuncertainty(x) in the kth cluster). Totally, h samples are selected using (14), one for each cluster.


## 3.3. AL Algorithm Based on BvSB + ECBD

Based on the considerations of the uncertainty of the current classifier and the diversity of the sample distribution, we design the multiclass classification algorithm based on the BvSB + ECBD method. The BvSB criterion aims at selecting the most informative samples; ECBD criterion is used to select the diversity samples by clustering in the kernel space. In this case, the most representative samples are selected to query the user for sample labels. Then the obtained samples and the corresponding labels are together incorporated into the training samples and the classifier is retrained. The algorithm can be summarized as follows.Algorithm 2 (Proposed BvSB + ECBD).
Inputs
m is the number of samples selected based on the BvSB method
h is the number of samples selected to add to training set at each iteration
K
ini is the number of samples selected as initial training samples
Output
X is set of unlabeled samples added in the training set
(1) The Selection of Training Samples and the Classifier. The training set and the unlabeled pool are marked as T and U, respectively. In the initial classification, Kini samples from the pool U are selected and labeled by the user, and the sample set is denoted by Sini. The training sample set T and the unlabeled pool U are updated: T=Sini, U→U∖Sini. The SVM classifier is trained by the training set T, then we compute the probabilities of all unlabeled samples in the pool U samples belonging to each class, which is denoted by pyi∣x, yi∈Y, and x∈U.
Repeat
(2) AL Based on the BvSB Method. According to aforeobtained probabilities pyi∣x of each unlabeled samples, m samples are chosen from U by formula (5), which is marked as XBvSB={x1BvSB,x2BvSB,…,xmBvSB}.
(3) The Clustering Based on ECBD in the Kernel Space. The m samples are clustered in the kernel space, and detailed description is shown in Section 3.2. The h samples are selected according to formula (14), which is marked as XBvSB+ECBD={x1BvSB+ECBD,x2BvSB+ECBD,…,xhBvSB+ECBD}. These selected samples are marked as the representative samples by the user and denote them by X=XBvSB+ECBD.
(4) Updating the Training Sample Set and Retraining the Classifier. Renew the training sample set and unlabeled sample set with new selected sample T=T∪X, U→U∖X, then the SVM classifier are retrained with the novel training sample set.
Until algorithm converges or satisfies the number of iterations.


## 4. Experiment Analysis

### 4.1. Data set Description

Hyperion sensor is mounted on the Earth observation satellite which was launched by NASA in November 2000. Hyperspectral image has a total of 242 bands and spatial resolution of 30 m. There are 220 unique spectral channels collected with a complete spectrum covering from 357–2576 nm. Because it is being in the experimental stage, the coverage of hyperspectral image is small, only 7.7 km × 44 km [30]. Because hyperspectral images have the high resolution and continuous spectrums, it has been widely used in vegetation studies, geological surveys, fine agriculture, marine remote sensing and so on.The data set is a hyperspectral image acquired on a marine area of Baffin Bay in northwest Greenland on April 12, 2014. The data are L1Gst level through geometric correction, projection registration and topographic correction. This image consists of 2395 × 1769 pixels (which include background pixels). The number of bands is initially reduced to 176 by removing the bands with low signal-to-noise and water absorption. The available labeled samples (1678 samples) are collected by Landsat-8 image interpretation, which are illustrated in Figure3(a). Figure 3(b) is a subset of the entire image in Figure 3(a). As can be seen from the image, there are three different classes available, namely seawater, thin ice and thick ice. All labeled samples are randomly divided to derive a pool U and the validation set V. Here we use Landsat-8 data with a spatial resolution of 15 m as the test set at the same time and same scene. The final classification performance is evaluated by calculating the Kappa coefficient and the overall classification accuracy. The classes and the related number of samples used in the experiments are shown in Table 1.Table 1
Number of samples of each class inU,V for the data set.
Class
U
V
Seawater
343
200
Thin ice
339
200
Thick ice
396
200
Total
1078
600Figure 3
(a) Hyperspectral image marked with labeled samples (a false color image composed of R: 84, G: 49, and B: 25). (b) Partial hyperspectral image taken from (a).


### 4.2. Design of Experiments

In our experiments, without losing generality, we adopt an SVM classifier with radial basis function (RBF) kernel. The values for the regularization parameterC and the spread γ of the RBF kernel parameters are acquired by the cross validation grid search method on the basis of the validation set. Finally, the best value of the parameter C is 32; the optimal kernel width parameter γ is found equal to 16.The experiments are designed in order to compare the classification accuracy with different AL algorithms that are, respectively, BvSB and the investigated and proposed techniques (BvSB +k-means and BvSB + ECBD). In the experiments with AL algorithms, three samples of each class are randomly chosen from the pool U as initial training samples, and the rest are considered as unlabeled samples. All experimental results are referred to the average classification accuracies obtained in ten trials because of ten initial randomly selected training samples. At each round of active learning in the following, firstly, in the uncertainty step, we select m samples on the basis of uncertainty (the difference between the highest estimated probability values of the two classes, i.e., BvSB) to query the user for labels. In the diversity step, the most diverse h<m samples are chosen based on either standard k-means or ECBD to query the user for labels. Then the selected samples and the corresponding labels are together incorporated in the training set. Finally, the classifier is retrained. The related number of samples chosen by the different methods is shown in Table 2.Table 2
Number of samples chosen by the different methods.
Method
m
h
BvSB
3
—
BvSB +K-means
12
3
BvSB + ECBD
12
3


### 4.3. Experimental Results

This section reports experimental results with the random sampling and AL algorithms, that are respectively BvSB, BvSB +k-means, and BvSB + ECBD. Results are presented as learning rate curves, which show the relation between the average overall classification accuracies and the active learning rounds used to train the SVM classifier. By analyzing Figure 4, we can observe that three AL algorithms are generally better than random sampling. The results show that our proposed BvSB + ECBD technique shows the highest accuracies in most of the iterations. Furthermore, given the same size of training samples, as indicated by the same point on the x-axis, BvSB + ECBD shows significantly improved classification accuracy. From another perspective, in order to achieve the same value of classification accuracy (same point on the y-axis), our proposed active learning algorithm needs far fewer training samples than random selection from Table 3. The result indicates that the proposed method selects the most useful samples at each iteration, so that user input can be effectively utilized on the most relevant samples [23].Table 3
Percentage reduction in the number of training samples.
BvSB + ECBD selection rounds
Random selection rounds
%Reduction in training samples
1
8
63.64
2
9
58.33
5
17
60
8
19
50Figure 4
Classification of overall accuracy obtained with different AL algorithms and sampling.From Figure4, one can know that the BvSB + ECBD method provides more informative samples compared to BvSB and BvSB + k-means methods and achieves higher accuracies with the same active learning rounds. Figures 5 and 6 show the distribution of the chosen training samples and the pool (considering bands 49 and 84 of the hyperspectral image) after six iterations of the AL process with the BvSB method and BvSB + ECBD method, respectively. Note that, since the BvSB method considers only the uncertainty of samples, it may result in the selection of similar samples which can only provide redundant information. We can also find that performing the clustering in the kernel space can improve the classification accuracy compared with the standard k-means clustering. Indeed, because of the kernel mapping, the set of most diverse sample in the original space may not be the most diverse in the kernel space [20].Figure 5
Distribution of the chosen training samples by the BvSB method and pool samples considering bands 49 and 84 of the hyperspectral image.Figure 6
Distribution of the chosen training samples by the BvSB + ECBD method and pool samples considering bands 49 and 84 of the hyperspectral image.In Figure7, we demonstrate the original hyperspectral image and the classification results, in which, Figure 7(a) is an original hyperspectral image composed of band 25, 49 and 84. Figure 7(b) is the classification image of the Landsat-8 data obtained by the standard SVM classifier, which used as a reference image for evaluating the classification performance. Further, Figure 7(c) is the classification image of the hyperspectral image with the BvSB + ECBD method.Figure 7
(a) Hyperspectral image (a false color image composed of R: 84, G: 49, and B: 25). (b) Result of the classification of the Landsat-8 data. (c) Result of the classification of the hyperspectral image.
(a)
(b)
(c)In order to assess the classification performance of our proposed method, in Table4, we also report the confusion matrix, the accuracy per class and Kappa coefficient at the last iteration of the BvSB + ECBD method. It is important to observe that the accuracies of seawater and thin ice are low. Since hyperspectral image was acquired in April, 2014, thin ice began to melt with the increasing temperature. So there are lots of pixels of seawater and thin ice that were confused and wrongly classified.Table 4
Confusion matrix for the classification with the proposed BvSB + ECBD method.
Class
Seawater
Thin ice
Thick ice
Total
Seawater
45476
9967
2450
57893
Thin ice
21741
139924
39873
201538
Thick ice
3729
59508
963416
1026653
Total
70946
209399
1005739
1286084
%Accuracy per class
64.099
66.822
95.792
—
Kappa = 0.693
Overall accuracy = 89.327%Finally, we carry out an analysis of the sensibility of our proposed BvSB + ECBD method with different number of initial training samples. In Figure8, n denotes the total number of initial training samples of three classes, where, the selected number of samples of each class is the same. One can see that, selecting different n values results in similar classification accuracies. The experiment result indicates that the different initial training samples do not provide a large benefit in the BvSB + ECBD method, that is to say, the classification accuracy is not sensitive to the selection of initial training samples [23]. Furthermore, we can also observe that, when using high n values, convergence is easily achieved than when using small n values. That is because the greater n values, the more the number of training samples, when given the same number of rounds.Figure 8
Classification overall accuracy obtained by the BvSB + ECBD method with differentn values.


## 4.1. Data set Description

Hyperion sensor is mounted on the Earth observation satellite which was launched by NASA in November 2000. Hyperspectral image has a total of 242 bands and spatial resolution of 30 m. There are 220 unique spectral channels collected with a complete spectrum covering from 357–2576 nm. Because it is being in the experimental stage, the coverage of hyperspectral image is small, only 7.7 km × 44 km [30]. Because hyperspectral images have the high resolution and continuous spectrums, it has been widely used in vegetation studies, geological surveys, fine agriculture, marine remote sensing and so on.The data set is a hyperspectral image acquired on a marine area of Baffin Bay in northwest Greenland on April 12, 2014. The data are L1Gst level through geometric correction, projection registration and topographic correction. This image consists of 2395 × 1769 pixels (which include background pixels). The number of bands is initially reduced to 176 by removing the bands with low signal-to-noise and water absorption. The available labeled samples (1678 samples) are collected by Landsat-8 image interpretation, which are illustrated in Figure3(a). Figure 3(b) is a subset of the entire image in Figure 3(a). As can be seen from the image, there are three different classes available, namely seawater, thin ice and thick ice. All labeled samples are randomly divided to derive a pool U and the validation set V. Here we use Landsat-8 data with a spatial resolution of 15 m as the test set at the same time and same scene. The final classification performance is evaluated by calculating the Kappa coefficient and the overall classification accuracy. The classes and the related number of samples used in the experiments are shown in Table 1.Table 1
Number of samples of each class inU,V for the data set.
Class
U
V
Seawater
343
200
Thin ice
339
200
Thick ice
396
200
Total
1078
600Figure 3
(a) Hyperspectral image marked with labeled samples (a false color image composed of R: 84, G: 49, and B: 25). (b) Partial hyperspectral image taken from (a).


## 4.2. Design of Experiments

In our experiments, without losing generality, we adopt an SVM classifier with radial basis function (RBF) kernel. The values for the regularization parameterC and the spread γ of the RBF kernel parameters are acquired by the cross validation grid search method on the basis of the validation set. Finally, the best value of the parameter C is 32; the optimal kernel width parameter γ is found equal to 16.The experiments are designed in order to compare the classification accuracy with different AL algorithms that are, respectively, BvSB and the investigated and proposed techniques (BvSB +k-means and BvSB + ECBD). In the experiments with AL algorithms, three samples of each class are randomly chosen from the pool U as initial training samples, and the rest are considered as unlabeled samples. All experimental results are referred to the average classification accuracies obtained in ten trials because of ten initial randomly selected training samples. At each round of active learning in the following, firstly, in the uncertainty step, we select m samples on the basis of uncertainty (the difference between the highest estimated probability values of the two classes, i.e., BvSB) to query the user for labels. In the diversity step, the most diverse h<m samples are chosen based on either standard k-means or ECBD to query the user for labels. Then the selected samples and the corresponding labels are together incorporated in the training set. Finally, the classifier is retrained. The related number of samples chosen by the different methods is shown in Table 2.Table 2
Number of samples chosen by the different methods.
Method
m
h
BvSB
3
—
BvSB +K-means
12
3
BvSB + ECBD
12
3


## 4.3. Experimental Results

This section reports experimental results with the random sampling and AL algorithms, that are respectively BvSB, BvSB +k-means, and BvSB + ECBD. Results are presented as learning rate curves, which show the relation between the average overall classification accuracies and the active learning rounds used to train the SVM classifier. By analyzing Figure 4, we can observe that three AL algorithms are generally better than random sampling. The results show that our proposed BvSB + ECBD technique shows the highest accuracies in most of the iterations. Furthermore, given the same size of training samples, as indicated by the same point on the x-axis, BvSB + ECBD shows significantly improved classification accuracy. From another perspective, in order to achieve the same value of classification accuracy (same point on the y-axis), our proposed active learning algorithm needs far fewer training samples than random selection from Table 3. The result indicates that the proposed method selects the most useful samples at each iteration, so that user input can be effectively utilized on the most relevant samples [23].Table 3
Percentage reduction in the number of training samples.
BvSB + ECBD selection rounds
Random selection rounds
%Reduction in training samples
1
8
63.64
2
9
58.33
5
17
60
8
19
50Figure 4
Classification of overall accuracy obtained with different AL algorithms and sampling.From Figure4, one can know that the BvSB + ECBD method provides more informative samples compared to BvSB and BvSB + k-means methods and achieves higher accuracies with the same active learning rounds. Figures 5 and 6 show the distribution of the chosen training samples and the pool (considering bands 49 and 84 of the hyperspectral image) after six iterations of the AL process with the BvSB method and BvSB + ECBD method, respectively. Note that, since the BvSB method considers only the uncertainty of samples, it may result in the selection of similar samples which can only provide redundant information. We can also find that performing the clustering in the kernel space can improve the classification accuracy compared with the standard k-means clustering. Indeed, because of the kernel mapping, the set of most diverse sample in the original space may not be the most diverse in the kernel space [20].Figure 5
Distribution of the chosen training samples by the BvSB method and pool samples considering bands 49 and 84 of the hyperspectral image.Figure 6
Distribution of the chosen training samples by the BvSB + ECBD method and pool samples considering bands 49 and 84 of the hyperspectral image.In Figure7, we demonstrate the original hyperspectral image and the classification results, in which, Figure 7(a) is an original hyperspectral image composed of band 25, 49 and 84. Figure 7(b) is the classification image of the Landsat-8 data obtained by the standard SVM classifier, which used as a reference image for evaluating the classification performance. Further, Figure 7(c) is the classification image of the hyperspectral image with the BvSB + ECBD method.Figure 7
(a) Hyperspectral image (a false color image composed of R: 84, G: 49, and B: 25). (b) Result of the classification of the Landsat-8 data. (c) Result of the classification of the hyperspectral image.
(a)
(b)
(c)In order to assess the classification performance of our proposed method, in Table4, we also report the confusion matrix, the accuracy per class and Kappa coefficient at the last iteration of the BvSB + ECBD method. It is important to observe that the accuracies of seawater and thin ice are low. Since hyperspectral image was acquired in April, 2014, thin ice began to melt with the increasing temperature. So there are lots of pixels of seawater and thin ice that were confused and wrongly classified.Table 4
Confusion matrix for the classification with the proposed BvSB + ECBD method.
Class
Seawater
Thin ice
Thick ice
Total
Seawater
45476
9967
2450
57893
Thin ice
21741
139924
39873
201538
Thick ice
3729
59508
963416
1026653
Total
70946
209399
1005739
1286084
%Accuracy per class
64.099
66.822
95.792
—
Kappa = 0.693
Overall accuracy = 89.327%Finally, we carry out an analysis of the sensibility of our proposed BvSB + ECBD method with different number of initial training samples. In Figure8, n denotes the total number of initial training samples of three classes, where, the selected number of samples of each class is the same. One can see that, selecting different n values results in similar classification accuracies. The experiment result indicates that the different initial training samples do not provide a large benefit in the BvSB + ECBD method, that is to say, the classification accuracy is not sensitive to the selection of initial training samples [23]. Furthermore, we can also observe that, when using high n values, convergence is easily achieved than when using small n values. That is because the greater n values, the more the number of training samples, when given the same number of rounds.Figure 8
Classification overall accuracy obtained by the BvSB + ECBD method with differentn values.


## 5. Conclusions

In this paper, AL algorithms in the classification of hyperspectral image have been addressed, which can reduce the number of labeled samples added to training set and improve the classification accuracy with respect to traditional passive techniques. Query function based on BvSB in the uncertainty step, and standardk-means clustering and ECBD in the diversity step have been generalized to multiclass problems. Moreover, our proposed novel BvSB + ECBD method is compared with BvSB, BvSB + k-means and random sampling in the classification accuracy. By analyzing the experiment results, we can summarize as follows: (1) The proposed BvSB + ECBD method gets the best performance in terms of classification accuracy and can reduce a large amount of labeled samples compared with random sampling; (2) the BvSB + k-means method provides slightly lower classification accuracies than the BvSB + ECBD technique. At the diversity step, because of kernel mapping, the most diverse samples in the original space by the standard k-means clustering may not be the most diverse in the kernel space, which means that the most informative samples cannot be selected for the current classifier; (3) the BvSB method leads to poorer classification accuracies with respect to other AL algorithms. Therefore, we can conclude that obtained uncertainty samples based on the BvSB technique may be the similar samples and cannot provide available information; (4) our proposed BvSB + ECBD method is not sensitive to the selection of initial training samples.As a future development, we consider to extend our proposed AL technique by integrating the semisupervised method in the classification of hyperspectral image. During the iterative process, we can also make full use of abundant spectral information to select the more respective samples and more accurately identify the types of ice.



---

*Source: 124601-2015-06-23.xml*