Feature Selection Combining Information Theory View and Algebraic View in the Neighborhood Decision System

Feature selection is one of the core contents of rough set theory and application. Since the reduction ability and classification performance of many feature selection algorithms based on rough set theory and its extensions are not ideal, this paper proposes a feature selection algorithm that combines the information theory view and algebraic view in the neighborhood decision system. First, the neighborhood relationship in the neighborhood rough set model is used to retain the classification information of continuous data, to study some uncertainty measures of neighborhood information entropy. Second, to fully reflect the decision ability and classification performance of the neighborhood system, the neighborhood credibility and neighborhood coverage are defined and introduced into the neighborhood joint entropy. Third, a feature selection algorithm based on neighborhood joint entropy is designed, which improves the disadvantage that most feature selection algorithms only consider information theory definition or algebraic definition. Finally, experiments and statistical analyses on nine data sets prove that the algorithm can effectively select the optimal feature subset, and the selection result can maintain or improve the classification performance of the data set.     

A Multi-Objective Multi-Label Feature Selection Algorithm Based on Shapley Value

Multi-label learning is dedicated to learning functions so that each sample is labeled with a true label set. With the increase of data knowledge, the feature dimensionality is increasing. However, high-dimensional information may contain noisy data, making the process of multi-label learning difficult. Feature selection is a technical approach that can effectively reduce the data dimension. In the study of feature selection, the multi-objective optimization algorithm has shown an excellent global optimization performance. The Pareto relationship can handle contradictory objectives in the multi-objective problem well. Therefore, a Shapley value-fused feature selection algorithm for multi-label learning (SHAPFS-ML) is proposed. The method takes multi-label criteria as the optimization objectives and the proposed crossover and mutation operators based on Shapley value are conducive to identifying relevant, redundant and irrelevant features. The comparison of experimental results on real-world datasets reveals that SHAPFS-ML is an effective feature selection method for multi-label classification, which can reduce the classification algorithm’s computational complexity and improve the classification accuracy.     

水下噪声音色属性回归模型及其在目标识别中的应用

通过对声音的主观评价与客观分析而建立的主观感受数学模型,在许多领域都有重要的应用. 本文采用多元线性回归分析手段对水下噪声音色属性建立回归模型,提取音色特征并改善水下目标的识别效果. 首先,在前期水下噪声音色属性主观评价实验的基础上,将构成音色属性空间的5个成分的评价分值作为回归分析中的因变量,提取大量与听觉感知相关的听觉特征作为自变量;然后,通过相关分析和改进的逐步筛选法,挑选出反映音色属性的“最优”自变量子集;最后,利用向后剔除回归分析和水下目标识别实验,确定适当的音色模型,并通过假设检验证明该线性模型不仅正确有效,而且能改善水下目标识别效果.     

水下噪声音色属性回归模型及其在目标识别中的应用

通过对声音的主观评价与客观分析而建立的主观感受数学模型,在许多领域都有重要的应用. 本文采用多元线性回归分析手段对水下噪声音色属性建立回归模型,提取音色特征并改善水下目标的识别效果. 首先,在前期水下噪声音色属性主观评价实验的基础上,将构成音色属性空间的5个成分的评价分值作为回归分析中的因变量,提取大量与听觉感知相关的听觉特征作为自变量;然后,通过相关分析和改进的逐步筛选法,挑选出反映音色属性的“最优”自变量子集;最后,利用向后剔除回归分析和水下目标识别实验,确定适当的音色模型,并通过假设检验证明该线性模型不仅正确有效,而且能改善水下目标识别效果. 关键词： 音色 多元线性回归 主观评价     

Spatially aggregated multiclass pattern classification in functional MRI using optimally selected functional brain areas

In previous works, boosting aggregation of classifier outputs from discrete brain areas has been demonstrated to reduce dimensionality and improve the robustness and accuracy of functional magnetic resonance imaging (fMRI) classification. However, dimensionality reduction and classification of mixed activation patterns of multiple classes remain challenging. In the present study, the goals were (a) to reduce dimensionality by combining feature reduction at the voxel level and backward elimination of optimally aggregated classifiers at the region level, (b) to compare region selection for spatially aggregated classification using boosting and partial least squares regression methods and (c) to resolve mixed activation patterns using probabilistic prediction of individual tasks. Brain activation maps from interleaved visual, motor, auditory and cognitive tasks were segmented into 144 functional regions. Feature selection reduced the number of feature voxels by more than 50%, leaving 95 regions. The two aggregation approaches further reduced the number of regions to 30, resulting in more than 75% reduction of classification time and misclassification rates of less than 3%. Boosting and partial least squares (PLS) were compared to select the most discriminative and the most task correlated regions, respectively. Successful task prediction in mixed activation patterns was feasible within the first block of task activation in real-time fMRI experiments. This methodology is suitable for sparsifying activation patterns in real-time fMRI and for neurofeedback from distributed networks of brain activation.     

Development of a noise sources classification system based on new method for feature selection

Feature selection of noise sources is important for noise sources detection and classification. In this paper, a new rough set based feature selection method has been given. Based on the method, a noise sources automatic classification system (NSACS) has been designed and validated. The key idea of the method is that most effective features can distinguish the most number of samples belonging to different classes of noise sources, if they are used for classification. This new approach has been applied into the system NSACS to select relevant features for artificial datasets and real-world datasets and the results have shown that this approach can correctly select all the relevant features of artificial datasets and at the same time it can drastically reduce the number of features. From the experiments, it can be found that to consider all the five datasets, the number of classification features after selection drops to 35% and the accurate classification rate increases about 14%. For the underwater noise sources dataset the number of features drops to 1/5 and the accurate classification rate increases about 6% after feature selection.     

基于优选样本的KPCA高光谱图像降维方法

 降维是高光谱图像常用的预处理手段,而核主成份分析通过非线性映射能够挖掘数据的高阶统计特性,是目前较常使用的特征提取方法.本文提出了一种基于优选样本的核主成份分析高光谱图像降维方法,算法挑选参与核主成份分析运算的样本时兼顾整幅高光谱图像的统计特性,以与全图能量分布相近的最小样本集为最终选择样本.本算法由IDL7.0实现,并在实际高光谱图像Cuprite上进行实验.结果表明,在大幅缩短运算时间的同时,降维效果优于传统的核主成份分析方法.     

Detection of Coronary Artery Disease Using Multi-Domain Feature Fusion of Multi-Channel Heart Sound Signals

Heart sound signals reflect valuable information about heart condition. Previous studies have suggested that the information contained in single-channel heart sound signals can be used to detect coronary artery disease (CAD). But accuracy based on single-channel heart sound signal is not satisfactory. This paper proposed a method based on multi-domain feature fusion of multi-channel heart sound signals, in which entropy features and cross entropy features are also included. A total of 36 subjects enrolled in the data collection, including 21 CAD patients and 15 non-CAD subjects. For each subject, five-channel heart sound signals were recorded synchronously for 5 min. After data segmentation and quality evaluation, 553 samples were left in the CAD group and 438 samples in the non-CAD group. The time-domain, frequency-domain, entropy, and cross entropy features were extracted. After feature selection, the optimal feature set was fed into the support vector machine for classification. The results showed that from single-channel to multi-channel, the classification accuracy has increased from 78.75% to 86.70%. After adding entropy features and cross entropy features, the classification accuracy continued to increase to 90.92%. The study indicated that the method based on multi-domain feature fusion of multi-channel heart sound signals could provide more information for CAD detection, and entropy features and cross entropy features played an important role in it.     

对比变分自编码器的近红外光谱测量及其在液态样品检测中的应用

近红外光谱是热门的食品检测方法之一,对于这种高维光谱数据的分析常常需采用数据降维算法提取其中的特征,然而绝大多数算法都只能针对单个数据集进行分析。虽然已有基于对比学习的对比主成分分析成功应用于不同水果表面农残的近红外光谱检测中,但是该方法只能以线性的方式组合原有特征,特征提取效果存在局限性,并且需要调节对比参数来控制背景集影响,需要消耗更大的时间成本。cVAE（contrastive variational autoencoder）是一种基于对比学习和变分自编码器的改进算法,被用于图像去噪和RNA序列分析中,它仍然具备分析多个数据集的特点,同时因为组合了神经网络的概率生成模型而具备了提取非线性隐含特征的能力。将cVAE算法应用于近红外光谱分析,建立了准确的近红外光谱数据降维模型。在实际验证中,使用cVAE算法对购买的不同品牌和批次纯牛奶中掺假三聚氰胺进行检测。结果表明,使用VAE算法只能区分出不同品牌和批次的纯牛奶,而其中是否掺假三聚氰胺这一重要信息无法表现出来;而使用cVAE算法进行数据分析时,由于添加了背景数据集分离了无关变量,能够清晰的将有无掺假三聚氰胺的样本分类。这说明了,cVAE不仅具备了cPCA（contrastive principle component analysis）在近红外光谱数据降维中的优势,而且具备提取非线性特征的能力,同时不需要调节可变参数,能够更方便地建立近红外光谱降维模型。     

基于正交投影散度的高光谱遥感波段选择算法

由于高光谱数据的海量高维特征,对其进行降维处理成为高光谱遥感研究的一个重要问题.波段选择算法由于能够有效地保留原始数据的信息,在高光谱数据降维及后续的遥感识别与分类等方面具有明显的优越性.文章提出了一种基于正交投影散度(OPD)的波段选择方法,该方法继承了正交子空间投影(OSP)算法的特点,通过把原始数据投影到特征空间...     

高光谱技术融合图像信息的牛肉品种识别方法研究

高光谱图像包含了大量的光谱信息和图像信息,采用高光谱成像技术对牛肉品种进行识别。获取可见-近红外(400~1000 nm)光谱范围内的安格斯牛、利木赞牛、秦川牛、西门塔尔牛、荷斯坦奶牛五个品种共252个牛肉样本的高光谱图像。在ENVI软件中对高光谱图像进行阈值分割并构建掩膜图像,获取样本的感兴趣区域(ROI),并结合伪彩色图对牛肉样本的反射率指数进行可视化表达;采用Kennard-Stone(KS)法对样本集进行划分以提高模型的预测性能;对原始光谱采用卷积平滑(SG)、区域归一化(Area normalize)、基线校正(Baseline)、一阶导数(FD)、标准正态变量变换(SNV)及多元散射校正(MSC)等6种方法进行预处理;采用竞争性自适应重加权算法(CARS)提取特征波长。然后利用颜色矩对不同牛肉样本的颜色特征进行提取;对原始光谱图像进行主成分分析,结合灰度共生矩阵(GLCM)算法,提取主要纹理特征。最后结合偏最小二乘判别(PLS-DA)算法建立牛肉样本基于特征波长、颜色特征以及纹理特征的识别模型。KS法将牛肉样本划分为校正集190个,预测集62个;将未经预处理的光谱数据与经过6种不用预处理的光谱数据进行建模分析,结果发现经FD法处理后的光谱数据所建模型的识别率最高;结合CARS法对经FD法预处理后的光谱数据进行特征波长提取,共提取出22个波长;利用颜色矩和GLCM算法分别提取出每个牛肉样本的9个颜色特征、48个纹理特征。将特征波长数据与颜色、纹理特征信息进行融合建模,结果表明,基于特征光谱+纹理特征的模型识别效果最佳,其校正集与预测集识别率分别为98.42%和93.55%,均高于特征光谱数据模型识别率,说明融合纹理特征后使样本分类信息的表达更加全面;融合颜色特征后模型的校正集识别率均有所增加,但预测集识别率稍逊,颜色特征虽携带了部分有效信息,但这些信息与牛肉样本的相关性不大。因此,寻找与牛肉样本相关性更大的颜色特征是提高模型识别率的重要途径之一。该研究结果为牛肉品种的快速无损识别提供了一定的参考。     

A non-rigid cardiac image registration method based on an optical flow model

According to non-rigid medical image registration, new method of classification registration is proposed. First, Feature points are extracted based on SIFT (Scale Invariant Feature Transform) from reference images and floating images to match feature points. And the coarse registration is performed using the least square method. Then the precise registration is achieved using the optical flow model algorithm. SIFT algorithm is based on local image features that are with good scale, rotation and illumination invariance. Optical flow algorithm does not extract features and use the image gray information directly, and its registration speed is faster. The both algorithms are complementary. SIFT algorithm is used for improving the convergence speed of optical flow algorithm, and optical flow algorithm makes the registration result more accurate. The experimental results prove that the algorithm can improve the accuracy of the non-rigid medical image registration and enhance the convergence speed. Therefore, the algorithm has some advantages in the image registration.     

基于蚁群-遗传算法的光谱选择方法与应用

脂肪作为牛奶中的重要营养成分,是评价牛奶质量的一项重要指标。高光谱图像技术能够提供几十到数千波长的数据,能够反映牛奶中不同组成成分细微的光谱差异;另一方面,相邻波段之间往往具有很强的相关性,不仅增加了计算量,而且容易造成维数灾难等问题,因此对高光谱数据进行波段选择非常重要。工作中提出了PLS-ACO特征波段选择方法,并与遗传算法结合,组合成了PLS-ACO-GA的特征波段选择新方法。提出的两种方法以蚁群算法为基础,PLS回归模型回归系数的绝对值作为评价波长重要性的主要依据,以此作为蚁群算法的启发式信息,利用蚁群算法进行智能搜索,结合遗传算法,产生更多优秀的特征波段组合,避免PLS-ACO算法得到的只是局部最优解,得到的最优波段组合能够更好的反映牛奶中脂肪成分的信息;通过计算波长贡献率,筛选出最优波段组合,并与遗传算法,CARS算法和基本蚁群算法光谱特征选择方法比较,最后比较不同特征选择方法下的PLS回归模型预测效果。PLS-ACO, PLS-ACO-GA, CARS, GA和ACO分别筛选了牛奶样品光谱中的18,16,40,43和42个特征波段。其中PLS-ACO-GA筛选波段后的PLS预测模型效果最好,预测集R2_p和RMSEP分别为0.997 6和0.062 2,PLS-ACO次之,预测集R2_p和RMSEP分别为0.997 0和0.077 8。PLS-ACO和PLS-ACO-GA不仅减少了特征波段数量,而且提高了模型的精度。对PLS-ACO-GA进行特征波段选择后的数据,建立MLR,RFR和PLS回归预测模型。MLR预测模型的R2_p和RMSEP分别为0.997 6和0.062 3。RFR回归模型R2_p和RMSEP分别为0.999 9和0.003 0,PLS回归模型的R2_p和RMSEP分别为0.997 6和0.062 2。RFR模型在三种回归预测模型中表现最好。研究结果表明PLS-ACO和PLS-ACO-GA这两种方法可以实现光谱数据特征波段选择,高光谱技术可以实现牛奶中脂肪含量的检测,为牛奶脂肪含量检测提供了一种新的、快速无损的方法。     

基于数据融合的风电机组噪声预测

根据风电机组噪声信号检测复杂的情况,研究风电机组非声学参数的信息熵特征,对机组噪声进行多源数据融合预测。分析基于信息熵的非声学参数的特征提取方法,并对传统的基于遗传算法的支持向量机回归(GA-SVR)的缺陷提出改进,结合实际应用的非声学参数的信息熵特点平衡遗传算法(GA)的终止条件。通过统计分析完成了输入变量的筛选,去除了对预测影响较大的共线性因素,并实现了输入降维提高预测精度和速率。最后应用数据的信息熵特征,训练改进的GA-SVR建立最终的多源数据特征级融合预测模型。通过对比表明基于多源数据融合的预测方法精度最高,预测结果的相对误差平均值为0.7757%,具有实际可行性。     

基于改进的FAST-SURF快速图像拼接算法

针对SURF（speeded-up robust features）算法计算量大、图像拼接效率低的不足,以FAST （features from accelerated segment test）角点取代SURF斑点在图像重合区域提取特征点,使用SURF描述子进行特征点描述,通过描述子降维、自适应最近邻与次近邻比值法、几何约束法剔除错误匹配点,提高匹配的准确性。匹配完成后,通过减少样本集的个数和舍弃不合理参数模型来改进RANSAC（random sample consensus）方法,获取单应性矩阵,最后进行图像变换、融合和拼接。实验结果显示,该图像拼接算法与传统的SURF算法相比,图像拼接总时间减少了12%,拼接效率得到了显著提高。     

基于BLCD分解与ACO-DBN网络的光纤振动信号识别

针对光纤振动信号受噪声干扰严重、特征提取单一和识别时间长的问题,提出了改进的局部特征尺度分解和蚁群算法优化深度置信网络的识别方法。首先,采用三次B样条函数插值拟合均值曲线改进局部特征尺度分解算法,并对原始信号进行分解得到一系列内禀尺度分量之和。其次,利用峭度因子和能谱系数构成融合指标筛选有效分量。然后,分别提取有效分量在时域、频域和时-频域的熵值特征进行融合并降维。最后,将综合特征向量馈入蚁群优化后的深度置信网络进行训练和识别,提高算法效率和识别率。采用实测数据进行实验验证,结果表明,信噪比平均提升8 dB,信号平均识别率可达95.83%,平均识别时间为0.715 s。     

FASTENER Feature Selection for Inference from Earth Observation Data

In this paper, a novel feature selection algorithm for inference from high-dimensional data (FASTENER) is presented. With its multi-objective approach, the algorithm tries to maximize the accuracy of a machine learning algorithm with as few features as possible. The algorithm exploits entropy-based measures, such as mutual information in the crossover phase of the iterative genetic approach. FASTENER converges to a (near) optimal subset of features faster than other multi-objective wrapper methods, such as POSS, DT-forward and FS-SDS, and achieves better classification accuracy than similarity and information theory-based methods currently utilized in earth observation scenarios. The approach was primarily evaluated using the earth observation data set for land-cover classification from ESA’s Sentinel-2 mission, the digital elevation model and the ground truth data of the Land Parcel Identification System from Slovenia. For land cover classification, the algorithm gives state-of-the-art results. Additionally, FASTENER was tested on open feature selection data sets and compared to the state-of-the-art methods. With fewer model evaluations, the algorithm yields comparable results to DT-forward and is superior to FS-SDS. FASTENER can be used in any supervised machine learning scenario.