基于多核模糊粗糙集与蝗虫优化算法的高光谱波段选择

波段选择能有效减少高光谱数据的空间冗余,为后续分类提供有效的支持。多核模糊粗糙集模型能够对包含不确定性的数值数据进行分析和近似描述,而蝗虫优化算法对优化问题求解具有较强的探索和开发能力,因而将多核模糊粗糙集模型引入高光谱的不确定性分析建模中,采用蝗虫优化算法对波段子集进行选择,提出了一种基于多核模糊粗糙集与蝗虫优化算法的高光谱波段选择算法。首先,使用多核算子来进行相似性度量,提高模型对数据分布的适应性。定义基于核模糊粗糙集的波段相关性度量,通过模糊粗糙集中不同像素点地物上的下近似分布来度量波段之间的相关性。然后,综合考虑波段依赖度、波段信息熵、波段间相关性来定义波段子集的适应度函数。最后,在常用高光谱数据集Indiana Pines农业区上,采用J48和K近邻(KNN)作为分类算法,把所提算法与波段相关性分析(BCA)、标准化互信息(NMI)算法进行分类性能比较。实验结果表明,在选取较少波段个数时,所提算法的总体平均分类精度提高了2.46和1.54个百分点。     

基于DS聚类的高光谱图像集成分类算法

针对高光谱遥感图像维数高、样本少导致分类精度低的问题,提出一种基于DS聚类的高光谱图像集成分类算法(DSCEA)。首先,根据高光谱数据特点,从整体波段中随机选择一定数量的波段,构成不同的训练样本;其次,分析图像的空谱信息,构造无向加权图,利用优势集(DS)聚类方法得到最大特征差异的波段子集;最后,根据不同样本,利用支持向量机训练具有差异的单个分类器,采用多数表决法集成最终分类器,实现对高光谱遥感图像的分类。在Indian Pines数据集上DSCEA算法的分类精度最高可达到84.61%,在Pavia University数据集上最高可达到91.89%,实验结果表明DSCEA算法可以有效的解决高光谱分类问题。     

基于萤火虫算法的高光谱遥感波段选择方法

高光谱图像在遥感领域中的应用越来越广泛,但由于自身的高数据维、波段间的高冗余度等特性给图像处理带来了一定困难,针对这个问题,提出一种基于类间可分性准则的改进萤火虫仿生算法,进行高光谱遥感波段选择。在分析萤火虫算法机理的基础上,阐述了利用该算法进行高光谱波段选择的思路,并构造波段相似性矩阵,选择欧氏距离、JM距离、光谱信息散度和离散度作为可分性准则来设置目标函数,根据目标函数值的优劣选择优势波段。最后,使用HYDICE Washington DC Mall和 HyMap Purdue Campus两个高光谱遥感影像数据进行实验验证,并利用支持向量机分类器对最佳波段组合进行精度评价,证明该算法的可行性和有效性。
     

基于K-AP算法的高光谱图像波段选择方法

在高光谱图像分析领域中，波段选择是一种能有效减少高光谱图像维度的方法。K类仿射传播算法是一种高效的聚类算法，已成功地应用于人脸识别和数据分析等领域，但在高光谱图像分析领域还少有成功的应用。提出将K-AP算法应用于高光谱图像波段选择，对高光谱图像进行有效的数据压缩。针对K-AP算法的特点，基于Kullback-Leibler散度定义了新的相似度矩阵，对波段进行度量，再使用K-AP算法进行聚类，选择最有代表性的波段。实验结果表明，与常用的波段选择方法相比，所提出的方法有更好的表现。     

基于SNMF聚类与类间可分性因子的高光谱波段选择

高光谱图像的波段范围广、光谱分辨率高,能为图像分类研究提供丰富的信息,但同时也给计算和存储带来了较大困难.论文提出一种基于SNMF聚类与类间可分性因子的方法来进行高光谱图像波段选择,以降低计算和存储开销.首先是数据预处理工作,将高光谱数据进行三维转二维表达,然后利用SNMF聚类算法得到波段的各个类簇,最后以各波段的类间可分性因子为指标在类簇内进行波段选择.实验采用波段子集的平均信息熵、平均相关系数和平均相对熵三类指标进行定量评价,并采用SVM分类器进行分类验证.     

基于最大最小距离的高光谱遥感图像波段选择

为减少高光谱遥感图像光谱空间冗余,降低后续处理的计算复杂度,提出一种基于最大最小距离的高光谱图像波段选择算法。首先计算波段标准差,选定标准差最大的波段作为初始中心;然后使用最大最小距离算法得到相对距离较远的聚类中心,对波段进行聚类;最后使用K中心点算法更新聚类中心。实验仿真结果表明:通过基于最大最小距离算法选择的波段,能够选出同时满足信息量大、相关性小的要求的波段子集,并将获得的波段组合用于高光谱图像分类时,可以得到较好的分类精度。     

面向分类应用的高光谱谱段选择方法

高光谱数据在物质分类识别领域得到了广泛应用,但存在数据量大、波段间相关性高等问题,严重影响分类精度及应用。针对以上问题分析了已有的波段选择方法,提出了基于波段聚类及监督分类的遗传算法,对高光谱数据进行波段选择：采用[K]均值聚类算法对波段数据进行聚类分析,构造波段子集合;利用分类器族分类精度构造适应度函数,采用遗传算法对波段子集合进行优化选择。最后用阔叶林高光谱数据对提出的算法进行对比实验,实验结果表明针对分类应用,提出的算法能够非常有效地选择高光谱谱段。     

基于3维上下文预测的高光谱图像无损压缩

如今高光谱数据的有效压缩已成为遥感技术发展中需要迫切解决的问题,为了对高光谱数据进行有效压缩,提出了一种基于3维上下文预测的高光谱图像无损压缩算法。该算法首先根据相邻波段间的相关性大小进行波段分组,同时对各个分组重新进行波段排序;然后采用自适应波段选择算法对高光谱图像进行降维,再利用k-means算法对降维后的波段谱向矢量进行聚类;最后在参考波段和当前波段中通过定义3维上下文预测结构,在聚类结果的基础上,对各个分类分别训练其最优的预测系数。实验结果表明,该方法可显著降低压缩后图像编码的平均比特率。     

基于Fisher score与模糊邻域熵的多标记特征选择算法

针对Fisher score未充分考虑特征与标记以及标记之间的相关性，以及一些邻域粗糙集模型容易忽略边界域中知识粒的不确定性，导致算法分类性能偏低等问题，提出一种基于Fisher score与模糊邻域熵的多标记特征选择算法（MLFSF）。首先，利用最大信息系数（MIC）衡量特征与标记之间的关联程度，构建特征与标记关系矩阵；基于修正余弦相似度定义标记关系矩阵，分析标记之间的相关性。其次，给出一种二阶策略获得多个二阶标记关系组，以此重新划分多标记论域；通过增强标记之间的强相关性和削弱标记之间的弱相关性得到每个特征的得分，进而改进Fisher score模型，对多标记数据进行预处理。再次，引入多标记分类间隔，定义自适应邻域半径和邻域类并构造了上、下近似集；在此基础上提出了多标记粗糙隶属度函数，将多标记邻域粗糙集映射到模糊集，基于多标记模糊邻域给出了上、下近似集以及多标记模糊邻域粗糙集模型，由此定义模糊邻域熵和多标记模糊邻域熵，有效度量边界域的不确定性。最后，设计基于二阶标记相关性的多标记Fisher score特征选择算法（MFSLC），从而构建MLFSF。在多标记K近邻（MLKNN）分类器...     

基于粗糙集的遥感优化分类波段选择

针对高光谱遥感影像的特点,本文采取一种优化分类波段组合的分级选择策略.利用扩展的属性依赖性公式定义了波段间的相似度.通过模糊聚类,得到对原始波段集合的模糊等价划分.在每个模糊等价波段组中,选择一个代表性波段或进行线性融合,完成对原始波段集合的初步降维.基于遗传算法并结合粗糙集理论,绐出两项能提高遗传搜索效率的增效措施,从而对降维后的波段集合进行不一致优化分类波段组合的选择.实验结果表明,本文提出的高光谱遥感影像优化分类波段组合选择方法是非常有效的.     

基于波段影像统计信息量加权K-means聚类的高光谱影像分类

针对分类过程中如何合理利用高光谱影像波段问题,提出一种基于波段影像统计量加权K-means聚类的高光谱影像分类算法.该算法的核心思想在于:由波段含有的信息量及波段间的相关性确定各波段权重,同时考虑各波段对各聚类的重要性.首先,根据波段影像的熵、标准差及均值定义波段信息量函数,根据相邻波段影像互信息定义相关性函数;其次,由上述波段信息量函数及波段间相关性函数定义波段权重函数;然后,结合波段权重和波段-类属权重定义规则化目标函数;最后,依据参数特性设计目标函数求解方案.对Salinas高光谱影像和Pavia Centre高光谱影像分别采用所提出的算法与传统K-means算法、PCA$+K$-means算法及子空间波段选择$+K$-means算法进行对比实验,对于总精度及Kappa系数,所提出的算法都高于其他3种对比算法,结果验证了所提出算法的有效性.相对于其他3种算法而言,所提出的算法可有效改善高光谱影像分类的性能.     

结合遗传算法和蚁群算法的高光谱图像波段选择

随着遥感技术和成像光谱仪的发展,高光谱遥感图像的应用越来越广泛,但其自身的特点给高光谱图像的分类、识别等带来了很大的困难.如何快速地从高达数百个波段的高光谱图像中选择出具有较好分类识别能力的波段组合是亟待解决的问题.针对上述问题分析了已有的波段选择方法,提出一种结合遗传算法和蚁群算法的高光谱图像波段选择方法.该算法首先利用遗传算法以较快的寻优能力获得几组较优解,以此来初始化蚁群算法的初始信息素列表,然后用蚁群算法以较高的求精解能力获得最优解,并且在遗传算法部分中采用四进制的编码方式,使得算法编/译码简单、遗传算子操作简捷、且处理时所占空间小,同时在蚁群算法部分中巧妙地对预处理图像进行子空间划分来缩小蚂蚁搜索的范围,提高了算法的搜索效率,减小了输出波段组合的相关性和冗余度.由于该算法充分地吸取遗传算法和蚁群算法的优点、克服各自的缺陷,是一种计算耗时少、收敛性能好的波段选择方法.利用AVIRIS(airborne visible infrared imaging spectrometer)图像对提出的算法进行实验,实验结果表明,本文算法在所选波段性能和计算耗时方面都获得令人满意的效果.     

基于距离比值尺度的模糊粗糙集属性约简

属性约简能有效地去除不必要属性,提高分类器的性能。模糊粗糙集是处理不确定信息的重要范式,能有效地应用于属性约简。在模糊粗糙集中,样本分布的不确定性会影响对象的近似集,进而影响有效属性约简的获取。为有效地定义近似集,文中提出了基于距离比值尺度的模糊粗糙集,该模型引入了基于距离比值尺度的样本集的定义,通过对距离比值尺度的控制,避免了样本分布不确定性对近似集的影响;给出了该模型的基本性质,定义了新的依赖度函数,进而设计了属性约简算法;以SVM,NaiveBayes和J48作为测试分类器,在UCI数据集上评测所提算法的性能。实验结果表明,所提出的属性约简算法能够有效获取约简并提高分类的精度。     

A non-negative low-rank representation for hyperspectral band selection

Hyperspectral images are widely used in real applications due to their rich spectral information. However, the large volume brings a lot of inconvenience, such as storage and transmission. Hyperspectral band selection is an important technique to cope with this issue by selecting a few spectral bands to replace the original image. This article proposes a novel band selection algorithm that first estimates the redundancy through analysing relationships among spectral bands. After that, spectral bands are ranked according to their relative importance. Subsequently, in order to remove redundant spectral bands and preserve the original information, a maximal linearly independent subset is constructed as the optimal band combination. Contributions of this article are listed as follows: (1) A new strategy for band selection is proposed to preserve the original information mostly; (2) A non-negative low-rank representation algorithm is developed to discover intrinsic relationships among spectral bands; (3) A smart strategy is put forward to adaptively determine the optimal combination of spectral bands. To verify the effectiveness, experiments have been conducted on both hyperspectral unmixing and classification. For unmixing, the proposed algorithm decreases the average root mean square errors (RMSEs) by 0.05, 0.03, and 0.05 for the Urban, Cuprite, and Indian Pines data sets, respectively. With regard to classification, our algorithm achieves the overall accuracies of 77.07% and 89.19% for the Indian Pines and Pavia University data sets, respectively. These results are close to the performance with original images. Thus, comparative experiments not only illustrate the superiority of the proposed algorithm, but also prove the validity of band selection on hyperspectral image processing.     

Phase correlation based redundancy removal in feature weighting band selection for hyperspectral images

Feature weighting based band selection provides a computationally undemanding approach to reduce the number of hyperspectral bands in order to decrease the computational requirements for processing large hyperspectral data sets. In a recent feature weighting based band selection method, a pair‐wise separability criterion and matrix coefficients analysis are used to assign weights to original bands, after which bands identified to be redundant using cross correlation are removed, as it is noted that feature weighting itself does not consider spectral correlation. In the present work, it is proposed to use phase correlation instead of conventional cross correlation to remove redundant bands in the last step of feature weighting based hyperspectral band selection. Support Vector Machine (SVM) based classification of hyperspectral data with a reduced number of bands is used to evaluate the classification accuracy obtained with the proposed approach, and it is shown that feature weighting band selection with the proposed phase correlation based redundant band removal method provides increased classification accuracy compared to feature weighting band selection with conventional cross correlation based redundant band removal.     

Selection of informative hyperspectral band subsets based on entropy and correlation

ABSTRACT

The article proposes two novel and relatively simple unsupervised procedures for the selection of informative small subsets of spectral bands in hyperspectral images. To ensure the informativeness of the subsets, bands featuring higher entropy are included. The correlation of band images is restricted to avoid redundancy of the subsets. The entropy multiple correlation ratio procedure employs the entropy-correlation ratio for the selection of spectral bands. The entropy-based correlated band grouping (ECBG) procedure divides the spectrum into groups of bands featuring highly correlated images. The subsets obtained were characterized by the performance of classifiers using only data from included bands. The ECBG procedure provided better results than the alternatives if the number of selected bands was low. Another advantage of this procedure is the possibility of averaging the images obtained for spectral bands within the groups found. It is shown that classification results are significantly improved if such an averaging is used. In the data acquisition practice, it can be used for a purposeful merging of spectral bands in the configuration of hyperspectral imagers, which allows one to reduce the amount of data to be saved in real time and thus helps one to improve the achievable spatial resolution.     

A semi-supervised spatially aware wrapper method for hyperspectral band selection

Band selection is widely used to identify relevant bands for land-cover classification of hyperspectral images. The combination of spectral and spatial information can improve the classification performance of hyperspectral images dramatically. Similarly, the fusion of spectral–spatial information should also improve the performance of band selection. In this article, two semi-supervised wrapper-based spectral–spatial band selection algorithms are proposed. The local spatial smoothness of hyperspectral imagery is used to improve the performance of band selection when limited labelled samples available. With superpixel segmentation, the first algorithm uses the statistical characteristics of classification map to predict the classification quality of all samples. Based on the Markov random field model, the second algorithm incorporates the spatial information by the minimization of spectral–spatial energy function. Four widely used real hyperspectral data sets are used to demonstrate the effectiveness of the proposed methods, when compared to cross-validation-based wrapper method, the accuracy is improved by 2% for different data sets.     

Gray Wolf Optimizer for hyperspectral band selection

In this paper, we propose a new optimization-based framework to reduce the dimensionality of hyperspectral images. One of the most problems in hyperspectral image classification is the Hughes phenomenon caused by the irrelevant spectral bands and the high correlation between the adjacent bands. The problematic is how to find the relevant bands to classify the pixels of hyperspectral image without reducing the classification accuracy rate. We propose to reformulate the problem of band selection as a combinatorial problem by modeling an objective function based on class separability measures and the accuracy rate. We use the Gray Wolf Optimizer, which is a new meta-heuristic algorithm more efficient than Practical Swarm Optimization, Gravitational Search Algorithm, Differential Evolution, Evolutionary Programming and Evolution Strategy. The experimentations are performed on three widely used benchmark hyperspectral datasets. Comparisons with the state-of-the-art approaches are also conducted. The analysis of the results proves that the proposed approach can effectively investigate the spectral band selection problem and provides a high classification accuracy rate by using a few samples for training.