nonnegative matrix factorization (nmf), which aims at obtaining the nonnegative low-dimensional representation of data, has received wide attention. to obtain more effective nonnegative discriminant bases from the original nmf, in this paper, a novel method called nonnegative discriminant matrix factorization (ndmf) is proposed for image classification. ndmf integrates the nonnegative constraint, orthogonality, and discriminant information in the objective function. ndmf considers the incoherent information of both factors in standard nmf and is proposed to enhance the discriminant ability of the learned base matrix. ndmf projects the low-dimensional representation of the subspace of the base matrix to regularize the nmf for discriminant subspace learning. based on the euclidean distance metric and the generalized kullback-leibler (kl) divergence, two kinds of iterative algorithms are presented to solve the optimization problem. the between-and within-class scatter matrices are divided into positive and negative parts for the update rules and the proofs of the convergence are also presented. extensive experimental results demonstrate the effectiveness of the proposed method in comparison with the state-of-the-art discriminant nmf algorithms.