An adaptive heuristic for feature selection based on complementarity

Feature selection is a dimensionality reduction technique that helps to improve data visualization, simplify learning, and enhance the efficiency of learning algorithms. The existing redundancy-based approach, which relies on relevance and redundancy criteria, does not account for feature complementarity. Complementarity implies information synergy, in which additional class information becomes available due to feature interaction. We propose a novel filter-based approach to feature selection that explicitly characterizes and uses feature complementarity in the search process. Using theories from multi-objective optimization, the proposed heuristic penalizes redundancy and rewards complementarity, thus improving over the redundancy-based approach that penalizes all feature dependencies. Our proposed heuristic uses an adaptive cost function that uses redundancy–complementarity ratio to automatically update the trade-off rule between relevance, redundancy, and complementarity. We show that this adaptive approach outperforms many existing feature selection methods using benchmark datasets.     

基于自适应显著特征选择的动态加权平均行人识别模型

在跨场景行人识别过程中,为了解决多种特征以一个固定的权重融合导致行人识别率低、识别速度慢的问题,提出基于自适应特征选择的动态加权平均排名行人识别方法。首先,将GrabCut算法和基于流形排序显著性检测算法相融合,提高行人外观特征提取的准确性;然后,提出自适应显著特征选择方法,有效地提取行人特征描述;最后,通过动态加权平均排名模型将多特征融合。实验表明,所提出的方法提高了行人识别的准确性,同时对姿态的变化具有较好的鲁棒性。     

Driver identification based on hidden feature extraction by using adaptive nonnegativity-constrained autoencoder

In this paper, we propose a new driver identification method using deep learning. Existing driver identification methods have the disadvantages that the size of the sliding time window is too large and the feature extraction is relatively subjective, which leads to low identification accuracy and long prediction time. We first propose using an unsupervised three-layer nonnegativity-constrained autoencoder to adaptive search the optimal size of the sliding window, then construct a deep nonnegativity-constrained autoencoder network to automatically extract hidden features of driving behavior to further complete driver identification. The results from the public driving behavior dataset indicate that relative to conventional sparse autoencoder, dropout-autoencoder, random tree, and random forest algorithms, our method can effectively search the optimal size of the sliding time window, and the window size is shortened from the traditional 60s to 30s, which can better preserve the intrinsic information of the data while greatly reducing the data volume. Furthermore, our method can extract more distinctive hidden features that aid the classifier to map out the separating boundaries among the classes more easily. Finally, our method can significantly shorten the prediction time and improve the timeliness under the premise of improving the driver identification performance and reducing the model overfitting.     

An adaptive feature fusion framework for multi-class classification based on SVM

An adaptive feature fusion framework is proposed for multi-class classification based on SVM. In a similar manner of one-versus-all (OVA), one of the multi-class SVM schemes, the proposed approach decomposes a multi-class classification into several binary classifications. The main difference lies in that each classifier is created with the most suitable feature vectors to discriminate one class from all the other classes. The feature vectors of the unknown samples are selected by each classifier adaptively such that recognition is fulfilled accordingly. In addition, novel evaluation criterions are defined to deal with the frequent small-number sample problems. A writer recognition experiment is carried out to accomplish this framework with three kinds of feature vectors: texture, structure and morphological features. Finally, the performance of the proposed approach is illustrated as compared with the OVA by applying the same feature vectors for all classes.     

一种基于图像特征的去噪方法

J.Weickert的各向异性扩散模型利用梯度进行扩散,而梯度的局部化性质不能反映图像的震荡性等特征。给出了两种构造扩散方向的方法——Hessian矩阵方法（利用高阶微分）和Gabor变换方法（利用频域分析）,它们在对图像进行平滑处理的同时能够检测到图像的震荡等特征,从而克服了J.Weickert模型的不足。实验表明：改进后的方法在消除噪声的同时较好地保持了图像的细节特征,得到了较为满意的结果。     

基于KICA-KFDA的集成故障识别算法

针对复杂的化工过程,提高过程监控能力,提出基于核独立成分分析（kernel independent component analysis,KICA）和核Fisher判别分析（kernel fisher discriminant analysis,KFDA）的过程监测与故障识别方法。通过利用核独立成分分析建立正常工况模型,得到检测故障信息。在发生故障的情况下,利用Fisher判别分析方法在高维的特征空间的特点和优势,可求出满足最大分离程度的核Fisher判别向量和特征向量,根据当前故障的判别向量和历史故障数据集中所含故障的最优核Fisher判别向量的相似度进行故障识别。仿真结果验证了所提方法的有效性。     

英文字母特征的双面碎纸拼接

目的 结合图像处理技术和英文字母特征,提出一种基于聚类和全局优化的双面碎纸拼接复原算法.方法 利用图像处理技术,消除同行字母的处于不同高度部分.再分别基于处理前后的碎纸片,分别提出碎片与行之间匹配程度以及刻画相邻碎片两两匹配的特征参数(像素差与相关系数).利用上述两特征参数,将问题转化为两个子优化问题:子问题1,基于像素差的最大值最小目标,建立全局最优聚类模型,确定所有碎片的行分类;子问题2,将同一行中相邻碎片的匹配问题转化为旅行商问题(TSP),并基于相关系数对每一行建立全局优化模型.结果 仿真实验结果表明,图像处理技术能有效地消除同行字母处于不同高度的负影响.同时,获取的两个特征参数能很好地刻画碎片之间的匹配,复原准确率达到90％以上.结论 实验结果表明,该算法能保证高复原率且降低复杂度,对碎纸机碎纸拼接复原具有良好的实际意义.     

基于自适应特征选取的步态识别

提出基于自适应特征选取的步态识别方法。采用新的特征提取方法,该方法将目标按人体结构特点划分为多个子区域,利用各个子区域的质心与头部质心的距离和夹角对步态特征进行描述。采用Boosting算法自适应选取最优特征序列,对识别结果进行加权处理。该方法结合了步态的动态和静态信息,实验结果表明该方法具有较高的识别性能。     

基于自适应特征融合的人脸识别

针对单一人脸特征在人脸识别中的局限性问题和二维主成分分析人脸特征缺少判别信息的问题,利用互补思想,提出了一种改进的二维主成分分析与二维线性鉴别分析加权融合的人脸识别算法。利用离散余弦变换对原始人脸图像进行压缩并重建,以滤除图像中人眼并不敏感的中高频部分,再利用二维主成分分析方法进行人脸特征的提取;运用二维线性鉴别分析方法提取原始人脸图像中具有鉴别性的人脸特征;最后,提出一种自适应的权值选取方法,将两种人脸特征进行加权融合以实现分类识别。在ORL和Yale人脸数据库上的实验结果证明了该方法的有效性。     

基于自适应特征融合的压缩感知跟踪算法

针对运动目标外观或背景变化较大时,采用基于压缩感知的跟踪算法由于特征单一易导致漂移、跟踪不稳定甚至丢失目标等问题,提出了改进的基于自适应特征融合的压缩感知跟踪算法。该算法采用两种随机测量矩阵,分别投影V、H空间得到压缩后的纹理和颜色特征,利用在线计算的特征可靠性相对程度来自适应调整特征加权系数,充分利用两类特征的互补性来增强跟踪稳定性。对不同视频的测试结果表明,提出的方法在目标外观、背景环境变化时仍能准确跟踪目标,在目标大小为70像素×100像素时平均帧率为22帧/s,达到实时性。与提取单一特征的原压缩感知算法相比,改进后的方法在目标外观和背景变化时具有更强的鲁棒性。     

An adaptive boosting algorithm based on weighted feature selection and category classification confidence

Applied Intelligence - Adaptive boosting (Adaboost) is a typical ensemble learning algorithm, which has been studied and widely used in classification tasks. Traditional Adaboost algorithms ignore...     

基于自适应相似性的无监督多视图特征选择

为解决传统特征选择方法忽略视图内部特征的相关性及不同视图之间的特征关联性问题,提出一种基于自适应相似性的特征选择学习方法.在特征选择时考虑视图内部的特征相关性,对每个视图进行特征选择,通过引入图正则化,充分利用数据的局部几何特性,使同类别特征之间的联系更加紧密,达到增强算法的鲁棒性.引入L1/2稀疏范数降低噪声,提高分类模型的准确率.通过与现有的特征方法进行对比分析,提出方法在ACC和NMI上优于其它方法.     

基于注意力和卷积特征重排的图像修复

近年来,基于UNet与GAN（生成对抗网络）的深度学习网络模型在图像修复领域展现出了独特的优势,但是修复结果中仍然存在伪影、模糊、纹理细节退化、对于大面积破损难以修复、修复后的孔洞与背景图像不相容等现象。为了解决现有模型对大面积破损图像修复不友好以及修复后的图像存在退化现象等问题,通过对现有方法进行研究,改进了Shift-UNet（移位网络）模型：在UNet与GAN的基础上,在每一层编码器和解码器之间增加了改进之后的注意力机制Attention-UNet并融入shift-UNet,形成Attention-Shift-UNet;并且通过研究,将原来下采样部分的激活函数由Leaky_ReLU改为了SiLU函数。改进模型不仅在64×64的中心遮罩上取得了较好的效果,还实现了随机遮罩,遮罩面积由20%增加到80%。通过实验结果证明,该模型的修复效果更优,特别是针对大面积破损图像的修复。在CelebA、ParisArchitecture以及Paris Streetview数据集上经过测试,各评价指标都有明显的提高,其中结构相似性（SSIM）由原来的0.944 5提高到0.947 1,峰值信噪比（PSNR）由原来的27.992 7提高到28.553 6,L2损失由原来的0.001 7降低到0.001 5。     

An integrated methodology for fixture design

In this paper, a methodology to perform fixture design as an integrated aspect of process planning is proposed. A three-phase methodology for the fixture design activity has been developed. The three phases include predesign analysis (phase I), functional analysis (phase II), and productivity improvement (phase III). In phase I, the product design information is studied, and initial fixture design aspects are developed. In phase II, the clamping and location aspects of fixture design are addressed for the given initial process sequence and product design information. Phase III involves studying ways to increase the productivity including using simultaneous machining approaches, multiclustering, use of specialized jigs, etc.     

基于特征融合的维吾尔文笔迹鉴别

针对采用纹理方法鉴别维吾尔文不稳定的问题,提出一种与文本无关、特征融合的笔迹鉴别方法,融合的特征包括网格窗口微结构特征和笔迹曲向特征。所提方法从笔迹原始图像提取笔画边缘,对笔迹的边缘图像建立大量局部窗口模型,通过扫描边缘图像获取融合特征结构的概率密度分布,使用多种距离公式计算概率密度向量间的距离。在实验笔迹容量大小为80的笔迹库上进行实验得到的鉴别率为89.2%。所提方法能很好地刻画笔迹的局部书写变化趋势和笔画的曲向,采用概率密度分布来统计笔迹的网格窗口微结构特征和曲向特征,鉴别效果达到了预期值。     

Frequency-domain identification: An algorithm based on an adaptive rational orthogonal system

This paper presents a new adaptive algorithm for frequency-domain identification. The algorithm is related to the rational orthogonal system (Takenaka–Malmquist system). This work is based on an adaptive decomposition algorithm previously proposed for decomposing the Hardy space functions, in which a greedy sequence is obtained according to the maximal selection criterion. We modify the algorithm through necessary changes for system identification.     

基于自适应规整化方法的图像超分辨率重建

以Gauss-Gibbs随机场模型为图像的先验概率模型,运用自适应规整化的最大后验概率(MAP)方法进行图像超分辨率重建.通过对先验概率分布参数的估计,对图像超分辨率重建求解进行自适应规整化,从而提高重建图像的质量.实验结果表明,该算法能较好地再现图像的各种边缘信息,重建的高分辨率图像在峰值信噪比和视觉效果方面都得到明显提高.     

基于自适应图学习的多目标特征选择算法

针对多目标回归中的特征选择问题,提出一种基于自适应图学习的多目标特征选择算法,在单个框架中同时考虑3种关系结构:输入特征与目标输出、不同目标输出以及样本间的相关结构,并基于上述结构信息进行特征选择.首先,在传统稀疏回归模型中对系数矩阵施加低秩约束,利用低秩学习对特征间相关性以及目标间的依赖关系进行解耦学习;然后,构建基于样本局部结构信息的自适应图学习项,充分利用样本间的相似结构进行特征选择;进一步地,引入基于输出相关性的结构矩阵优化项,使模型能够更加充分地考虑目标间的相关性;最后,提出一种交替优化算法求解目标函数,并从理论上证明算法的收敛性.在公开数据集上的实验表明,所提方法相较于现有主流的多目标特征选择方法具有更好的性能和适用性.