Graph regularized and sparse nonnegative matrix factorization with hard constraints for data representation

2016 ◽  
Vol 173 ◽  
pp. 233-244 ◽  
Author(s):  
Fuming Sun ◽  
Meixiang Xu ◽  
Xuekao Hu ◽  
Xiaojun Jiang
2019 ◽  
Vol 164 ◽  
pp. 29-37 ◽  
Author(s):  
Shudong Huang ◽  
Peng Zhao ◽  
Yazhou Ren ◽  
Tianrui Li ◽  
Zenglin Xu

Author(s):  
Siyuan Peng ◽  
Zhijing Yang ◽  
Bingo Wing-Kuen Ling ◽  
Badong Chen ◽  
Zhiping Lin

Symmetry ◽  
2019 ◽  
Vol 11 (3) ◽  
pp. 354
Author(s):  
Jing Zhou

Weighted nonnegative matrix factorization (WNMF) is a technology for feature extraction, which can extract the feature of face dataset, and then the feature can be recognized by the classifier. To improve the performance of WNMF for feature extraction, a new iteration rule is proposed in this paper. Meanwhile, the base matrix U is sparse based on the threshold, and the new method is named sparse weighted nonnegative matrix factorization (SWNMF). The new iteration rules are based on the smaller iteration steps, thus, the search is more precise, therefore, the recognition rate can be improved. In addition, the sparse method based on the threshold is adopted to update the base matrix U, which can make the extracted feature more sparse and concentrate, and then easier to recognize. The SWNMF method is applied on the ORL and JAFEE datasets, and from the experiment results we can find that the recognition rates are improved extensively based on the new iteration rules proposed in this paper. The recognition rate of new SWNMF method reached 98% for ORL face database and 100% for JAFEE face database, respectively, which are higher than the PCA method, the sparse nonnegative matrix factorization (SNMF) method, the convex non-negative matrix factorization (CNMF) method and multi-layer NMF method.


Sign in / Sign up

Export Citation Format

Share Document