Incremental graph regulated nonnegative matrix factorization for face recognition (Q2336834): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
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: Subclass discriminant nonnegative matrix factorization for facial image analysis / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: NeNMF: An Optimal Gradient Method for Nonnegative Matrix Factorization / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Projective Nonnegative Graph Embedding / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Incremental subspace learning via non-negative matrix factorization / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Incremental nonnegative matrix factorization for face recognition / rank | |||
Normal rank |
Latest revision as of 00:44, 21 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Incremental graph regulated nonnegative matrix factorization for face recognition |
scientific article |
Statements
Incremental graph regulated nonnegative matrix factorization for face recognition (English)
0 references
19 November 2019
0 references
Summary: In a real world application, we seldom get all images at one time. Considering this case, if a company hired an employee, all his images information needs to be recorded into the system; if we rerun the face recognition algorithm, it will be time consuming. To address this problem, In this paper, firstly, we proposed a novel subspace incremental method called incremental graph regularized nonnegative matrix factorization (IGNMF) algorithm which imposes manifold into incremental nonnegative matrix factorization algorithm (INMF); thus, our new algorithm is able to preserve the geometric structure in the data under incremental study framework; secondly, considering we always get many face images belonging to one person or many different people as a batch, we improved our IGNMF algorithms to Batch-IGNMF algorithms (B-IGNMF), which implements incremental study in batches. Experiments show that (1) the recognition rate of our IGNMF and B-IGNMF algorithms is close to GNMF algorithm while it runs faster than GNMF. (2) The running times of our IGNMF and B-IGNMF algorithms are close to INMF while the recognition rate outperforms INMF. (3) Comparing with other popular NMF-based face recognition incremental algorithms, our IGNMF and B-IGNMF also outperform then both the recognition rate and the running time.
0 references