A constrained algorithm based NMF\(_\alpha\) for image representation (Q2320680)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7097557
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A constrained algorithm based NMF\(_\alpha\) for image representation |
scientific article; zbMATH DE number 7097557 |
Statements
A constrained algorithm based NMF\(_\alpha\) for image representation (English)
0 references
23 August 2019
0 references
Summary: Nonnegative matrix factorization (NMF) is a useful tool in learning a basic representation of image data. However, its performance and applicability in real scenarios are limited because of the lack of image information. In this paper, we propose a constrained matrix decomposition algorithm for image representation which contains parameters associated with the characteristics of image data sets. Particularly, we impose label information as additional hard constraints to the \(\alpha\)-divergence-NMF unsupervised learning algorithm. The resulted algorithm is derived by using Karush-Kuhn-Tucker (KKT) conditions as well as the projected gradient and its monotonic local convergence is proved by using auxiliary functions. In addition, we provide a method to select the parameters to our semisupervised matrix decomposition algorithm in the experiment. Compared with the state-of-the-art approaches, our method with the parameters has the best classification accuracy on three image data sets.
0 references
0.816344678401947
0 references
0.8044623136520386
0 references
0.8021410703659058
0 references
0.7970922589302063
0 references
0.7897817492485046
0 references