南京大学学报(自然科学版) ›› 2018, Vol. 54 ›› Issue (2): 462–.

• • 上一篇    下一篇

 最大间距准则框架下的多流形局部图嵌入(MLGE/MMC)算法

 万鸣华1,2*,杨国为1,赖志辉2   

  • 出版日期:2018-03-31 发布日期:2018-03-31
  • 作者简介: 1.南京审计大学工学院,南京,211815;2.深圳大学计算机与软件学院,深圳,518060
  • 基金资助:
     基金项目:国家自然科学基金(61462064,61503195,6177227),中国博士后基金(2016M600674),江苏省自然科学基金面上项目(BK20161580,BK20171494)
    收稿日期:2017-12-08
    *通讯联系人,E-mail:wmh36@nau.edu.cn.

 Multi-manifold locally graph embedding algorithm under maximum margin criterion(MLGE/MMC)

 Wan Minghua1,2*,Yang Guowei1,Lai Zhihui2   

  • Online:2018-03-31 Published:2018-03-31
  • About author:1.School of Technology,Nanjing Audit University,Nanjing,211815,China;
    2.College of Computer Science and Software Engineering,Shenzhen University,Shenzhen,518060,China

摘要:  主要针对局部图嵌入(Locally Graph Embedding,LGE)算法在训练样本偏少时进行特征提取,会产生识别精度不高情况,通过引入多流形思想,结合LGE和最大间距准则(Maximum Marginal Criterion,MMC)算法,提出了一种最新的特征提取算法——最大间距准则框架下的多流形局部图嵌入(Multi-Manifold Locally Graph Embedding Based on Maximum Marginal Criterion,MLGE/MMC)算法. 首先,该算法将每幅图像分成多幅小图像,这一幅图像分成的这些小图像在高维空间中就构成一个流形,以此类推,多幅图像就构成了多流形;其次,通过最大化多流形类间距离,同时最小化流形类内距离来寻找最佳投影矩阵,即分别构建多流形类间散度矩阵和类内散度矩阵;最后,在MMC准则框架下构造目标函数,通过拉格朗日乘子法和迭代来解决约束条件下的优化问题. 在ORL,Yale及AR人脸库上的实验,验证了所提算法的有效性.

Abstract:  The purpose of this work is to aim at Locally Graph Embedding(LGE)algorithm in training too few samples for feature extraction. It is not the case to produce high recognition accuracy. Thus,by introducing a multi-manifold thought,the combination of LGE and Maximum Marginal Criterion(MMC)algorithm,Multi-manifold Locally Graph Embedding Algorithm under Maximum Margin(MLGE/MMC)algorithm was proposed. Firstly,each image is divided into multiple small images,these small images configuration constitutes a manifold,and multi-image constitutes multi-manifold. Then,by maximizing the inter-class distance between the manifold manifold classes while minimizing the intra-class distance to find the best the projection matrix,the algorithm constructs the multi-manifold inter-class scatter matrix and the multi-manifold intra-class scatter matrix,respectively. Thus,the purpose of this algorithm is to make the minimum and maximum interval manifold external separability,to change the internal manifold at the same time,and to maximize the manifold edge extraction in order to carry out feature more effectively. Finally,the objective function is constructed under the framework of the MMC to find the optimal solution by iteration. The algorithm divides an image into many small pieces,and then models the small pieces of each face into their manifold. Thus,the total number of training samples for each class is increased. The proposed algorithm transforms the key problem in face recognition into the problem of computing the distance between each manifold. It will be a key point in the follow-up research to expand the original algorithm and to apply it to single sample. Experimental results on ORL,Yale and AR face database verify the effectiveness of the proposed algorithm.

 

[1] Seung H S,Lee D D. The manifold ways of perception. Science,2000,290(5500):2268-2269. 
[2] Gui J,Sun Z N,Jia W,et al. Discriminant sparse neighborhood preserving embedding for face recognition. Pattern Recognition,2012,45(8):2884-2893.
[3] Wan M H,Li M,Yang G W,et al. Feature extraction using two-dimensional maximum embedding difference. Information Sciences,2014,274:55-69.
[4] Lai Z H,Wong W K,Xu Y,et al. Approximate orthogonal sparse embedding for dimensionality reduction. IEEE Transactions on Neural Networks and Learning Systems,2016,27(4):723-735.
[5] Roweis S T,Saul L K. Nonlinear dimensionality reduction by locally linear embedding. Science,2000,290(5500):2323-2326.
[6] Tenenbaum J B,de Silva V,Langford J C. A global geometric framework for nonlinear dimensionality reduction. Science,2000,290(5500):2319-2323.
[7] Belkin M,Niyogi P. Laplacian eigenmaps for dimensionality reduction and data representation. Neural Computation,2003,15(6):1373-1396.
[8] Lai Z H,Xu Y,Chen Q C,et al. Multilinear sparse principal component analysis. IEEE Transactions on Neural Networks and Learning Systems,2014,25(10):1942-1950.
[9] Shi X S,Yang Y J,Guo Z H,et al. Face recognition by sparse discriminant analysis via joint L2,1-norm minimization. Pattern Recogni-tion,2014,47(7):2447-2453.
[10] 马 龙. 基于多流形判别分析的单样本人脸识别研究. 硕士学位论文. 南京:南京理工大学,2014.(Ma L. Research on single sample face recognition based on multi-manifold discriminant analysis. Master Dissertation. Nanjing:Nanjing University of Science and Technology,2014. )
[11] Li H,Jiang T,Zhang K. Efficient and robust feature extraction by maximum margin criterion. IEEE Transactions on Neural Networks,2006,17(1):157-165.
[12] Ahonen T,Hadid A,Pietikainen M. Face description with local binary patterns:Application to face recognition. IEEE Transactions on Pattern Analysis and Machine Intelligence,2006,28(12):2037-2041.
[13] Zhang B C,Gao Y S,Zhao S Q,et al. Local derivative pattern versus local binary pattern:Face recognition with high-order local pattern descriptor. IEEE Transactions on Image Processing,2010,19(2):533-544.

[14] Wolf L,Hassner T,Taigman Y. Effective unconstrained face recognition by combining multiple descriptors and learned background statistics. IEEE Transactions on Pattern Analysis and Machine Intelligence,2011,33(10):1978-1990.
[15] He X F,Yan S C,Hu Y,et al. Face Recognition using laplacianfaces. IEEE Transactions on Pattern Analysis and Machine Intelligence,2005,27(3):328-340.
[16] Wan M H,Gai S,Shao J. Local graph embedding based on maximum margin criterion(LGE/MMC)for face recognition. Informatica,2012,36(1):103-112.
[17] Yang J,Zhang D,Yang J Y,et al. Globally maximizing,locally minimizing:unsupervised discriminant projection with applications to face and palm biometrics. IEEE Transactions on Pattern Analysis and Machine Intelligence,2007,29(4):650-664.

No related articles found!
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!