Abstract

The non-negative matrix factorization (NMF) algorithm represents the original image as a linear combination of a set of basis images. This image representation method is in line with the idea of "parts constitute a whole" in human thinking. The existing deep NMF performs deep factorization on the coefficient matrix. In these methods, the basis images used to represent the original image is essentially obtained by factorizing the original images once. To extract features reflecting the deep localization characteristics of images, a novel deep NMF architecture based on underlying basis images learning is proposed for the first time. The architecture learns the underlying basis images by deep factorization on the basis images matrix. The deep factorization architecture proposed in this paper has strong interpretability. To implement this architecture, this paper proposes a deep non-negative basis matrix factorization algorithm to obtain the underlying basis images. Then, the objective function is established with an added regularization term, which directly constrains the basis images matrix to obtain the basis images with good local characteristics, and a regularized deep non-negative basis matrix factorization algorithm is proposed. The regularized deep nonlinear non-negative basis matrix factorization algorithm is also proposed to handle pattern recognition tasks with complex data. This paper also theoretically proves the convergence of the algorithm. Finally, the experimental results show that the deep NMF architecture based on the underlying basis images learning proposed in this paper can obtain better recognition performance than the other state-of-the-art methods.

Highlights

  • IN the field of artificial intelligence currently, the data often has a higher dimension

  • 6.4 Analysis on the Basis Images In order to observe the basis images obtained by the proposed algorithms based on the underlying basis images learning (UBIL) intuitively, we present the basis images learned by negative matrix factorization (NMF), deep semi NMF (DSNMF) and deep non-negative basis matrix factorization (DNBMF), regularized deep non-negative basis matrix factorization (RDNBMF) and regularized deep nonlinear nonnegative basis matrix factorization (RDNNBMF), and make an intuitive comparison

  • This paper proposes a novel deep NMF architecture based on the UBIL and applies it to face recognition tasks

Read more

Summary

Introduction

IN the field of artificial intelligence currently, the data often has a higher dimension. Researchers have conducted a lot of studies on the dimension reduction sample representation. First proposed by Lee et al, the NMF algorithm represented the original image sample as a combination of a set of basis images [1], [2]. The original samples in the NMF algorithm can be reconstructed by the set of basis images, and the reconstruction coefficient is a new feature of the original sample. This sample representation based on the combination of the basis vectors has a very intuitive semantic interpretation, reflecting the concept of “parts constitute a whole” in human thinking.

Methods
Results
Conclusion
Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call