结合成对约束的近邻稀疏保留投影算法  

Locally sparsity preserving projection algorithm considering pairwise constraint

作　　者：彭澎[1] 郝矿荣[1,2] 丁永生[1,2] 郭爽[1] 

机构地区：[1]东华大学信息科学与技术学院,上海201620 [2]数字化纺织服装技术教育部工程研究中心,上海201620

出　　处：《计算机工程与应用》2016年第7期176-180,共5页Computer Engineering and Applications

基　　金：国家自然科学基金重点项目(No.61134009);长江学者和创新团队发展计划(No.IRT1220);上海领军人才专项资金;上海市科学技术委员会重点基础研究项目(No.13JC1407500;No.11JC1400200);上海市教育委员会科研创新项目(No.14ZZ067);中央高校基本科研业务费专项资金(No.2232012A3-04)

摘　　要：稀疏保持投影算法是一种无监督的全局线性降维方法,无法应对训练样本不足及类内样本间差异过大的情况。针对该问题,提出一种结合成对约束机制的近邻稀疏保留投影算法。利用近邻样本求取稀疏系数以保留局部结构信息,引入成对约束监督的思想,利用样本类别指导稀疏重构过程,最后定义能最大限度保留稀疏系数中蕴含的类别信息的低维子空间。将该算法用于人脸识别,实验结果证明了算法在识别率以及运行时间上的有效性和可行性。As sparsity preserving projection algorithm is a globally unsupervised dimensionality reduction method, which turns out to be invalid to solve the lack of training samples or large differences in the same class, a locally sparsity persevering projection algorithm considering pairwise constraint is proposed. Sparse coefficients are obtained using neighbor samples in order to preserve local structure information. Then pairwise constraints supervision idea is taken for reference,applying sample labels to guide sparse reconstruction. Objective function is defined to catch the low-dimensional subspace which can best preserve the discriminant information contained in sparse coefficients. The effectiveness and feasibility of this proposed algorithm is verified by face recognition experiments from the perspective of recognition rate and runtime.

关 键 词：降维 近邻稀疏保留投影 成对约束 人脸识别 

分 类 号：TP391.41[自动化与计算机技术—计算机应用技术]