2DRLPP: Robust two-dimensional locality preserving projection with regularization

被引:15
作者
Chen, Wei-Jie [1 ,2 ]
Li, Chun-Na [1 ]
Shao, Yuan-Hai [3 ]
Zhang, Ju [1 ]
Deng, Nai-Yang [4 ]
机构
[1] Zhejiang Univ Technol, Zhijiang Coll, Hangzhou 310024, Zhejiang, Peoples R China
[2] Univ Technol Sydney, Ctr Artificial Intelligence, Sydney, NSW 2007, Australia
[3] Hainan Univ, Sch Econ & Management, Haikou 570228, Hainan, Peoples R China
[4] China Agr Univ, Coll Sci, Beijing 100083, Peoples R China
基金
中国国家自然科学基金;
关键词
Two-dimensional locality preserving projection; L-1-norm optimization; Robust modeling; Dimensionality reduction; SUPPORT VECTOR MACHINE; DIMENSIONALITY REDUCTION; DISCRIMINANT-ANALYSIS; FEATURE-SELECTION; FACE RECOGNITION; WEIGHT VECTOR; L1-NORM; CLASSIFICATION; SAMPLE; 2DPCA;
D O I
10.1016/j.knosys.2019.01.022
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
The recently proposed two-dimensional locality preserving projection (2DLPP) is an excellent matrix-based dimensionality reduction method. However, the formulation of 2DLPP may encounter several drawbacks in real-world applications, such as sensitiveness to outliers, non-orthogonal projections, and singularity problem. To alleviate these issues, in this paper, we propose a novel robust two-dimensional locality preserving projection (2DRLPP) for noisy image recognition. The proposed 2DRLPP preserves the local manifold structure of two-dimensional image space under the robust L-1-norm criterion. Different from the existing 2DLPP, our 2DRLPP enjoys several incomparable advantages: (i) 2DRLPP extracts projections from matrix-based image space via the L-1-norm locality preserving criterion rather than the L-2-norm one, and hence it is more robust to outliers. (ii) The orthogonality constraint is further imposed on 2DRLPP to ensure its orthogonal projections. (iii) The introduced regularization term can not only control the model complexity but also guarantee the stability of solution. (iv) A simple but efficient iterative algorithm is presented to solve the corresponding L-1-norm minimization problem, whose convergence is guaranteed theoretically. Extensive experimental results on three noisy face image datasets confirm the feasibility and robustness of the proposed approach. (C) 2019 Elsevier B.V. All rights reserved.
引用
收藏
页码:53 / 66
页数:14
相关论文
共 51 条
[1]  
[Anonymous], 2004, TECH REP
[2]  
[Anonymous], 2004, P C NEURAL INFORM PR
[3]   Eigenfaces vs. Fisherfaces: Recognition using class specific linear projection [J].
Belhumeur, PN ;
Hespanha, JP ;
Kriegman, DJ .
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 1997, 19 (07) :711-720
[4]  
Belkin P.N.M., 2003, NEURAL COMPUT, V15
[5]   Feature Selection Based on the SVM Weight Vector for Classification of Dementia [J].
Bron, Esther E. ;
Smits, Marion ;
Niessen, Wiro J. ;
Klein, Stefan .
IEEE JOURNAL OF BIOMEDICAL AND HEALTH INFORMATICS, 2015, 19 (05) :1617-1626
[6]   A dimension reduction algorithm preserving both global and local clustering structure [J].
Cai, Weiling .
KNOWLEDGE-BASED SYSTEMS, 2017, 118 :191-203
[7]   Robust L1-norm multi-weight vector projection support vector machine with efficient algorithm [J].
Chen, Wei-Jie ;
Li, Chun-Na ;
Shao, Yuan-Hai ;
Zhang, Ju ;
Deng, Nai-Yang .
NEUROCOMPUTING, 2018, 315 :345-361
[8]   MLTSVM: A novel twin support vector machine to multi-label learning [J].
Chen, Wei-Jie ;
Shao, Yuan -Hai ;
Li, Chun-Na ;
Deng, Nai-Yang .
PATTERN RECOGNITION, 2016, 52 :61-74
[9]   Laplacian least squares twin support vector machine for semi-supervised classification [J].
Chen, Wei-Jie ;
Shao, Yuan-Hai ;
Deng, Nai-Yang ;
Feng, Zhi-Lin .
NEUROCOMPUTING, 2014, 145 :465-476
[10]   Laplacian smooth twin support vector machine for semi-supervised classification [J].
Chen, Wei-Jie ;
Shao, Yuan-Hai ;
Hong, Ning .
INTERNATIONAL JOURNAL OF MACHINE LEARNING AND CYBERNETICS, 2014, 5 (03) :459-468