Location:
Search - ORL f
Search list
Description: 使用Fisher线性鉴别分析（FLDA）方法在ORL人脸数据库上进行人脸识别试验。ORL标准人脸库共包含40人，每人10幅共400幅BMP图像。-The use of Fisher linear discriminant analysis (FLDA) at Ways on ORL face database for face recognition test. Standard ORL face database contains a total of 40 people, 10 per person a total of 400 BMP images.
Platform: |
Size: 4096 |
Author: liz |
Hits:
Description: 二维线性鉴别分析(2DLDA)算法能有效解决线性鉴别分析(LDA)算法的“小样本”效应，支持向量机
(SVM)具有结构风险最小化的特点，将两者结合起来用于人脸识别。首先，利用小波变换获取人脸图像的低频分量，忽
略高频分量：然后，用2DLDA算法提取人脸图像低频分量的线性鉴别特征，用“一对多”的SVM 多类分类算法完成人脸
识别。基于ORL人脸数据库和Yale人脸数据库的实验结果验证了2DLDA+SVM算法应用于人脸识别的有效性。-”Small sample size”problem of LDA algorithm can be overcome by two—dimensional LDA f 2DLDA)，and
Support Vector Machine(SVM)has the characteristic of structural risk minimization．In this paper，two methods were
combined and used for face recognition．Firstly，the original images were decomposed into high—frequency and low—frequency
components by Wavelet Transform(WT)．The high—frequency components were ignored，while the low—frequency components
can be obtained．Then．the liner discriminant features were extracted by 2DLDA，and”one VS rest”。strategy of SVMs for
muhiclass classification was chosen to perform face recognition． Experimental results based on ORL f Olivetti Research
Laboratory1 face database and Yale face database show the validity of 2DLDA+SVM algorithm for face recogn ition．
Platform: |
Size: 236544 |
Author: 费富里 |
Hits:
Description: Fisher线性鉴别分析已成为特征抽取的最为有效的方法之一 .但是在高维、小样本情况下如何抽取Fisher最优鉴别特征仍是一个困难的、至今没有彻底解决的问题 .文中引入压缩映射和同构映射的思想 ,从理论上巧妙地解决了高维、奇异情况下最优鉴别矢量集的求解问题 ,而且该方法求解最优鉴别矢量集的全过程只需要在一个低维的变换空间内进行 ,这与传统方法相比极大地降低了计算量 .在此理论基础上 ,进一步为高维、小样本情况下的最优鉴别分析方法建立了一个通用的算法框架 ,即先作K L变换 ,再用Fisher鉴别变换作二次特征抽取 .基于该算法框架 ,提出了组合线性鉴别法 ,该方法综合利用了F S鉴别和J Y鉴别的优点 ,同时消除了二者的弱点 .在ORL标准人脸库上的试验表明 ,组合鉴别法所抽取的特征在普通的最小距离分类器和最近邻分类器下均达到 97 的正确识别率 ,而且识别结果十分稳定 .该结果大大优于经典的特征脸和Fisherfaces方法的识别结果-Fisher linear discrimination analysis has become one of the most effective way to feature extraction, but in the case of high dimension and small sample how to extract Fisher optimal identification features is still a difficult, still hasn t completely solve the problem. In this paper, introducing the idea of compression mapping and isomorphism, ingeniously solved the high-dimensional theoretically, singular case to solve the problem of optimal identification vector set, and the whole process of the method to solve the optimal identification of vector set just in a low dimensional transformation space, compared with the traditional method greatly reduces the amount of calculation. Based on this theory, further to high dimension and small sample situation of optimal discrimination analysis method to establish the framework, a generic algorithm is first as K L transform, reoccupy Fisher identification transformations as a secondary feature extraction. Based on this algorithm framework, a
Platform: |
Size: 7168 |
Author: 迪迪 |
Hits: