检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
出 处:《计算机工程》2014年第9期252-256,共5页Computer Engineering
基 金:重庆大学"211"工程三期创新人才培养计划建设基金资助项目(s-09110)
摘 要:传统的二维保局投影(2DLPP)算法未考虑样本邻域间局部信息,并且所提取的特征矩阵分量间存在相关性。针对该问题,提出基于大间距准则的最小相关性监督2DLPP算法。引入类间局部散度矩阵和类内局部散度矩阵,最大化带权的散度矩阵迹差,以增大样本类间散度,减小样本类内散度,从而更好地刻画数据的流形结构。计算所提取特征矩阵各分量间的协方差矩阵,通过最小相关性分析,减少特征信息的冗余。在Yale和ORL人脸库上进行仿真实验,结果显示,当训练样本数为5时,该算法的最高识别率分别为92.5%和96.2%,与传统2DLPP算法、二维主成分分析法、二维线性判别分析法和二维大间距准则法相比,识别率均有所提高。同时对不同训练样本数下识别率均值和方差进行分析,验证了算法的稳定性。Two-dimensional Locality Preserving Projection(2DLPP)ignores the face sample local information between neighborhood and the correlation between the extracted feature matrix component problems. Aiming at this problem,the minimum correlated supervision2 DLPP algorithm based on Maximum Margin Criterion(MMC)is proposed. Between class local scatter matrix and within class local scatter matrix are brought in,which maximize the trace difference of scatter matrix to increase the sample's between-class scatter and decrease within-class scatter,then manifold structure of data can be characterized better. It calculates the covariance matrix of extracted feature matrix,reduces the feature redundant. Experiments on Yale and ORL face database are done,when the train sample number is5,the result shows that the highest recognition rates are92.5% and96.2%,the recognition rate is higher than traditional2 DLPP algorithm,Twodimension Principal Component Analysis(2DPCA)algorithm,Two-dimension Linear Discriminate Analysis(2DLDA)algorithm and Two-dimension Maximum Margin Criterion(2DMCC)algorithm. It also analyses the mean and variance of recognition rate to prove the stability of the improved algorithm.
关 键 词:流形学习 最大间距准则 散度矩阵 二维保局投影 最小相关性 人脸识别
分 类 号:TP18[自动化与计算机技术—控制理论与控制工程]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.222