Current Issue Cover


摘 要
目的 高光谱图像波段数目巨大,导致在解译及分类过程中出现维数灾难的现象。针对该问题,在K-Means聚类算法基础上,考虑各个波段对不同聚类的重要程度,同时顾及类间信息,提出一种基于熵加权K-Means全局信息聚类的高光谱图像分类算法。方法 首先,引入波段权重,用来刻画各个波段对不同聚类的重要程度,并且定义熵信息测度表达该权重。其次,为避免局部最优聚类,引入类间距离测度实现全局最优聚类。最后,将上述两类测度引入K-Means聚类目标函数,通过最小化目标函数得到最优分类结果。结果 为了验证提出的高光谱图像分类方法的有效性,对Salinas高光谱图像和Pavia University高光谱图像标准图中的地物类别根据其光谱反射率差异程度进行合并,将合并后的标准图作为新的标准分类图。分别采用本文算法和传统K-Means算法对Salinas高光谱图像和Pavia University高光谱图像进行实验,并定性和定量地评价和分析了实验结果。实验结果表明,对于图像中合并后的地物类别,光谱反射率差异程度大,本文算法较传统K-Means算法有更好的分类结果。结论 提出一种基于熵加权K-Means全局信息聚类的高光谱图像分类算法,实验结果表明,本文算法对高光谱图像中具有不同光谱反射率差异程度各类地物目标均能取得很好的分类结果。
A algorithm based on entropy weighted K-Means with global information for hyperspectral image classification

Li Yu,Zhen Chang,Shi Xue,Zhao Quanhua(The Institute for Remote Sensing,School of Geomatics,Liaoning Technology University)

Hyperspectral remote sensing has become a promising research field and is applied to various aspects. Thus, hyperspectral image classification has become the key part of hyperspectral image processing. The significant trait of hyperspectral images is the excessive number of bands, which leads to the phenomenon of “the curse of the dimension” in their interpretation and classification. It is difficult to make fully use of these bands’ information, in classification of hyperspectral images. K-Means algorithm is the most classical clustering algorithm, which is widely used for image classification. The general idea of K-Means algorithm is to treat every feature as equally important. However, when the K-Means algorithm is used for the classification of hyperspectral images, every band is regarded as a feature, which leads to the difficulty in feature utilization and poor classification results. To solve this problem, the idea of feature weighting is introduced. So, this study proposes a hyperspectral image classification algorithm based on entropy weighted K-Means by considering global information. Method The proposed hyperspectral image classification method is on the basis of K-Means clustering algorithm, and takes them into account, each of which indicates the importance of every band to different clusters and the inter-cluster information. The way of feature weighting is used to distinguish the importance of every band to different clusters, which is described by the band weight. In statistics, entropy represents the degree of uncertainty of information, so entropy information measurement is defined to express the weight distribution here. In hyperspectral image classification, the distance between classes has a great influence on the clustering results. In order to avoid the local optimal clustering and make the results more accurate, the distance measurement of inter-cluster information is introduced to realize the global optimal clustering. The above two kinds of measurements are introduced into the K-Means clustering objective function, and the optimal classification results are obtained by minimizing the objective function. Result In order to verify the proposed hyperspectral image classification method effectively, classification experiments are conducted using the proposed algorithm and K-Means algorithm on Salinas hyperspectral image and Pavia University hyperspectral image, respectively. There, the ground objects in the standard images of Salinas and Pavia University are merged according to the difference degree of spectral reflectance, and the combined standard images are taken as the standard classification information. The classification results demonstrate that the proposed algorithm can effectively obtain better results than K-Means algorithm. The overall accuracy and Kappa coefficient are calculated from confusion matrix and compared with K-Means algorithm to quantitatively evaluate the proposed algorithm. The accuracy values demonstrate that the proposed algorithm can achieve more precise classification results than K-Means algorithm. Conclusion This study proposes a hyperspectral image classification method that connects traditional K-Means algorithm with the idea of feature weighting and the inter-cluster information. Experimental results show that this approach is promising and effective and can achieve good classification results for all kinds of ground objects in hyperspectral images with large spectral reflectance differences. In future research, it still needs to improve that the similarity between features and the spatial information are considered.