Deep Non-Negative Matrix Factorization Architecture Based on Underlying Basis Images Learning

• Published in: IEEE transactions on pattern analysis and machine intelligence Vol. 43; no. 6; pp. 1897 - 1913
• Main Authors: Zhao, Yang, Wang, Huiyang, Pei, Jihong
• Format: Journal Article
• Language: English
• Published: United States IEEE 01.06.2021; The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
• Subjects: Algorithms; Convergence; Data analysis; deep factorization architecture; face recognition; Factorization; Feature extraction; Image reconstruction; Kernel; Linear programming; Machine learning; Mathematical analysis; Matrix methods; Non-negative matrix factorization; Object recognition; Pattern recognition; Regularization; Sparse matrices; Task complexity; underlying basis images
• ISSN: 0162-8828; 1939-3539; 2160-9292; 2160-9292; 1939-3539
• DOI: 10.1109/TPAMI.2019.2962679

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.