Robust non-negative supervised low-rank discriminant embedding algorithm

Abstract

Non-negative matrix factorization (NMF) has been widely used.However, NMF pays more attention to the local information of the data, it ignores the global representation of the data.In terms of image classification, the global information of the data is often more robust to noise than the local information.In order to improve the robustness of the algorithm, combined with the data of local and global representation, and considered the characteristics of low-rank representation, a non-negative supervised low-rank discriminant embedded algorithm was proposed.This algorithm assumed the existence of noise in the data, decomposed the data into clean data and noise data, and made sparse constraints on the noise matrix through the L1norm, so as to enhance the robustness to noise.In addition, the algorithm used low-rank representation to learn a low-rank matrix, then through non-negative decomposition, the robustness of the algorithm was enhanced again.Finally, combined with a study of graph embedding method, the local and global data were retained at the same time.The algorithm is applied to various noisy databases, and the recognition rate of this algorithm is improved by about 5%～15% compared with the comparison algorithm.

Keywords

• non-negative matrix factorization;low-rank representation;feature extraction;graph embedding