F-norm distance metric based robust 2DPCA and face recognition
From MaRDI portal
Publication:2292235
DOI10.1016/j.neunet.2017.07.011zbMath1429.68231OpenAlexW2737074540WikidataQ38625646 ScholiaQ38625646MaRDI QIDQ2292235
Mengyuan Li, Tao Li, De-Yan Xie, Quan-Xue Gao
Publication date: 3 February 2020
Published in: Neural Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.neunet.2017.07.011
Factor analysis and principal components; correspondence analysis (62H25) Learning and adaptive systems in artificial intelligence (68T05) Pattern recognition, speech recognition (68T10)
Related Items (1)
Cites Work
- 2DPCA with L1-norm for simultaneously robust and sparse modelling
- Robust L1-norm two-dimensional linear discriminant analysis
- Two-dimensional discriminant transform for face recognition
- Recovering low-rank and sparse matrix based on the truncated nuclear norm
- L1-norm-based principal component analysis with adaptive regularization
- Robust principal component analysis?
- Optimal Algorithms for <formula formulatype="inline"> <tex Notation="TeX">$L_{1}$</tex></formula>-subspace Signal Processing
- Joint Low-Rank and Sparse Principal Feature Coding for Enhanced Robust Representation and Visual Classification
- A Non-Greedy Algorithm for L1-Norm LDA
- Laplacian Eigenmaps for Dimensionality Reduction and Data Representation
- Inductive Robust Principal Component Analysis
- Linear Discriminant Analysis Based on L1-Norm Maximization
- Two-Dimensional Maximum Local Variation Based on Image Euclidean Distance for Face Recognition
This page was built for publication: F-norm distance metric based robust 2DPCA and face recognition
