Two dimensional nonnegative matrix factorization

Authors:
Quanquan Gu;Jie Zhou
Affiliations:
State Key Laboratory on Intelligent Technology and Systems, Tsinghua National Laboratory for Information Science and Technology, Department of Automation, Tsinghua University, Beijing, China;State Key Laboratory on Intelligent Technology and Systems, Tsinghua National Laboratory for Information Science and Technology, Department of Automation, Tsinghua University, Beijing, China
Venue:
ICIP'09 Proceedings of the 16th IEEE international conference on Image processing
Year:
2009

Citing 4
Cited 0

Two-Dimensional PCA: A New Approach to Appearance-Based Face Representation and Recognition

IEEE Transactions on Pattern Analysis and Machine Intelligence
Convex Optimization

Convex Optimization
Generalized low rank approximations of matrices

ICML '04 Proceedings of the twenty-first international conference on Machine learning
Non-negative Matrix-Set Factorization

ICIG '07 Proceedings of the Fourth International Conference on Image and Graphics

Quantified Score

Hi-index	0.00

Visualization

Abstract

Nonnegative Matrix Factorization (NMF) has been widely used in computer vision and pattern recognition. It aims to find two non-negative matrices whose product can well approximate the original matrix, which naturally leads to parts-based representation. In this paper, we propose a Two Dimensional Nonnegative Matrix Factorization (2DNMF), specifically for a sequence of matrices. In contrast to NMF which applies for only a single matrix, and finds only one base matrix, 2DNMF aims to find two base matrices to represent the input matrices in a low dimensional matrix subspace. It not only inherits the advantages of NMF, but also owns the properties low computational complexity, as well as high recognition accuracy. Experiments on benchmark image recognition data sets illustrate that the proposed method is very effective and efficient.