Incremental nonnegative matrix factorization for face recognition

DOI10.1155/2008/410674MaRDI QIDQ1023232zbMATH OpenOpenAlexWikidataFDO

Authors Wen-Sheng Chen, Binbin Pan, Bin Fang, Ming Li, Jianliang Tang

Publication date 11 June 2009

Published in Mathematical Problems in Engineering (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/55494

Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08)

Review text

Summary: Nonnegative matrix factorization (NMF) is a promising approach for local feature extraction in face recognition tasks. However, there are two major drawbacks in almost all existing NMF-based methods. One shortcoming is that the computational cost is expensive for large matrix decomposition. The other is that it must conduct repetitive learning, when the training samples or classes are updated. To overcome these two limitations, this paper proposes a novel incremental nonnegative matrix factorization (INMF) for face representation and recognition. The proposed INMF approach is based on a novel constraint criterion and our previous block strategy. It thus has some good properties, such as low computational complexity, sparse coefficient matrix. Also, the coefficient column vectors between different classes are orthogonal. In particular, it can be applied to incremental learning. Two face databases, namely FERET and CMU PIE face databases, are selected for evaluation. Compared with PCA and some state-of-the-art NMF-based methods, our INMF approach gives the best performance.

Recommendations

• Incremental graph regulated nonnegative matrix factorization for face recognition
• Incremental subspace learning via non-negative matrix factorization
• Nonnegative matrix factorization with manifold structure for face recognition
• scientific article; zbMATH DE number 2016125
• Orthogonal incremental non-negative matrix factorization algorithm and its application in image classification

Cites work

• Learning the parts of objects by non-negative matrix factorization
• Non-negative matrix factorization with sparseness constraints
• Projected Gradient Methods for Nonnegative Matrix Factorization

Cited in

(15)

• Incremental subspace learning via non-negative matrix factorization
• Incomplete time series prediction using max-margin classification of data with absent features
• Nonlinear nonnegative matrix factorization based on Mercer kernel construction
• Research of SWNMF with new iteration rules for facial feature extraction and recognition
• Incremental graph regulated nonnegative matrix factorization for face recognition
• Adaptive background modeling via incremental non-negative matrix factorization
• Locality preserving nonnegative matrix factorization with application to face recognition
• Localized versus locality preserving representation methods in face recognition tasks
• scientific article; zbMATH DE number 2016125 (Why is no real title available?)
• Block kernel nonnegative matrix factorization for face recognition
• Nonnegative matrix factorization with manifold structure for face recognition
• 2-dimensional Projective Non-negative Matrix Factorization and Its Application to Face Recognition
• Advances in Neural Networks – ISNN 2005
• Data fusion boosted face recognition based on probability distribution functions in different colour channels
• A new high-speed foreign fiber detection system with machine vision

Describes a project that uses

Uses Software

• FERET
• CMU PIE

This page was built for publication: Incremental nonnegative matrix factorization for face recognition

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1023232)