Robust locality preserving projection based on maximum correntropy criterion

被引:16
作者
Zhong, Fujin [1 ,2 ]
Li, Defang [1 ]
Zhang, Jiashu [1 ]
机构
[1] Southwest Jiaotong Univ, Sichuan Prov Key Lab Signal & Informat Proc, Chengdu 610031, Peoples R China
[2] Yibin Univ, Sch Comp & Informat Engn, Yibin 644000, Peoples R China
基金
美国国家科学基金会;
关键词
Locality preserving projections; Outliers; Robustness; Half-quadratic optimization; Correntropy; Maximum correntropy criterion; Optimization; Dimensionality reduction; DIMENSIONALITY REDUCTION; MULTIVIEW; EIGENMAPS;
D O I
10.1016/j.jvcir.2014.08.004
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Conventional local preserving projection (LPP) is sensitive to outliers because its objective function is based on the L2-norm distance criterion and suffers from the small sample size (SSS) problem. To improve the robustness of LPP against outliers, LPP-L1 uses L1-norm distance metric. However, LPP-L1 does not work ideally when there are larger outliers. We propose a more robust version of LPP, called LPP-MCC, which formulates the objective problem based on maximum correntropy criterion (MCC). The objective problem is efficiently solved via a half-quadratic optimization procedure and the complicated non-linear optimization procedure can thereby be reduced to a simple quadratic optimization at each iteration. Moreover, LPP-MCC avoids the SSS problem because the generalized eigenvalues computation is not involved in the optimization procedure. The experimental results on both synthetic and real-world databases demonstrate that the proposed method can outperform LPP and LPP-L1 when there are large outliers in the training data. (C) 2014 Elsevier Inc. All rights reserved.
引用
收藏
页码:1676 / 1685
页数:10
相关论文
共 46 条
[1]  
[Anonymous], 2003, P ADV NEUR INF PROC
[2]  
[Anonymous], 2005, ELEMENTS INFORM THEO, DOI DOI 10.1002/047174882X
[3]  
[Anonymous], 2002, ADV NEURAL INFORM PR
[4]  
[Anonymous], UNSUPERVISED ADAPTIV
[5]  
[Anonymous], ARXIV12073438V1STATM
[6]  
[Anonymous], 2009, 2009 INT C MANAGEMEN, DOI DOI 10.1109/ICMSS.2009.5304217
[7]   Laplacian eigenmaps for dimensionality reduction and data representation [J].
Belkin, M ;
Niyogi, P .
NEURAL COMPUTATION, 2003, 15 (06) :1373-1396
[8]  
Boyd S., 2004, CONVEX OPTIMIZATION, VFirst, DOI DOI 10.1017/CBO9780511804441
[9]   MAXIMUM VARIANCE DIFFERENCE BASED EMBEDDING APPROACH FOR FACIAL FEATURE EXTRACTION [J].
Chen, Xi ;
Zhang, Jiashu .
INTERNATIONAL JOURNAL OF PATTERN RECOGNITION AND ARTIFICIAL INTELLIGENCE, 2010, 24 (07) :1047-1060
[10]  
Dahyot R, 2000, PROC CVPR IEEE, P685, DOI 10.1109/CVPR.2000.855886