Submit Manuscript

Information Technology Journal

Year: 2010 | Volume: 9 | Issue: 8 | Page No.: 1719-1724
Facebook Twitter Digg Reddit Linkedin StumbleUpon E-mail

Article Trend

Total views 386

Search

Authors

Hongli Yang

Guoping He

Keywords

Research Article

Online Face Recognition Algorithm via Nonnegative Matrix Factorization

Hongli Yang and Guoping He
In this study, a novel algorithm is presented for dealing with the online data based on nonnegative matrix factorization model. Nonnegative Matrix Factorization (NMF) is a promising approach for face recognition in that it is capable of extracting the local features by factorizing the nonnegative matrix into two nonnegative matrices. However, there are two major weaknesses in almost all the existing NMF based methods. The first shortcoming is that the computational cost is high for large matrix factorization, it also needs more memory to save the huge data. The other is that it must conduct repetitive learning when the data samples are updated. To overcome these two limitations, a novel Online Nonnegative Matrix Factorization (ONMF) algorithm for online face recognition is presented in this study. The ONMF algorithm can not only deal with the incremental nonnegative matrix factorization, but also can deal with the decremental nonnegative matrix factorization which has never been considered in other study. Two face databases, namely ORL and FERET face database, are selected for evaluation. Compared with the conventional standard NMF, the method in this study gives the better performance both in computational costs and other aspects.
PDF Fulltext XML References Citation

Leave a Comment

Your email address will not be published. Required fields are marked *