Robust L1-norm two-dimensional collaborative representation-based projection for dimensionality reduction
Collaborative representation-based projection (CRP) is a well-known dimensionality reduction technique, which has been proved to have better performance than sparse representation-based projection (SRP) in the fields of recognition and computer vision. However, classical CRP is sensitive to noises a...
Gespeichert in:
Veröffentlicht in: | Signal processing. Image communication 2020-02, Vol.81, p.115684, Article 115684 |
---|---|
Hauptverfasser: | , , |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Zusammenfassung: | Collaborative representation-based projection (CRP) is a well-known dimensionality reduction technique, which has been proved to have better performance than sparse representation-based projection (SRP) in the fields of recognition and computer vision. However, classical CRP is sensitive to noises and outliers since its objective function is based on L2-norm, and it will suffer from the curse of dimensionality as it is used for images processing. In this paper, a novel CRP model, named L1-norm two-dimensional collaborative representation-based projection (L1-2DCRP) and an efficient iterative algorithm to solve it are proposed. Different from conventional CRP, the optimal problem in our proposed model is a L1-norm-based maximization and the vector data is extended to matrix date. The proposed algorithm is theoretically proved to be monotonously convergent, and more robust to noises and outliers since L1-norm is used. Experimental results on CMU Multi-PIE, COIL20, FERET and ORL face databases validate the effectiveness of L1-2DCRP compared with several state-of-the-art approaches.
•Introducing L1-norm into CRP and a novel model for dimensionality reduction, named L1-2DCRP, is proposed to make it more robustness to outliers.•The samples are extended form vectors to matrices.•A simple but effective iterative algorithm with convergence proved is proposed to solve L1-2DCRP.•Unlike the gradient used in many existing approaches for L1 norm optimization problem, a modified gradient is utilized and with a promising performance. |
---|---|
ISSN: | 0923-5965 1879-2677 |
DOI: | 10.1016/j.image.2019.115684 |