Incremental nonnegative matrix factorization for face recognition (Q1023232): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(6 intermediate revisions by 5 users not shown) | |||
Property / Wikidata QID | |||
Property / Wikidata QID: Q58646177 / rank | |||
Normal rank | |||
Property / describes a project that uses | |||
Property / describes a project that uses: FERET / rank | |||
Normal rank | |||
Property / describes a project that uses | |||
Property / describes a project that uses: CMU PIE / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2012573640 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Learning the parts of objects by non-negative matrix factorization / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3093232 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Projected Gradient Methods for Nonnegative Matrix Factorization / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 16:19, 1 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Incremental nonnegative matrix factorization for face recognition |
scientific article |
Statements
Incremental nonnegative matrix factorization for face recognition (English)
0 references
11 June 2009
0 references
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.
0 references