The DOI matches its Crossref record; 60 of the 60 references it cites were found in a registry or an index.
Nuclear Norm Based Matrix Regression with Applications to Face Recognition with Occlusion and Illumination Changes
Open accessAbstract
Recently, regression analysis has become a popular tool for face recognition. Most existing regression methods use the one-dimensional, pixel-based error model, which characterizes the representation error individually, pixel by pixel, and thus neglects the two-dimensional structure of the error image. We observe that occlusion and illumination changes generally lead, approximately, to a low-rank error image. In order to make use of this low-rank structural information, this paper presents a two-dimensional image-matrix-based error model, namely, nuclear norm based matrix regression (NMR), for face representation and classification. NMR uses the minimal nuclear norm of representation error image as a criterion, and the alternating direction method of multipliers (ADMM) to calculate the regression coefficients. We further develop a fast ADMM algorithm to solve the approximate NMR model and show it has a quadratic rate of convergence. We experiment using five popular face image databases: the Extended Yale B, AR, EURECOM, Multi-PIE and FRGC. Experimental results demonstrate the performance advantage of NMR over the state-of-the-art regression-based methods for face recognition in the presence of occlusion and illumination variations.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Boyd, S., Parikh, N., Chu, E., Peleato, B., & Eckstein, J. (2011) · Foundations and Trends® in Machine Learning · doi:10.1561/2200000016 · Cited by 17,075
Boyd, S. (2010) · now publishers, Inc. eBooks · doi:10.1561/9781601984616 · Cited by 12,677
Robust Face Recognition via Sparse Representation
Wright, J., Yang, A. Y., Ganesh, A., Sastry, S. S., & Ma, Y. (2009) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2008.79 · Cited by 9,388
Robust principal component analysis?
Candès, E. J., Li, X., Ma, Y., & Wright, J. (2011) · Journal of the ACM · doi:10.1145/1970392.1970395 · Cited by 6,921
A Singular Value Thresholding Algorithm for Matrix Completion
Cai, J.-F., Candès, E. J., & Shen, Z. (2010) · SIAM Journal on Optimization · doi:10.1137/080738970 · Cited by 5,809
Robust Recovery of Subspace Structures by Low-Rank Representation
Liu, G., Lin, Z., Yan, S., Sun, J., Yu, Y., & Ma, Y. (2013) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2012.88 · Cited by 3,594
Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
Recht, B., Fazel, M., & Parrilo, P. A. (2010) · SIAM Review · doi:10.1137/070697835 · Cited by 3,471
Martínez, A. M. (1998) · Medical Entomology and Zoology · Cited by 2,830
Martínez, A. M. (1998) · CTIT technical reports series · Cited by 2,778
A method for solving the convex programming problem with convergence rate O(1/k^2)
Nesterov, Y. E. (1983) · Доклады Академии наук · Cited by 2,662
A dual algorithm for the solution of nonlinear variational problems via finite element approximation
Gabay, D., & Mercier, B. (1976) · Computers & Mathematics with Applications · doi:10.1016/0898-1221(76)90003-1 · Cited by 2,514
Overview of the Face Recognition Grand Challenge
Phillips, P. J., Flynn, P. J., Scruggs, T., Bowyer, K. W., Chang, J., Hoffman, K., Marques, J., Min, J., & Worek, W. (2005) · 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) · doi:10.1109/cvpr.2005.268 · Cited by 2,438
Acquiring linear subspaces for face recognition under variable lighting
Lee, K.-C., Ho, J., & Kriegman, D. J. (2005) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2005.92 · Cited by 2,391
Kuybeda, O., Frank, G. A., Bartesaghi, A., Borgnia, M., Subramaniam, S., & Sapiro, G. (2013) · Journal of Structural Biology · doi:10.1016/j.jsb.2012.10.010 · Cited by 2,162
Robust regression using iteratively reweighted least-squares.
Holland, P. W., & Welsch, R. E. (1977) · Communications in Statistics - Theory and Methods · doi:10.1080/03610927708827533 · Cited by 2,115
The Power of Convex Relaxation: Near-Optimal Matrix Completion
Candes, E. J., & Tao, T. (2010) · IEEE Transactions on Information Theory · doi:10.1109/tit.2010.2044061 · Cited by 2,060
Splitting Algorithms for the Sum of Two Nonlinear Operators
Lions, P. L., & Mercier, B. (1979) · SIAM Journal on Numerical Analysis · doi:10.1137/0716071 · Cited by 1,972
Sparse representation or collaborative representation: Which helps face recognition?
Zhang, L., Yang, M., & Feng, X. (2011) · 2011 International Conference on Computer Vision · doi:10.1109/iccv.2011.6126277 · Cited by 1,952
Gross, R., Matthews, I., Cohn, J., Kanade, T., & Baker, S. (2010) · Image and Vision Computing · doi:10.1016/j.imavis.2009.08.002 · Cited by 1,621
Wright, J. N., Ganesh, A., Rao, S., Peng, Y., & Ma, Y. (2009) · Illinois Digital Environment for Access to Learning and Scholarship (University of Illinois at Urbana-Champaign) · Cited by 1,495
The Augmented Lagrange Multiplier Method for Exact Recovery of Corrupted Low-Rank Matrices
Lin, Z., Chen, M., & Ma, Y. (2010) · Illinois Digital Environment for Access to Learning and Scholarship (University of Illinois at Urbana-Champaign) · doi:10.48550/arxiv.1009.5055 · Cited by 1,176
Linear Regression for Face Recognition
Naseem, I., Togneri, R., & Bennamoun, M. (2010) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2010.128 · Cited by 1,012
Exact matrix completion via convex optimization
Candès, E., & Recht, B. (2012) · Communications of the ACM · doi:10.1145/2184319.2184343 · Cited by 996
A rank minimization heuristic with application to minimum order system approximation
Fazel, M., Hindi, H., & Boyd, S. P. (2001) · Proceedings of the 2001 American Control Conference. (Cat. No.01CH37148) · doi:10.1109/acc.2001.945730 · Cited by 956
RASL: Robust Alignment by Sparse and Low-Rank Decomposition for Linearly Correlated Images
Peng, Y., Ganesh, A., Wright, J., Xu, W., & Ma, Y. (2012) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2011.282 · Cited by 817
Fast Alternating Direction Optimization Methods
Goldstein, T., O'Donoghue, B., Setzer, S., & Baraniuk, R. (2014) · SIAM Journal on Imaging Sciences · doi:10.1137/120896219 · Cited by 785
Maximum Correntropy Criterion for Robust Face Recognition
He, R., Zheng, W.-S., & Hu, B.-G. (2011) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2010.220 · Cited by 670
On the Global and Linear Convergence of the Generalized Alternating Direction Method of Multipliers
Deng, W., & Yin, W. (2016) · Journal of Scientific Computing · doi:10.1007/s10915-015-0048-x · Cited by 650
Wagner, A., Wright, J., Ganesh, A., Zhou, Z., Mobahi, H., & Ma, Y. (2012) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2011.112 · Cited by 629
Robust sparse coding for face recognition
Yang, M., Zhang, L., Yang, J., & Zhang, D. (2011) · CVPR 2011 · doi:10.1109/cvpr.2011.5995393 · Cited by 589
Self-citationChen, W., Er, M. J., & Wu, S. (2006) · IEEE Transactions on Systems, Man and Cybernetics, Part B (Cybernetics) · doi:10.1109/tsmcb.2005.857353 · Cited by 560
Face recognition using the nearest feature line method
Li, S. Z., & Lu, J. (1999) · IEEE Transactions on Neural Networks · doi:10.1109/72.750575 · Cited by 548
Interior-Point Method for Nuclear Norm Approximation with Application to System Identification
Liu, Z., & Vandenberghe, L. (2010) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/090755436 · Cited by 490
Discriminant waveletfaces and nearest feature classifiers for face recognition
Chien, J.-T., & Wu, C.-C. (2002) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2002.1114855 · Cited by 451
Structured Variable Selection with Sparsity-Inducing Norms
Jenatton, R., Audibert, J.-Y., & Bach, F. (2009) · arXiv (Cornell University) · doi:10.48550/arxiv.0904.3523 · Cited by 431
Half-Quadratic-Based Iterative Minimization for Robust Sparse Representation
He, R., Zheng, W.-S., Tan, T., & Sun, Z. (2014) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2013.102 · Cited by 342
On non-ergodic convergence rate of Douglas–Rachford alternating direction method of multipliers
He, B., & Yuan, X. (2014) · Numerische Mathematik · doi:10.1007/s00211-014-0673-6 · Cited by 299
Structured Sparse Principal Component Analysis
Jenatton, R., Obozinski, G., & Bach, F. (2009) · arXiv (Cornell University) · doi:10.48550/arxiv.0909.1440 · Cited by 277
Is face recognition really a Compressive Sensing problem?
Shi, Q., Eriksson, A., van den Hengel, A., & Shen, C. (2011) · CVPR 2011 · doi:10.1109/cvpr.2011.5995556 · Cited by 277
KinectFaceDB: A Kinect Database for Face Recognition
Min, R., Kose, N., & Dugelay, J.-L. (2014) · IEEE Transactions on Systems, Man, and Cybernetics: Systems · doi:10.1109/tsmc.2014.2331215 · Cited by 274
Learning invariant features through topographic filter maps
Kavukcuoglu, K., Ranzato, M., Fergus, R., & LeCun, Y. (2009) · 2009 IEEE Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2009.5206545 · Cited by 274
Regularized Robust Coding for Face Recognition
Yang, M., Zhang, L., Yang, J., & Zhang, D. (2013) · IEEE Transactions on Image Processing · doi:10.1109/tip.2012.2235849 · Cited by 259
Self-citationFast alternating linearization methods for minimizing the sum of two convex functions
Goldfarb, D., Ma, S., & Scheinberg, K. (2013) · Mathematical Programming · doi:10.1007/s10107-012-0530-2 · Cited by 246
RASL: Robust alignment by sparse and low-rank decomposition for linearly correlated images
Peng, Y., Ganesh, A., Wright, J., Xu, W., & Ma, Y. (2010) · 2010 IEEE Computer Society Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2010.5540138 · Cited by 242
Regularized Robust Coding for Face Recognition
Yang, M., Lei Zhang, A., Yang, J. J., & Zhang, D. D. (2013) · Cited by 225
Self-citationAre sparse representations really relevant for image classification?
Rigamonti, R., Brown, M. A., & Lepetit, V. (2011) · CVPR 2011 · doi:10.1109/cvpr.2011.5995313 · Cited by 200
Face recognition with contiguous occlusion using markov random fields
Zhou, Z., Wagner, A., Mobahi, H., Wright, J., & Ma, Y. (2009) · 2009 IEEE 12th International Conference on Computer Vision · doi:10.1109/iccv.2009.5459383 · Cited by 193
Beyond sparsity: The role of L1-optimizer in pattern classification
Yang, J., Zhang, L., Xu, Y., & Yang, J.-Y. (2012) · Pattern Recognition · doi:10.1016/j.patcog.2011.08.022 · Cited by 184
Self-citationWagner, A., Wright, J., Ganesh, A., Zhou, Z., & Ma, Y. (2009) · 2009 IEEE Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2009.5206654 · Cited by 183
Learning with structured sparsity
Huang, J., Zhang, T., & Metaxas, D. (2009) · Proceedings of the 26th Annual International Conference on Machine Learning · doi:10.1145/1553374.1553429 · Cited by 182
A variable-penalty alternating directions method for convex optimization
Kontogiorgis, S. A., & Meyer, R. R. (1998) · Mathematical Programming · doi:10.1007/bf02680549 · Cited by 144
Robust regression for face recognition
Naseem, I., Togneri, R. B., & Bennamoun, M. (2011) · Pattern Recognition · doi:10.1016/j.patcog.2011.07.003 · Cited by 139
He, B., & Yang, H. (1998) · Operations Research Letters · doi:10.1016/s0167-6377(98)00044-3 · Cited by 134
Structured Sparse Error Coding for Face Recognition With Occlusion
Li, X., Dai, D., Zhang, X., & Ren, C.-X. (2013) · IEEE Transactions on Image Processing · doi:10.1109/tip.2013.2237920 · Cited by 122
Robust and Practical Face Recognition via Structured Sparsity
Jia, K., Chan, T., & Ma, Y. (2012) · Lecture notes in computer science · doi:10.1007/978-3-642-33765-9_24 · Cited by 120
A Regularized Correntropy Framework for Robust Pattern Recognition
He, R., Zheng, W., Hu, B.-G., & Kong, X. (2011) · Neural Computation · doi:10.1162/neco_a_00155 · Cited by 113
On the Global and Linear Convergence of the Generalized Alternating Direction Method of Multipliers
Deng, W., & Yin, W. (2012) · doi:10.21236/ada567407 · Cited by 96
On first-order algorithms forl1/nuclear norm minimization
Nesterov, Y. E., & Nemirovski, A. S. (2013) · Acta Numerica · doi:10.1017/s096249291300007x · Cited by 58
Recovery of corrupted low-rank matrices via half-quadratic based nonconvex minimization
He, R., Sun, Z., Tan, T., & Zheng, W. (2011) · IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings · doi:10.1109/cvpr.2011.5995328 · Cited by 48
Learning Hierarchical and Topographic Dictionaries with Structured Sparsity
Mairal, J., Jenatton, R., Obozinski, G., & Bach, F. (2012) · Cited by 18
Cited by
FSRNet: End-to-End Learning Face Super-Resolution with Facial Priors
Chen, Y., Tai, Y., Liu, X., Shen, C., & Yang, J. (2018) · 2018 IEEE/CVF Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2018.00264 · Cited by 581
Self-citationLi, J., Wang, Y., Wang, C., Tai, Y., Qian, J., Yang, J., Wang, C., Li, J., & Huang, F. (2019) · 2019 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR) · doi:10.1109/cvpr.2019.00520 · Cited by 488
Self-citationOcclusion Robust Face Recognition Based on Mask Learning With Pairwise Differential Siamese Network
Song, L., Gong, D., Li, Z., Liu, C., & Liu, W. (2019) · 2019 IEEE/CVF International Conference on Computer Vision (ICCV) · doi:10.1109/iccv.2019.00086 · Cited by 267
Wei, Y., Tao, R., Wu, Z., Ma, Y., Zhang, L., & Liu, X. (2020) · Proceedings of the 28th ACM International Conference on Multimedia · doi:10.1145/3394171.3413828 · Cited by 263
Metadata
- Authors
- Yang, J., Luo, L., Qian, J., Tai, Y., Zhang, F., & Xu, Y.
- Venue
- IEEE Transactions on Pattern Analysis and Machine Intelligence
- Published
- 2017-01-01
- Volume
- 39
- Issue
- 1
- Pages
- 156-171
- ISSN
- 0162-8828 (ISSN-L)
- 2160-9292
- OpenAlex
- W1600550542
- Cited by
- 360
- References
- 60
- FWCI
- 33.54
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.