On the initialization of the DNMF algorithm

• Published in: 2006 IEEE International Symposium on Circuits and Systems (ISCAS) p. 4 pp.
• Main Authors: Buciu, I., Nikolaidis, N., Pitas, I.
• Format: Conference Proceeding
• Language: English
• Published: IEEE 2006
• Subjects: Cost function; Humans; Image databases; Informatics; Least squares approximation; Matrix decomposition; Minimization methods; Pixel; Scattering; Supervised learning
• ISBN: 0780393899; 9780780393899
• ISSN: 0271-4302; 2158-1525
• DOI: 10.1109/ISCAS.2006.1693672

A subspace supervised learning algorithm named discriminant non-negative matrix factorization (DNMF) has been recently proposed for classifying human facial expressions. It decomposes images into a set of basis images and corresponding coefficients. Usually, the algorithm starts with random basis image and coefficient initialization. Then, at each iteration, both basis images and coefficients are updated to minimize the underlying cost function. The algorithm may need several thousands of iterations to obtain cost function minimization. We provide a way to significantly improve the speed of the algorithm convergence by constructing initial basis images that meet the sparseness and orthogonality requirements and approximate the final minimization solution. To experimentally evaluate the new approach, we have applied DNMF using the random and the proposed initialization procedure to recognize six basic facial expressions. While fewer iteration steps are needed with the proposed initialization, the recognition accuracy remains within satisfactory levels