Anzeige
Erschienen in:
2014 | OriginalPaper | Buchkapitel
Image Feature Extraction via Graph Embedding Regularized Projective Non-negative Matrix Factorization
verfasst von : Haishun Du, Qingpu Hu, Xudong Zhang, Yandong Hou
Erschienen in: Pattern Recognition
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
Non-negative matrix factorization (NMF) has been widely used in image processing and pattern recognition fields. Unfortunately, NMF does not consider the geometrical structure and the discriminative information of data, which might make it unsuitable for classification tasks. In addition, NMF only calculates the coefficient matrix of the training data and how to yields the coefficient vector of a new test data is still obscure. In this paper, we propose a novel graph embedding regularized projective non-negative matrix factorization (GEPNMF) method to address the aforementioned problems. By introducing a graph embedding regularization term, the learned subspace can preserve the local geometrical structure of data while maximizing the margins of different classes. We deduce a multiplicative update rule (MUR) to iteratively solve the objective function of GEPNMF and prove its convergence in theory. Experimental results on ORL and CMU PIE databases suggest the effectiveness of GEPNMF.