DocumentCode :
3728281
Title :
Robust Local Coordinate Non-negative Matrix Factorization via Maximum Correntropy Criteria
Author :
Qing Liao;Xiang Zhang;Naiyang Guan;Qian Zhang
Author_Institution :
Dept. of Comput. Sci. &
fYear :
2015
Firstpage :
2204
Lastpage :
2209
Abstract :
Non-negative matric factorization (NMF) decomposes a given data matrix X into the product of two lower dimensional non-negative matrices U and V. It has been widely applied in pattern recognition and computer vision because of its simplicity and effectiveness. However, existing NMF methods often fail to learn the sparse representation on high-dimensional dataset, especially when some examples are heavily corrupted. In this paper, we propose a robust local coordinate NMF method (RLCNMF) by using the maximum correntropy criteria to overcome such deficiency. Particularly, RLCNMF induces sparse coefficients by imposing the local coordinate constraint over both factors. To solve RLCNMF, we developed a multiplicative update rules and theoretically proved its convergence. Experimental results on popular image datasets verify the effectiveness of RLCNMF comparing with the representative methods.
Keywords :
"Robustness","Sparse matrices","Convergence","Matrix decomposition","Loss measurement","Computer vision"
Publisher :
ieee
Conference_Titel :
Systems, Man, and Cybernetics (SMC), 2015 IEEE International Conference on
Type :
conf
DOI :
10.1109/SMC.2015.385
Filename :
7379517
Link To Document :
بازگشت