Simultaneous Robust Matching Pursuit for Multi-view Learning

被引:7
作者
Wang, Yulong [1 ]
Kou, Kit Ian [2 ]
Chen, Hong [3 ]
Tang, Yuan Yan [2 ]
Li, Luoqing [4 ]
机构
[1] Huazhong Agr Univ, Coll Informat, Wuhan 430070, Peoples R China
[2] Univ Macau, Fac Sci & Technol, Macau 999078, Peoples R China
[3] Huazhong Agr Univ, Coll Sci, Wuhan 430070, Peoples R China
[4] Hubei Univ, Fac Math & Stat, Wuhan 430062, Peoples R China
基金
中国国家自然科学基金;
关键词
Greedy algorithm; Multi-view learning; M-estimator; Sparse learning; JOINT SPARSE REPRESENTATION; REGRESSION; RECOVERY; MINIMIZATION; RECOGNITION; ALGORITHMS; SIGNAL;
D O I
10.1016/j.patcog.2022.109100
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Joint sparse representation (JSR) has attracted massive attention with many successful applications in pattern recognition recently. In this paper, we propose a novel robust multi-view JSR method referred to as Simultaneous Robust Matching Pursuit (SRMP) based on the outlier-resistant M-estimator originating from robust statistics. Because of the complexity of the objective function, we design an efficient optimization algorithm to implement SRMP based on the half-quadratic theory. In addition, we have also extended the proposed method for the problems of multi-view subspace clustering and multi-view pattern classification, respectively. The experimental results corroborate the efficacy and robustness of SRMP for multi-view data recovery, subspace clustering and classification.(c) 2022 Elsevier Ltd. All rights reserved.
引用
收藏
页数:13
相关论文
共 37 条
[1]   Face description with local binary patterns:: Application to face recognition [J].
Ahonen, Timo ;
Hadid, Abdenour ;
Pietikainen, Matti .
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 2006, 28 (12) :2037-2041
[2]  
[Anonymous], 1998, The AR Face Database
[3]   Greedy Algorithms for Joint Sparse Recovery [J].
Blanchard, Jeffrey D. ;
Cermak, Michael ;
Hanle, David ;
Jing, Yirong .
IEEE TRANSACTIONS ON SIGNAL PROCESSING, 2014, 62 (07) :1694-1704
[4]   Iterative hard thresholding for compressed sensing [J].
Blumensath, Thomas ;
Davies, Mike E. .
APPLIED AND COMPUTATIONAL HARMONIC ANALYSIS, 2009, 27 (03) :265-274
[5]   Multi-view low-rank sparse subspace clustering [J].
Brbic, Maria ;
Kopriva, Ivica .
PATTERN RECOGNITION, 2018, 73 :247-258
[6]   Theoretical results on sparse representations of multiple-measurement vectors [J].
Chen, Jie ;
Huo, Xiaoming .
IEEE TRANSACTIONS ON SIGNAL PROCESSING, 2006, 54 (12) :4634-4643
[7]   Sparse Subspace Clustering: Algorithm, Theory, and Applications [J].
Elhamifar, Ehsan ;
Vidal, Rene .
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 2013, 35 (11) :2765-2781
[8]   Block-Sparse Recovery via Convex Optimization [J].
Elhamifar, Ehsan ;
Vidal, Rene .
IEEE TRANSACTIONS ON SIGNAL PROCESSING, 2012, 60 (08) :4094-4107
[9]   HARD THRESHOLDING PURSUIT: AN ALGORITHM FOR COMPRESSIVE SENSING [J].
Foucart, Simon .
SIAM JOURNAL ON NUMERICAL ANALYSIS, 2011, 49 (06) :2543-2563
[10]   NONLINEAR IMAGE RECOVERY WITH HALF-QUADRATIC REGULARIZATION [J].
GEMAN, D ;
YANG, CD .
IEEE TRANSACTIONS ON IMAGE PROCESSING, 1995, 4 (07) :932-946