Cosine Multilinear Principal Component Analysis for Recognition

被引:4
作者
Han, Feng [1 ]
Leng, Chengcai [1 ]
Li, Bing [2 ]
Basu, Anup [3 ]
Jiao, Licheng [4 ]
机构
[1] Northwest Univ, Sch Math, Xian 710127, Shaanxi, Peoples R China
[2] Chinese Acad Sci, Inst Automat, Natl Lab Pattern Recognit, Beijing 100190, Peoples R China
[3] Univ Alberta, Dept Comp Sci, Edmonton, AB T6G 2E8, Canada
[4] Xidian Univ, Sch Artificial Intelligence, Key Lab Intelligent Percept & Image Understanding, Minist Educ, Xian 710071, Shaanxi, Peoples R China
基金
加拿大自然科学与工程研究理事会; 中国国家自然科学基金;
关键词
Tensors; Principal component analysis; Mathematical models; Linear programming; Iterative methods; Robustness; Matrix decomposition; Multilinear principal component analysis; angle; tensor analysis; pattern recognition; ROBUST TENSOR ANALYSIS; FACE RECOGNITION; 2DPCA; REPRESENTATION; NORM; PCA; MAXIMIZATION; L1-NORM;
D O I
10.1109/TBDATA.2023.3301389
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Existing two-dimensional principal component analysis methods can only handle second-order tensors (i.e., matrices). However, with the advancement of technology, tensors of order three and higher are gradually increasing. This brings new challenges to dimensionality reduction. Thus, a multilinear method called MPCA was proposed. Although MPCA can be applied to all tensors, using the square of the F-norm makes it very sensitive to outliers. Several two-dimensional methods, such as Angle 2DPCA, have good robustness but cannot be applied to all tensors. We extend the robust Angle 2DPCA method to a multilinear method and propose Cosine Multilinear Principal Component Analysis (CosMPCA) for tensor representation. Our CosMPCA method considers the relationship between the reconstruction error and projection scatter and selects the cosine metric. In addition, our method naturally uses the F-norm to reduce the impact of outliers. We introduce an iterative algorithm to solve CosMPCA. We provide detailed theoretical analysis in both the proposed method and the analysis of the algorithm. Experiments show that our method is robust to outliers and is suitable for tensors of any order.
引用
收藏
页码:1620 / 1630
页数:11
相关论文
共 57 条
[1]   A general tensor representation framework for cross-view gait recognition [J].
Ben, Xianye ;
Zhang, Peng ;
Lai, Zhihui ;
Yan, Rui ;
Zhai, Xinliang ;
Meng, Weixiao .
PATTERN RECOGNITION, 2019, 90 :87-98
[2]   Graph Regularized Nonnegative Matrix Factorization for Data Representation [J].
Cai, Deng ;
He, Xiaofei ;
Han, Jiawei ;
Huang, Thomas S. .
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 2011, 33 (08) :1548-1560
[3]   Robust Principal Component Analysis? [J].
Candes, Emmanuel J. ;
Li, Xiaodong ;
Ma, Yi ;
Wright, John .
JOURNAL OF THE ACM, 2011, 58 (03)
[4]   Robust Subspace Segmentation Via Low-Rank Representation [J].
Chen, Jinhui ;
Yang, Jian .
IEEE TRANSACTIONS ON CYBERNETICS, 2014, 44 (08) :1432-1445
[5]   Face recognition based on multi-class mapping of Fisher scores [J].
Chen, L ;
Man, H ;
Nefian, AV .
PATTERN RECOGNITION, 2005, 38 (06) :799-811
[6]  
Ding C., 2006, P 23 INT C MACH LEAR, P281, DOI DOI 10.1145/1143844.1143880
[7]   Convex and Semi-Nonnegative Matrix Factorizations [J].
Ding, Chris ;
Li, Tao ;
Jordan, Michael I. .
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 2010, 32 (01) :45-55
[8]   Jointly learning compact multi-view hash codes for few-shot FKP recognition [J].
Fei, Lunke ;
Zhang, Bob ;
Wen, Jie ;
Teng, Shaohua ;
Li, Shuyi ;
Zhang, David .
PATTERN RECOGNITION, 2021, 115
[9]   R1-2-DPCA and Face Recognition [J].
Gao, Quanxue ;
Xu, Sai ;
Chen, Fang ;
Ding, Chris ;
Gao, Xinbo ;
Li, Yunsong .
IEEE TRANSACTIONS ON CYBERNETICS, 2019, 49 (04) :1212-1223
[10]   Angle 2DPCA: A New Formulation for 2DPCA [J].
Gao, Quanxue ;
Ma, Lan ;
Liu, Yang ;
Gao, Xinbo ;
Nie, Feiping .
IEEE TRANSACTIONS ON CYBERNETICS, 2018, 48 (05) :1672-1678