Abstract
In order to solve the problem of feature extraction and classification of Non-negative Matrix Factorization (NMF) in face recognition, a Linear Projective Non-negative Matrix Factorization method based on Kullback-Leibler divergence (LP-NMF-DIV) is proposed. In LP-NMF-DIV, an objective function of Kullback-Leibler divergence is considered. The Taylor series expansion and the Newton iteration formula are used to find the root formula. The iterative algorithm of basis matrix and linear transformation matrix are derived, and the convergence of the algorithm is proved. The results of experimental show that the algorithm is convergent. In face recognition, compared with some typical NMF methods, the algorithm has high recognition accuracy; when the ranks of the basis matrices are set to different values, the algorithm is stable. The method for LP-NMF-DIV is effective.
Sign-in/Register to access full text options 
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
