This paper proposes a Graph regularized Lpsmooth non-negative matrix factorization(GSNMF) method by incorporating graph regularization and L_p smoothing constraint, which considers the intrinsic geometric information ...This paper proposes a Graph regularized Lpsmooth non-negative matrix factorization(GSNMF) method by incorporating graph regularization and L_p smoothing constraint, which considers the intrinsic geometric information of a data set and produces smooth and stable solutions. The main contributions are as follows: first, graph regularization is added into NMF to discover the hidden semantics and simultaneously respect the intrinsic geometric structure information of a data set. Second,the Lpsmoothing constraint is incorporated into NMF to combine the merits of isotropic(L_2-norm) and anisotropic(L_1-norm)diffusion smoothing, and produces a smooth and more accurate solution to the optimization problem. Finally, the update rules and proof of convergence of GSNMF are given. Experiments on several data sets show that the proposed method outperforms related state-of-the-art methods.展开更多
颜色迁移是组织病理学图像颜色预处理中的重要环节.为了解决颜色迁移过程中某些重要结构颜色改变的问题,在保结构颜色迁移(structure-preserving color normalization,SPCN)算法基础上融合聚类过程,并结合稀疏非负矩阵分解(sparse non-n...颜色迁移是组织病理学图像颜色预处理中的重要环节.为了解决颜色迁移过程中某些重要结构颜色改变的问题,在保结构颜色迁移(structure-preserving color normalization,SPCN)算法基础上融合聚类过程,并结合稀疏非负矩阵分解(sparse non-negative matrix factorization,SNMF)提出K均值稀疏非负矩阵分解基组合(K-means and SNMF basis combination,KSBC)算法.首先通过K均值算法对图像聚类,根据聚类中心识别细胞结构;然后求解稀疏非负矩阵分解模型得到染色基和结构矩阵,根据聚类结果对结构矩阵和染色基准确组合.KSBC算法承袭了SPCN算法的特性,又能灵活地迁移和保留原图像结构颜色.在组织病理学图像数据库中进行对比实验,KSBC算法在图像质量评估指标上优于直方图匹配,Reinhard,Macenko,SPCN和高阶矩算法,并提高残差神经网络的泛化性能.展开更多
One of the most important problems in complex networks is to identify the influential vertices for understanding and controlling of information diffusion and disease spreading.Most of the current centrality algorithms...One of the most important problems in complex networks is to identify the influential vertices for understanding and controlling of information diffusion and disease spreading.Most of the current centrality algorithms focus on single feature or manually extract the attributes,which occasionally results in the failure to fully capture the vertex’s importance.A new vertex centrality approach based on symmetric nonnegative matrix factorization(SNMF),called VCSNMF,is proposed in this paper.For highlight the characteristics of a network,the adjacency matrix and the degree matrix are fused to represent original data of the network via a weighted linear combination.First,SNMF automatically extracts the latent characteristics of vertices by factorizing the established original data matrix.Then we prove that each vertex’s composite feature which is constructed with one-dimensional factor matrix can be approximated as the term of eigenvector associated with the spectral radius of the network,otherwise obtained by the factor matrix on the hyperspace.Finally,VCSNMF integrates the composite feature and the topological structure to evaluate the performance of vertices.To verify the effectiveness of the VCSNMF criterion,eight existing centrality approaches are used as comparison measures to rank influential vertices in ten real-world networks.The experimental results assert the superiority of the method.展开更多
基金supported by the National Natural Science Foundation of China(61702251,61363049,11571011)the State Scholarship Fund of China Scholarship Council(CSC)(201708360040)+3 种基金the Natural Science Foundation of Jiangxi Province(20161BAB212033)the Natural Science Basic Research Plan in Shaanxi Province of China(2018JM6030)the Doctor Scientific Research Starting Foundation of Northwest University(338050050)Youth Academic Talent Support Program of Northwest University
文摘This paper proposes a Graph regularized Lpsmooth non-negative matrix factorization(GSNMF) method by incorporating graph regularization and L_p smoothing constraint, which considers the intrinsic geometric information of a data set and produces smooth and stable solutions. The main contributions are as follows: first, graph regularization is added into NMF to discover the hidden semantics and simultaneously respect the intrinsic geometric structure information of a data set. Second,the Lpsmoothing constraint is incorporated into NMF to combine the merits of isotropic(L_2-norm) and anisotropic(L_1-norm)diffusion smoothing, and produces a smooth and more accurate solution to the optimization problem. Finally, the update rules and proof of convergence of GSNMF are given. Experiments on several data sets show that the proposed method outperforms related state-of-the-art methods.
文摘颜色迁移是组织病理学图像颜色预处理中的重要环节.为了解决颜色迁移过程中某些重要结构颜色改变的问题,在保结构颜色迁移(structure-preserving color normalization,SPCN)算法基础上融合聚类过程,并结合稀疏非负矩阵分解(sparse non-negative matrix factorization,SNMF)提出K均值稀疏非负矩阵分解基组合(K-means and SNMF basis combination,KSBC)算法.首先通过K均值算法对图像聚类,根据聚类中心识别细胞结构;然后求解稀疏非负矩阵分解模型得到染色基和结构矩阵,根据聚类结果对结构矩阵和染色基准确组合.KSBC算法承袭了SPCN算法的特性,又能灵活地迁移和保留原图像结构颜色.在组织病理学图像数据库中进行对比实验,KSBC算法在图像质量评估指标上优于直方图匹配,Reinhard,Macenko,SPCN和高阶矩算法,并提高残差神经网络的泛化性能.
基金the National Natural Science Foundation of China(Nos.11361033 and 11861045)。
文摘One of the most important problems in complex networks is to identify the influential vertices for understanding and controlling of information diffusion and disease spreading.Most of the current centrality algorithms focus on single feature or manually extract the attributes,which occasionally results in the failure to fully capture the vertex’s importance.A new vertex centrality approach based on symmetric nonnegative matrix factorization(SNMF),called VCSNMF,is proposed in this paper.For highlight the characteristics of a network,the adjacency matrix and the degree matrix are fused to represent original data of the network via a weighted linear combination.First,SNMF automatically extracts the latent characteristics of vertices by factorizing the established original data matrix.Then we prove that each vertex’s composite feature which is constructed with one-dimensional factor matrix can be approximated as the term of eigenvector associated with the spectral radius of the network,otherwise obtained by the factor matrix on the hyperspace.Finally,VCSNMF integrates the composite feature and the topological structure to evaluate the performance of vertices.To verify the effectiveness of the VCSNMF criterion,eight existing centrality approaches are used as comparison measures to rank influential vertices in ten real-world networks.The experimental results assert the superiority of the method.
