Robust Sparse Linear Discriminant Analysis
By Jie Wen, Xiaozhao Fang, Jinrong Cui, Lunke Fei, Ke Yan, Yan Chen, Yong Xu. IEEE transactions on circuits and systems for video technology (Print), 2019
329 citations recorded by the source corpus.
Linear discriminant analysis (LDA) is a very popular supervised feature extraction method and has been extended to different variants. However, classical LDA has the following problems: 1) The obtained discriminant projection does not have good interpretability for features; 2) LDA is sensitive to noise; and 3) LDA is sensitive to the selection of number of projection directions. In this paper, a novel feature extraction method called robust sparse linear discriminant analysis (RSLDA) is proposed to solve the above problems. Specifically, RSLDA adaptively selects the most discriminative features for discriminant analysis by introducing the $l_{2,1}$ norm. An orthogonal matrix and a sparse matrix are also simultaneously introduced to guarantee that the extracted features can hold the main energy of the original data and enhance the robustness to noise, and thus RSLDA has the potential to perform better than other discriminant methods. Extensive experiments on six databases demonstrate that the proposed method achieves the competitive performance compared with other state-of-the-art feature extraction methods. Moreover, the proposed method is robust to the noisy data.
Subfields: Computer Vision and Pattern Recognition, Media Technology, Urban Studies
View Paper: https://www.semanticscholar.org/paper/db3da1be27b591f4bb68fac369e132a66b26ac72
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Computer Vision and Pattern Recognition
In Media Technology
Citations in the corpus
- Incomplete Multiview Spectral Clustering With Adaptive Graph Learning (2020, background): “Problem (23) is a typical sparsity constraint optimization problem and has the following closed-form solution [46]–[48]:”