Nonconvex Rank Relaxations based Matrix Regression for Face Reconstruction and Recognition

被引:2
作者
Zhang, Hengmin [1 ]
Du, Wenli [1 ]
Li, Zhongmei [1 ]
Liu, Xiaoqian [2 ]
Long, Jian [1 ]
Qian, Feng [1 ]
机构
[1] East China Univ Sci & Technol, Sch Informat Sci & Engn, Shanghai, Peoples R China
[2] Jiangsu Police Inst, Dept Comp Informat & Cyber Secur, Nanjing, Peoples R China
来源
2020 CHINESE AUTOMATION CONGRESS (CAC 2020) | 2020年
基金
中国国家自然科学基金; 中国博士后科学基金;
关键词
Matrix regression methods; Nonconvex rank relaxations; ADMM; Convergence analysis; Face reconstruction; Face recognition; NORM;
D O I
10.1109/CAC51589.2020.9326890
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
As we know, nuclear norm based matrix regression (NMR) methods have the popular applications to face reconstruction and recognition with occlusion and illumination changes. However, when facing larger occlusions and heavier illuminations in real-world applications, these methods usually can not work well due to the biased estimator of nuclear norm as the rank relaxation. To overcome this issue, noconvex matrix regression approaches are presented by generalized nonconvex rank relaxations derived from several to-norm substitutes, to characterize the low-rank structure of the residual image matrix. The representation coefficient vectors can be achieved with the help of nonconvex and even multi-variables alternating direction method of multipliers (ADMM) with theoretical analysis to optimize the developed problems and guarantee the closed-form solution of each subproblem, synchronously. Moreover, we design the minimal representation formula for the residual matrix as a decision rule. Finally, experimental results on face reconstruction and recognition can show the superiority of the proposed methodologies over the mostly related matrix regression methods including Li-norm and l2-norm regularized NMR methods.
引用
收藏
页码:2335 / 2340
页数:6
相关论文
共 25 条
[1]   A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems [J].
Beck, Amir ;
Teboulle, Marc .
SIAM JOURNAL ON IMAGING SCIENCES, 2009, 2 (01) :183-202
[2]  
Border K., 2001, SUPERGRADIENT CONCAV
[3]   Decomposition into low-rank plus additive matrices for background/foreground separation: A review for a comparative evaluation with a large-scale dataset [J].
Bouwmans, Thierry ;
Sobral, Andrews ;
Javed, Sajid ;
Jung, Soon Ki ;
Zahzah, El-Hadi .
COMPUTER SCIENCE REVIEW, 2017, 23 :1-71
[4]   Distributed optimization and statistical learning via the alternating direction method of multipliers [J].
Boyd S. ;
Parikh N. ;
Chu E. ;
Peleato B. ;
Eckstein J. .
Foundations and Trends in Machine Learning, 2010, 3 (01) :1-122
[5]   Robust Subspace Segmentation Via Low-Rank Representation [J].
Chen, Jinhui ;
Yang, Jian .
IEEE TRANSACTIONS ON CYBERNETICS, 2014, 44 (08) :1432-1445
[6]  
Fazel M, 2001, P AMER CONTR CONF, P4734, DOI 10.1109/ACC.2001.945730
[7]   Fast sparse regression and classification [J].
Friedman, Jerome H. .
INTERNATIONAL JOURNAL OF FORECASTING, 2012, 28 (03) :722-738
[8]  
Gao C., 2011, P AAAI C ART INT, P356
[9]   NONLINEAR IMAGE RECOVERY WITH HALF-QUADRATIC REGULARIZATION [J].
GEMAN, D ;
YANG, CD .
IEEE TRANSACTIONS ON IMAGE PROCESSING, 1995, 4 (07) :932-946
[10]  
Hu Z, 2018, ARXIV180804521