典型相关分析融合全局和局部特征的人脸识别

为了提高人脸的识别率,提出一种典型相关分析融合全局和局部特征的人脸识别算法（SUB-CCA）。通过划分子模式方式避免人脸识别存在小样本、非线性问题,并提取局部特征,采用主成分分析提取人脸图像的全局特征,并采用相关分析算法对全局、局总特征进行融合,消除特征间冗余信息,降低特征维数,采用投票法得到人脸识别结果,并采用3个人脸数据集对算法性能进行测试。仿真结果表明,相对于参比算法,SUB-CCA提高了人脸识别的识别精度。     

基于对称的二维主成分分析及其在人脸识别中的应用

在二维主成分分析算法中引入了对称性思想,提出了基于对称的二维主成分分析算法（STDPCA）。在该算法中,首先把人脸图像分解成奇对称图像和偶对称图像,然后分别在这两类图像中进行二维主成分分析,提取所需要的特征。该算法不仅有效利用了二维主成分分析算法的优点,而且也考虑了人脸对称性的特点,因此在人脸识别中有较高的识别率。在著名人脸库ORL、YALE中的实验证明了该算法的有效性。     

基于独立成分分析和回归分析的人脸识别方法研究

传统的二维人脸识别方法的识别效果受人脸图像由于光照、表情、视角和饰物等的影响（统称为特殊人脸）很大。独立成分分析能有效地提取人脸特征,且所提取的特征具有高阶不相关性。回归分析具有良好的线性相关性分析能力。提出了基于独立成分分析和回归分析相结合的人脸识别方法,实验结果表明,与传统的主分量分析算法与K-最近邻分类器结合的人脸识别方法相比,该方法对特殊人脸图像的识别具有相当的优势。     

基于核典型相关分析的多特征组合人脸识别

为了提高人脸的识别率,利用多特征和分类器之间的互补优势,提出一种基于核典型相关分析的多特征组合人脸识别方法（KCCA-MF）。提取人脸图像的LBP特征和Gabor特征,采用核典型相关分析算法对两种特征进行融合,以消除冗余特征,采用K近邻算法和支持向量机建立组合人脸分类器,并采用3个经典人脸库进行仿真分析。结果表明,相对于其他人脸识别方法,KCCA-MF提高了人脸识别的识别准确率和效率,可以满足人脸识别的实时性要求。     

基于统计学习理论的人脸识别方法研究

人脸识别过程中，待识别人脸图像的预处理、特征选择与提取以及分类器的选择是非常重要的。利用核主成分分析方法提取的人脸图像特征信息能较好地反映人脸特征的非线性结构信息，然后将此特征数据作为支持向量机的输入数据、结合二叉树判别策略，能够实现对多类人脸图像的分类识别。实验结果表明该方法能够取得较好的识别效果。     

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

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

基于分块相位一致性的人脸识别算法

针对基于可见光的人脸图像的识别容易受光照和表情变化的影响,人脸的表情变化仅限于局部等问题,以及图像的相位一致性特征不受图像的亮度或对比度影响的特点,提出了一种基于分块相位一致性的人脸识别算法。该算法用log-gabor滤波器对图像进行滤波,利用相位一致性模型提取相位一致性特征图像;对每幅特征图像进行分块主元分析(PCA)处理;融合所有子图像的距离信息,采用最近邻分类器进行分类识别。实验证明该方法具有更好的识别性能。     

基于小波变换和多特征融合算法的人脸识别

提出了基于小波变换和多特征融合算法的人脸识别方法。该方法先对原始人脸图像进行简单加权小波变换以降低维数,施行改进的模块二维主成分分析（M2DPCA）抽取特征,再进行加权最大散度差鉴别分析（WMSD）得到最终的特征图像,采用最近邻分类器对人脸分类识别。该方法不仅利用了人脸图像的局部特征和类别信息,而且避免了矩阵的奇异值分解可能遇到的问题。在ORL人脸库上实验,以验证该方法的有效性。     

小波变换和特征加权融合的人脸识别

在人脸识别领域,提取人脸特征和降低维数是人脸识别的关键。传统的基于小波变换的人脸识别算法仅在小波分解的低频分量上提取用于分类的图像特征,造成了高频分量中部分对识别有利信息的丢失。为了更有效地提取人脸图像特征,提出一种基于小波变换和特征加权融合的人脸识别算法。首先通过小波变换对人脸图像进行降维处理,然后对4个小波子图分别运用主成分分析法(PCA)提取特征,并把这4部分特征加权融合,最后利用支持向量机(SVM)进行分类识别。在ORL人脸库上进行实验验证,识别准确率可达到97.5%,实验结果表明该算法能够有效提高人脸识别能力,与传统识别算法相比具有较高的识别准确率和识别速度。     

基于KL距离的KPCA人脸识别算法

针对核主成分分析（KPCA）人脸识别算法中对全局特征变化敏感和忽略局部特征的问题,研究了一种基于KL距离的KPCA人脸识别算法。利用KL距离定义了类间距离和类内差异,设定了一个非线性优化函数来最大化类间距离,同时最小化类内差异,使提取的特征更为紧凑可分,并将其应用于KPCA算法中,利用ORL人脸图像库对算法的性能进行了测试。实验结果表明,该算法相对于传统KPCA算法具有更好的识别效果和稳定性。     

Fast and precise points-to analysis

Many software engineering applications require points-to analysis. These client applications range from optimizing compilers to integrated program development environments (IDEs) and from testing environments to reverse-engineering tools. Moreover, software engineering applications used in an edit-compile cycle need points-to analysis to be fast and precise.In this article, we present a new context- and flow-sensitive approach to points-to analysis where calling contexts are distinguished by the points-to sets analyzed for their call target expressions. Compared to other well-known context-sensitive techniques it is faster in practice, on average, twice as fast as the call string approach and by an order of magnitude faster than the object-sensitive technique. In fact, it shows to be only marginally slower than a context-insensitive baseline analysis. At the same time, it provides higher precision than the call string technique and is similar in precision to the object-sensitive technique. We confirm these statements with experiments using a number of abstract precision metrics and a concrete client application: escape analysis.     

源代码分析技术的理论与实践发展

源代码分析技术对于软件安全缺陷分析是一项非常重要的手段.分析了软件源代码分析工具的技术手段和发展过程,最后对源代码分析的理论和实践进行了分析总结.     

C语言的别名分析方法研究

别名分析对于数据流分析、程序优化和分析工具的实现非常重要.文章提出了一种需求驱动,流非敏感的分析算法来解决指针别名问题.通过构造程序表达式图(PEG)把指针别名问题转化成判断两个指针节点是否是联通的问题,它不同于传统的别名分析方法,它不需要构造别名集合和对其求交集,所以提高了分析指针别名的效率.     

The use of protocol analysis for determining ability requirements for personnel selection on a computer-based task

Abstract

The role of cognitively oriented tasks in the workplace continues to increase as automation of physical task components advances. Difficulties in automating the operator's cognitive processes have placed a renewed emphasis on the human component in advanced manufacturing systems. While traditional task analysis techniques have made significant contributions to improving productivity when important task elements are visually observable, their focus on manual task procedures make them less effective for cognitively oriented activities. This research has made a first attempt at integrating techniques from several disciplines to develop a cognitive task analysis methodology. The utility of this combined approach is examined for a new system being tested in the United States Postal Service. This task requires operators to encode, via a keyboard, addresses presented on a video display terminal. Results support the hypothesis that, for cognitively oriented tasks, a consensus based analysis technique (the Position Analysis Questionnaire) can be significantly improved by including data from task analysis provided the methodology is suitable for identifying non-physical task components.     

A system to assist survey analysts

The researcher who knows little about computers but wants to conduct a survey and analyse the results by computer can land himself in some difficulty if he does not appreciate some of the problems of computerization. This paper describes a system which is designed to aid such a person by providing assistance with the design of the questionnaire, the capturing of the data and the final analyses.     

A novel analysis space for pointer analysis and its application for bug finding

The size of today’s programs continues to grow, as does the number of bugs they contain. Testing alone is rarely able to flush out all bugs, and many lurk in difficult-to-test corner cases. An important alternative is static analysis, in which correctness properties of a program are checked without running it. While it cannot catch all errors, static analysis can catch many subtle problems that testing would miss.We propose a new space of abstractions for pointer analysis—an important component of static analysis for C and similar languages. We identify two main components of any abstraction—how to model statement order and how to model conditionals, then present a new model of programs that enables us to explore different abstractions in this space. Our assign-fetch graph represents reads and writes to memory instead of traditional points-to relations and leads to concise function summaries that can be used in any context. Its flexibility supports many new analysis techniques with different trade-offs between precision and speed.We present the details of our abstraction space, explain where existing algorithms fit, describe a variety of new analysis algorithms based on our assign-fetch graphs, and finally present experimental results that show our flow-aware abstraction for statement ordering both runs faster and produces more precise results than traditional flow-insensitive analysis.     

基于因子分析法和聚类分析法的副省级城市宜居情况聚类评价

重点选取了15个副省级城市的第一产业比重、人口密度、人均绿地、园林面积、医院数目,市政建设面积、地方财政税收等42个指标,使用SPSS作为计算工具,使用因子分析方法简化评价指标,计算相关系数矩阵,判别因子分析可行性,利用主成分分析法求因子载荷,将因子进行旋转得出更有实际意义的因子解释,并计算因子得分,利用该结果计算Mi...     

Cost analysis of object-oriented bytecode programs

Cost analysis statically approximates the cost of programs in terms of their input data size. This paper presents, to the best of our knowledge, the first approach to the automatic cost analysis of object-oriented bytecode programs. In languages such as Java and C#, analyzing bytecode has a much wider application area than analyzing source code since the latter is often not available. Cost analysis in this context has to consider, among others, dynamic dispatch, jumps, the operand stack, and the heap. Our method takes a bytecode program and a cost model specifying the resource of interest, and generates cost relations which approximate the execution cost of the program with respect to such resource. We report on COSTA, an implementation for Java bytecode which can obtain upper bounds on cost for a large class of programs and complexity classes. Our basic techniques can be directly applied to infer cost relations for other object-oriented imperative languages, not necessarily in bytecode form.     

数据分析需求与实现

数据分析是从海量数据中发现隐含信息或知识的过程。基于一个公安破案辅助数据分析系统,深入研究数据分析任务的需求与实现,提出首先规划分析思路、细化分析功能,然后用多视角数据透视和智能分析两种手段,从微观与宏观、定量与定性等不同角度互为补充地使系统具有完备的分析功能。该研究对如何开发具有实用价值的数据分析系统有普遍的指导意义。