基于局部人脸图像的ICA人脸识别方法

提出了一种基于局部人脸图像独立分量分析的特征提取方法.该方法将人脸图像分成若干个相等的部分,将分成的局部人脸图像矩阵作为训练样本,并先后从水平方向,垂直方向提取训练样本的独立分量.相较于传统的独立分量分析(ICA)方法,该方法具有如下优点:有效解决了传统ICA在进行特征抽取过程中的高维小样本问题;将局部人脸图像作为训练样本,这不仅增加了训练样本数,而且有利于提取人脸局部特征;依次从训练样本的水平方向、垂直方向提取训练样本特征,使得提取的特征不仅维数更小,而且能更有效地反映样本的局部信息.以上优点使得提出的算法较传统方法在人脸识别方面更稳定,识别率更高,在Yale人脸库和AR人脸库上验证了该算法的有效性.     

基于Adaboost算法的人脸检测实现

人脸检测是指把人脸从一幅静止的图像或者动态视频中检测出来,并且指出人脸在图像或视频中的大小和位置.目前存在着大量的人脸检测算法,其中Adaboost算法是比较实用的人脸检测算法.Adaboost算法中人脸的特征采用的是矩形特征,在大量的样本集中,提取样本的矩形特征进行训练,生成多个弱分类器,然后合并多个弱分类器形成一个...     

基于图像扩散速度模型和纹理信息的人脸活体检测

为了解决人脸身份认证中的欺诈问题,提出了一种基于图像扩散速度模型和纹理信息的人脸活体检测算法。真实人脸和虚假人脸图像的空间结构不同,为了提取这种差异特征,该方法使用各向异性扩散增强图像的边缘信息。然后,将原始图像与扩散后图像的差值作为图像的扩散速度,并构建扩散速度模型。接着使用局部二值算法提取图像扩散速度特征并训练分类器。真实人脸图像和虚假人脸图像之间存在很多差异特征,为了进一步提高人脸活体检测算法的泛化能力,该方法同时提取人脸图像的模糊程度特征和色彩纹理特征,通过特征矩阵级联的方法将两种特征进行融合,并训练另一个分类器。最后根据分类器输出概率加权融合的结果做出判决。实验结果表明,该算法能够快速有效地检测出虚假的人脸图像。     

基于广义霍夫变换的室外场景行人检测研究

提出一种基于广义霍夫变换的室外场景行人检测方法.首先从少量标注图片中随机地提取行人图像碎片构造碎片字典,然后使用图像碎片对每一幅训练图片计算特征向量.为了能够在静态图片中快速地检测行人,使用Gentleboost算法训练检测器,在每一次迭代时学习一个决策树桩弱分类器,该弱分类器可以从高维特征向量中选择一个当前区分度最好的碎片特征.在运行检测器时,所有的弱分类器在测试图片中对于行人的可能出现位置进行投票.最后,将各个弱分类器的投票结果进行叠加,并用设定的检测阈值剔除得分较低的检测结果后得到检测输出.在LabelMe数据集上的实验表明,该方法可以快速地在静态图片中检测出行人,需要较少的训练数据且有效地解决了部分遮挡问题.     

基于Adaboost和最小割算法的视频人脸检测

Adaboost算法是一种被广泛应用于人脸检测的分类器学习方法,通过Haar-like特征和样本的学习和训练,形成一个强分类器,能有效地区分人脸跟非人脸.文中提出一种Adaboost结合最小割算法的人脸提取方法,该方法着眼于图像中的轮廓及肤色信息,对每个点设置一个权值,寻找一条权值最小的边界,准确提取出人脸.实验结果表明,Adaboost和最小割的人脸提取算法,分割效果较好,且耗时较小.     

人脸图像超分辨率的自适应流形学习方法

样本规模与使用方法是基于学习的超分辨率中的一个重要问题.面向人脸图像超分辨率重建,提出一种基于局部保持投影(LPP)的自适应流形学习方法.由于能够揭示隐含在高维图像空间中的非线性结构,LPP是一种可以在局部人脸流形上分析其内在特征的、有效的流形学习方法.通过在LPP特征子空间中动态搜索出与输入图像块最相似的像素块集合作为学习样本,实现了自适应样本选择,并且利用动态样本集合通过基于像素块的特征变换方法有效地恢复出低分辨率人脸图像中缺失的高频成分.实验结果证实:通过在局部人脸流形上自适应地选择学习样本,文中方法可以仅使用相对少量的样本来获得很好的超分辨率重建结果.     

自适应中心对称局部三值模式的人脸识别

针对局部三值模式描述人脸图像纹理特征时直方图维数过高以及阈值不能自适应选取的缺陷,提出一种自适应中心对称局部三值模式方法。首先,用具有降低维数的中心对称局部三值模式算子对人脸图像编码,把邻域像素均值引入编码中以增强抗噪性能;其次,嵌入统计邻域均值与邻域像素的标准差作为阈值以自适应提取人脸特征,并统计特征直方图;最后用卡方距离度量训练样本特征直方图和测试样本特征直方图的相似度,采用最近邻分类器分类识别。所提算法在YALE、Extended Yale B人脸图像库上的最高正确识别率分别达到99.67%,99.33%;识别一张人脸的速度分别达到0.1984和0.3988 s。实验结果表明,所提算法对光照变化和噪声更加鲁棒,有效提高了人脸识别的精度和速度。     

基于独立分量分析的人脸超分辨率重建

提出一种基于独立分量分析(ICA)的人脸超分辨率重建算法。该算法利用ICA从高分辨率训练图像中提取出独立分量,并对ICA系数进行先验估计。对于给定的低分辨率图像,结合最大后验概率估计求出ICA系数,进行ICA反变换得到高分辨率图像的近似估计,并利用局部结构张量对图像进行精化处理得到重建图像。仿真结果表明,该算法在实现人脸超分辨率重建的同时保持了人脸整体结构特征,且对光照、表情、姿态等具有一定的鲁棒性,将重建结果用于人脸辨识,有效提高了辨识效率。     

Adaboost算法及其在实时视频流中的应用

针对Adaboost算法在实时视频流中的应用,本文基于Adaboost算法的人脸检测原理,即通过提取图像中的haar特征,在训练过程中选出最优特征,转换成弱分类器,优化组合于人脸检测.最终,利用opencv的开发包,通过VC++软件编程实现基于Adaboost算法实时视频流中的人脸检测.     

基于统计学习的人脸定位评估函数的构建

Gabor核函数的幅值反映了图像局部的能量,且在真实边缘附近具有良好的光滑性,适宜于匹配识别;AdaBoost算法用于Gabor特征集中选择最优特征.每个特征对应一个弱非类器,集合所有弱分类器组成一个最终分类器.构建了基于上述特征的人脸定位评估函数.实验表明,其对主动外观模型和主动形状模型的人脸定位有很好的评估功能.     

基于STEP的特征模型及重构算法

随着CAX技术的发展,特征技术得到越来越多的重视,特征技术的使用,大幅度提高了产品的设计、制造、集成等过程的效率。目前,基于特征的CAD、CAM系统是市场的主流,CAPP是完全基于特征的应用系统。但是在STEP的众多应用协议中,涉及机械设计、制造、管理的应用协议有很多,但是这些应用协议基本上没有提供对特征的支持。AP224是较早支持特征的STEP应用协议,主     

支持特征的非流形造型数据结构的研究

文章提出了一种新的数据结构,统一的表示了线框、表面和实体三种模型,及非几何特征信息,扩大传统实体造型的覆盖域,并可表示非流形模型。     

一种基于关联性的特征选择算法

目前在文本分类领域较常用到的特征选择算法中,仅仅考虑了特征与类别之间的关联性,而对特征与特征之间的关联性没有予以足够的重视.提出一种新的基于关联分析的特征选择算法,该方法以信息论量度为基本工具,综合考虑了计算代价以及特征评估的客观性等问题.算法在保留类别相关特征的同时识别并摒弃了冗余特征,取得了较好的约简效果.     

基于最大决策边界的局部在线流特征选择

现有的在线流特征选择算法通常选择一个最优的全局特征子集,并假设该子集适用于样本空间的所有区域.但是,样本空间的每个区域都使用独有的特征子集进行准确描述,这些特征子集的特征和大小可能有所不同.因此,文中提出基于最大决策边界的局部在线流特征选择算法.引入局部特征选择,在充分利用局部信息的基础上,设计基于最大决策边界的特征衡量标准,尽可能分开同类样本和不同类样本.同时,使用最大化平均决策边界、最大化决策边界和最小化冗余3种策略选择合适的特征.针对局部区域选择最优的特征子集,然后使用类相似度测量方法进行分类.在14个数据集上的实验结果和统计假设检验验证文中算法的分类有效性和稳定性.     

基于特征的CAD／CAM集成技术评述与研究

本文对特征识别，基于特征的设计和特征转换等方法进行了评述和研究，并据此提出了基于特征的ＣＡＤ／ＣＡＭ集成系统的总体设计方案。     

Pedestrian Re-ID based on feature consistency and contrast enhancement

For robust person re-identification(Re-ID), the key is effectively learning the features of body parts and their long-distance dependence. ResNet and Transformer are respectively good at learning local dependence and long-distance dependence between region features due to their respective special structures. In order to fully integrate the advantages of the two models, we propose a novel person Re-ID framework that effectively incorporates pixel-level region features, posture-level relation features and the long-distance dependence of region features. Specifically, we design a Semantic Correction Module (SCM) that corrects pixel-level region features and posture-level relation features in a masked manner to generate discriminative fine-grained features with high pose semantics. Considering the semantic inconsistency between relation features and region features, we propose a Contrastive Association Module (CAM) to interactively enhances the long-distance correlation and local saliency of features in a self-attention way. Finally, to improve the robustness of local and global features, we construct a CAM layer to enhance the representation of features based on their potential relationships. Extensive experiment results on general and occlusion datasets demonstrate that our approach performs favorably against the state-of-the-art methods, e.g. 96% Rank-1 on Market-1501.     

Stability of feature selection algorithms: a study on high-dimensional spaces

With the proliferation of extremely high-dimensional data, feature selection algorithms have become indispensable components of the learning process. Strangely, despite extensive work on the stability of learning algorithms, the stability of feature selection algorithms has been relatively neglected. This study is an attempt to fill that gap by quantifying the sensitivity of feature selection algorithms to variations in the training set. We assess the stability of feature selection algorithms based on the stability of the feature preferences that they express in the form of weights-scores, ranks, or a selected feature subset. We examine a number of measures to quantify the stability of feature preferences and propose an empirical way to estimate them. We perform a series of experiments with several feature selection algorithms on a set of proteomics datasets. The experiments allow us to explore the merits of each stability measure and create stability profiles of the feature selection algorithms. Finally, we show how stability profiles can support the choice of a feature selection algorithm. Alexandros Kalousis received the B.Sc. degree in computer science, in 1994, and the M.Sc. degree in advanced information systems, in 1997, both from the University of Athens, Greece. He received the Ph.D. degree in meta-learning for classification algorithm selection from the University of Geneva, Department of Computer Science, Geneva, in 2002. Since then he is a Senior Researcher in the same university. His research interests include relational learning with kernels and distances, stability of feature selection algorithms, and feature extraction from spectral data. Julien Prados is a Ph.D. student at the University of Geneva, Switzerland. In 1999 and 2001, he received the B.Sc. and M.Sc. degrees in computer science from the University Joseph Fourier (Grenoble, France). After a year of work in industry, he joined the Geneva Artificial Intelligence Laboratory, where he is working on bioinformatics and datamining tools for mass spectrometry data analysis. Melanie Hilario has a Ph.D. in computer science from the University of Paris VI and currently works at the University of Geneva’s Artificial Intelligence Laboratory. She has initiated and participated in several European research projects on neuro-symbolic integration, meta-learning, and biological text mining. She has served on the program committees of many conferences and workshops in machine learning, data mining, and artificial intelligence. She is currently an Associate Editor of theInternational Journal on Artificial Intelligence Toolsand a member of the Editorial Board of theIntelligent Data Analysis journal.     

An approach to identify design and manufacturing features from a data exchanged part model

Due to the large variety of CAD systems in the market, data exchange between different CAD systems is indispensable. Currently, data exchange standards such as STEP and IGES, etc. provide a unique approach for interfacing among different CAD platforms. Once the feature-based CAD model created in one CAD system is input into another via data exchange standards, many of the original features and the feature-related information may not exist any longer. The identification of the design features and their further decomposition into machining features for the downstream activities from a data exchanged part model is a bottleneck in integrated product and process design and development. In this paper, the feature panorama is succinctly articulated from the viewpoint of product design and manufacturing. To facilitate feature identification and extraction, a multiple-level feature taxonomy and hierarchy is proposed based on the characteristics of part geometry and topology entities. The relationships between the features and their geometric entities are established. A litany of algorithms for the identification of design and machining features are proposed. Besides, how to recognize the intersecting features or compound features based on the featureless chunks of geometry entities is critical and the issue is addressed in the paper. A multi-level compound feature representation and recognition approach are presented. Finally, case studies are used to illustrate the validity of the approach and algorithms proposed for the identification of the features from CAD part models in neutral format.     

一种基于几何特征的表情相似性度量方法

在表演驱动、表情克隆等人脸动画中,需要寻找最相似表情以提高动画真实感和逼真度。基于面部表情几何特征提出一种特征加权的表情相似性度量方法。首先,在主动外观模型上,利用链码描述各区域的形状特征以刻画局部表情细节,并根据区域特征点间的拓扑关系构建形变特征以反映整体表情信息。然后,采用特征加权方式对融合的几何特征进行相似性度量,并将权重的求解过程转化为加权目标函数最小化。最后,利用求解的权重以及特征加权函数度量表情间的相似性,寻找与之最相似的表情图像。在BU-3DFE数据库和FEEDTUM数据库上的实验结果表明,该方法在寻找相似表情的正确率方面明显高于现有的度量方法,并且对不同类型、不同强度的表情描述保持较好鲁棒性,尤其在嘴型、脸颊收缩、嘴开合幅度等表情细节维持较高相似度。     

Optimal feature selection for support vector machines

Selecting relevant features for support vector machine (SVM) classifiers is important for a variety of reasons such as generalization performance, computational efficiency, and feature interpretability. Traditional SVM approaches to feature selection typically extract features and learn SVM parameters independently. Independently performing these two steps might result in a loss of information related to the classification process. This paper proposes a convex energy-based framework to jointly perform feature selection and SVM parameter learning for linear and non-linear kernels. Experiments on various databases show significant reduction of features used while maintaining classification performance.