Computer Science ›› 2014, Vol. 41 ›› Issue (8): 297-300.doi: 10.11896/j.issn.1002-137X.2014.08.063

Previous Articles     Next Articles

Low-rank Graph with Spatial Constraint for Face Recognition

YANG Guo-liang,XIE Nai-jun,LUO Lu and LIANG Li-ming   

  • Online:2018-11-14 Published:2018-11-14

Abstract: The low-rank representation (LLR) model can reveal the subtle data structure information and show a strong robustness when dealing with noises.Based on the framework for graph embedding dimensionality reduction method,we proposed a face recognition algorithm which establishes low-rank graph using low-rank representation model.In addition,we constructed a novel low-rank graph with spatial constraint by using spatial information of the tracked points to improve recognition performance.To demonstrate the effectiveness of the presented algorithm,our comparative experiments were conducted using ORL and PIE face image databases.Experimetal results show that the effectiveness and robustness to noises are always better than other state-of-the-art methods.

Key words: Low-rank representation,Spatial constraints,Low-rank graph,Face recognition

[1] Belkin M,Niyogi P.Laplacian eigenmaps for dimensionality reduction and data representation [J].Neural Computation,2003,15(6):1373-1396
[2] Niyogi X.Locality preserving projections[C]∥Neural Information Processing Systems.2004,16:153
[3] He X,Cai D,Yan S,et al.Neighborhood preserving embedding[C]∥Tenth IEEE International Conference on Computer Vision,2005(ICCV 2005).IEEE,2005,2:1208-1213
[4] Wright J,Yang A Y,Ganesh A,et al.Robust face recognition via sparse representation[J].IEEE Transactions on Pattern Analysis and Machine Intelligence,2009,31(2):210-227
[5] 杨荣根,任明武,杨静宇.基于稀疏表示的人脸识别算法[J].计算机科学,2010,7(9):267-278
[6] Candès E J,Li X,Ma Y,et al.Robust principal component ana-lysis?[J].Journal of the ACM (JACM),2011,58(3):11
[7] Liu G,Lin Z,Yu Y.Robust subspace segmentation by low-rank representation[C]∥Proceedings of the 27th International Conference on Machine Learning (ICML-10).2010:663-670
[8] Zhuang L,Gao H,Lin Z,et al.Non-negative low rank and sparse graph for semi-supervised learning[C]∥2012 IEEE Conference on Computer Vision and Pattern Recognition (CVPR).IEEE,2012:2328-2335
[9] Zhuang L,Gao H,et al.Semi-supervised classification via lowrank graph[C]∥2011 Sixth International Conference on Image and Graphics (ICIG).IEEE,2011:511-516
[10] Yang S,Wang X,Wang M,et al.Semi-supervised low-rank representation graph for pattern recognition[J].IET Image Processing,2013,7(2):131-136
[11] Zheng Y,Zhang X,Yang S,et al.Low-rank representation with local constraint for graph construction[J].Neurocomputing,2013,122:398-405
[12] Zhang N,Yang J.Low-rank representation based discriminative projection for robust feature extraction[J].Neurocomputing,2013,111:13-20
[13] Arpit D,Srivastava G,Fu Y.Locality-constrained Low RankCoding for face recognition[C]∥2012 21st International Conference on Pattern Recognition (ICPR).IEEE,2012:1687-1690
[14] Xu H,Caramanis C,Sanghavi S.Robust PCA via outlier pursuit[J].Systems Advances in Neural Information Processing Systems,2010,3:2496-2504
[15] Liu G,Lin Z,Yan S,et al.Robust recovery of subspace struc-tures by low-rank representation[J].Pattern Analysis and Machine Intelligence,2012,5(1):172-184
[16] Lin Z,Liu R,Su Z.Linearized alternating direction method with adaptive penalty for low-rank representation[C]∥ Advances in Neural Information Processing Systems 24(NIPS 2011).2011
[17] Cai J F,Candès E J,Shen Z.A singular value thresholding algorithm for matrix completion[J].SIAM Journal on Optimization,2010,20(4):1956-198

No related articles found!
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!