期刊文献+
共找到1篇文章
< 1 >
每页显示 20 50 100
Improved Non-negative Matrix Factorization Algorithm for Sparse Graph Regularization
1
作者 Caifeng Yang Tao Liu +2 位作者 guifu lu Zhenxin Wang Zhi Deng 《国际计算机前沿大会会议论文集》 2021年第1期221-232,共12页
Aiming at the low recognition accuracy of non-negative matrix factorization(NMF)in practical application,an improved spare graph NMF(New-SGNMF)is proposed in this paper.New-SGNMF makes full use of the inherent geometr... Aiming at the low recognition accuracy of non-negative matrix factorization(NMF)in practical application,an improved spare graph NMF(New-SGNMF)is proposed in this paper.New-SGNMF makes full use of the inherent geometric structure of image data to optimize the basis matrix in two steps.A threshold value s was first set to judge the threshold value of the decomposed base matrix to filter the redundant information in the data.Using L2 norm,sparse constraints were then implemented on the basis matrix,and integrated into the objective function to obtain the objective function of New-SGNMF.In addition,the derivation process of the algorithm and the convergence analysis of the algorithm were given.The experimental results on COIL20,PIE-pose09 and YaleB database show that compared with K-means,PCA,NMF and other algorithms,the proposed algorithm has higher accuracy and normalized mutual information. 展开更多
关键词 Image recognition Non-negative matrix factorization Graph regularization Basis matrix Sparseness constraints
原文传递
上一页 1 下一页 到第
使用帮助 返回顶部