Abstract：When the face recognition method based on regression analysis is applied to the incomplete matrix, it completes the matrix firstly before using the face recognition method. Thus, the classification performance is reduced. To solve the problem, a face recognition method based on low-rank representation and low-rank matrix completion is proposed by integrating low-rank matrix completion and low-rank representation learning into a single model. The low-rank representation coefficient matrix is computed alternately and the missing entries are recovered by minimizing the representation coefficients and matrix rank. Then, the nearest neighbor classifier is used to classify the samples. Experimental results on several open face datasets show that the proposed method effectively improves the recognition performance and reduces the error of matrix completion while the entries of the training sample matrix are randomly missing.
[1] NASEEM I, TOGNERI R, BENNAMOUN M. Linear Regression for Face Recognition. IEEE Transactions on Pattern Analysis and Machine Intelligence, 2010, 32(11): 2106-2112. [2] WRIGHT J, YANG A Y, GANESH A, et al. Robust Face Recognition via Sparse Representation. IEEE Transactions on Pattern Analysis and Machine Intelligence, 2009, 31(2): 210-227. [3] ZHANG L, YANG M, FENG X C. Sparse Representation or Collaborative Representation: Which Helps Face Recognition? // Proc of the IEEE International Conference on Computer Vision. Washington, USA: IEEE, 2011: 471-478. [4] NGUYEN H, YANG W K, SHEN F M, et al. Kernel Low-Rank Representation for Face Recognition. Neurocomputing, 2015, 155: 32-42. [5] YANG C Y, ROBINSON D, VIDAL R. Sparse Subspace Clustering with Missing Entries[C/OL]. [2018-04-25]. http://proceedings.mlr.press/v37/yangf15.pdf. [6] XU Y Y, YIN W T, WEN Z W, et al. An Alternating Direction Algorithm for Matrix Completion with Nonnegative Factors. Frontiers of Mathematics in China, 2012, 7(2): 365-384. [7] CAI J F, CANDÈS E J, SHEN Z W. A Singular Value Thresholding Algorithm for Matrix Completion. SIAM Journal on Optimization, 2010, 20(4): 1956-1982. [8] LIU G C, LI P. Low-Rank Matrix Completion in the Presence of High Coherence. IEEE Transactions on Signal Processing, 2016, 64(21): 5623-5633. [9] FAN J C, CHOW T W S. Sparse Subspace Clustering for Data with Missing Entries and High-Rank Matrix Completion. Neural Networks, 2017, 93: 36-44. [10] LIN Z C, CHEN M M, MA Y. The Augmented Lagrange Multiplier Method for Exact Recovery of Corrupted Low-Rank Matrices[C/OL]. [2018-04-25]. https://arxiv.org/pdf/1009.5055.pdf. [11] GORSKI J, PFEUFFER F, KLAMROTH K, et al. Biconvex Sets and Optimization with Biconvex Functions: A Survey and Extensions. Mathematical Methods of Operations Research, 2007, 66(3): 373-407. [12] BOYD S, PARIKH N, CHU E, et al. Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers. Foundations and Trends in Machine Learning, 2011, 3(1): 1-122. [13] MARTINEZ A M, KAK A C. PCA versus LDA. IEEE Transactions on Pattern Analysis and Machine Intelligence, 2001, 23(2): 228-233. [14] LEE K C, HO J, KRIEGMAN D J, et al. Acquiring Linear Subspaces for Face Recognition under Variable Lighting. IEEE Transactions on Pattern Analysis and Machine Intelligence,2005,27(5): 684-698. [15] SAMARIA F S, HARTER A C. Parameterisation of a Stochastic Model for Human Face Identification // Proc of the 2nd IEEE Workshop on Applications of Computer Vision. Washington, USA: IEEE, 1994: 138-142. [16] PHILLIPS P J, MOON H, RIZVI S A, et al. The FERET Evaluation Methodology for Face-Recognition Algorithms. IEEE Transactions on Pattern Analysis and Machine Intelligence, 2000, 22(10): 1090-1104. [17] GRAHAM D B, ALLINSON N M. Characterizing Virtual Eigensignatures for General Purpose Face Recognition // WECHSLER H, PHILLIPS P J, BRUCE V, et al., eds. Face Recognition: From Theory to Applications. Berlin, Germany: Springer, 1998, 163: 446-456.
2018, Vol. 31 
