In this note,we prove a logarithmic Sobolev inequality which holds for compact submanifolds without a boundary in manifolds with asymptotically nonnegative sectional curvature.Like the Michale-Simon Sobolev inequality...In this note,we prove a logarithmic Sobolev inequality which holds for compact submanifolds without a boundary in manifolds with asymptotically nonnegative sectional curvature.Like the Michale-Simon Sobolev inequality,this inequality contains a term involving the mean curvature.展开更多
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.展开更多
In order to overcome the shortcomings that the reconstructed spectral reflectance may be negative when using the classic principal component analysis （PCA）to reduce the dimensions of the multi-spectral data, a nonne...In order to overcome the shortcomings that the reconstructed spectral reflectance may be negative when using the classic principal component analysis （PCA）to reduce the dimensions of the multi-spectral data, a nonnegative constrained principal component analysis method is proposed to construct a low-dimensional multi-spectral space and accomplish the conversion between the new constructed space and the multispectral space. First, the reason behind the negative data is analyzed and a nonnegative constraint is imposed on the classic PCA. Then a set of nonnegative linear independence weight vectors of principal components is obtained, by which a lowdimensional space is constructed. Finally, a nonlinear optimization technique is used to determine the projection vectors of the high-dimensional multi-spectral data in the constructed space. Experimental results show that the proposed method can keep the reconstructed spectral data in [ 0, 1 ]. The precision of the space created by the proposed method is equivalent to or even higher than that by the PCA.展开更多
Let Ω be a smooth bounded domain in R^n. In this article, we consider the homogeneous boundary Dirichlet problem of inhomogeneous p-Laplace equation --△pu = ｜u｜^q-1 u ＋ λf（x） on Ω, and identify necessary and ...Let Ω be a smooth bounded domain in R^n. In this article, we consider the homogeneous boundary Dirichlet problem of inhomogeneous p-Laplace equation --△pu = ｜u｜^q-1 u ＋ λf（x） on Ω, and identify necessary and sufficient conditions on Ω and f（x） which ensure the existence, or multiplicities of nonnegative solutions for the problem under consideration.展开更多
High-dimensional and incomplete(HDI)data subject to the nonnegativity constraints are commonly encountered in a big data-related application concerning the interactions among numerous nodes.A nonnegative latent factor...High-dimensional and incomplete(HDI)data subject to the nonnegativity constraints are commonly encountered in a big data-related application concerning the interactions among numerous nodes.A nonnegative latent factor analysis(NLFA)model can perform representation learning to HDI data efficiently.However,existing NLFA models suffer from either slow convergence rate or representation accuracy loss.To address this issue,this paper proposes a proximal alternating-directionmethod-of-multipliers-based nonnegative latent factor analysis(PAN)model with two-fold ideas:(1)adopting the principle of alternating-direction-method-of-multipliers to implement an efficient learning scheme for fast convergence and high computational efficiency;and(2)incorporating the proximal regularization into the learning scheme to suppress the optimization fluctuation for high representation learning accuracy to HDI data.Theoretical studies verify that PAN converges to a Karush-KuhnTucker(KKT)stationary point of its nonnegativity-constrained learning objective with its learning scheme.Experimental results on eight HDI matrices from real applications demonstrate that the proposed PAN model outperforms several state-of-the-art models in both estimation accuracy for missing data of an HDI matrix and computational efficiency.展开更多
Nonnegative Tucker3 decomposition（NTD） has attracted lots of attentions for its good performance in 3D data array analysis. However, further research is still necessary to solve the problems of overfitting and slow ...Nonnegative Tucker3 decomposition（NTD） has attracted lots of attentions for its good performance in 3D data array analysis. However, further research is still necessary to solve the problems of overfitting and slow convergence under the anharmonic vibration circumstance occurred in the field of mechanical fault diagnosis. To decompose a large-scale tensor and extract available bispectrum feature, a method of conjugating Choi-Williams kernel function with Gauss-Newton Cartesian product based on nonnegative Tucker3 decomposition（NTD_EDF） is investigated. The complexity of the proposed method is reduced from o（nNlgn） in 3D spaces to o（RiR2nlgn） in 1D vectors due to its low rank form of the Tucker-product convolution. Meanwhile, a simultaneously updating algorithm is given to overcome the overfitting, slow convergence and low efficiency existing in the conventional one-by-one updating algorithm. Furthermore, the technique of spectral phase analysis for quadratic coupling estimation is used to explain the feature spectrum extracted from the gearbox fault data by the proposed method in detail. The simulated and experimental results show that the sparser and more inerratic feature distribution of basis images can be obtained with core tensor by the NTD EDF method compared with the one by the other methods in bispectrum feature extraction, and a legible fault expression can also be performed by power spectral density（PSD） function. Besides, the deviations of successive relative error（DSRE） of NTD_EDF achieves 81.66 dB against 15.17 dB by beta-divergences based on NTD（NTD_Beta） and the time-cost of NTD EDF is only 129.3 s, which is far less than 1 747.9 s by hierarchical alternative least square based on NTD （NTD_HALS）. The NTD_EDF method proposed not only avoids the data overfitting and improves the computation efficiency but also can be used to extract more inerratic and sparser bispectrum features of the gearbox fault.展开更多
This paper considers a problem of unsupervised spectral unmixing of hyperspectral data. Based on the Linear Mixing Model （ LMM）, a new method under the framework of nonnegative matrix fac- torization （NMF） is prop...This paper considers a problem of unsupervised spectral unmixing of hyperspectral data. Based on the Linear Mixing Model （ LMM）, a new method under the framework of nonnegative matrix fac- torization （NMF） is proposed, namely minimum distance constrained nonnegative matrix factoriza- tion （MDC-NMF）. In this paper, firstly, a new regularization term, called endmember distance （ED） is considered, which is defined as the sum of the squared Euclidean distances from each end- member to their geometric center. Compared with the simplex volume, ED has better optimization properties and is conceptually intuitive. Secondly, a projected gradient （PG） scheme is adopted, and by the virtue of ED, in this scheme the optimal step size along the feasible descent direction can be calculated easily at each iteration. Thirdly, a finite step （ no more than the number of endmem- bers） terminated algorithm is used to project a point on the canonical simplex, by which the abun- dance nonnegative constraint and abundance sum-to-one constraint can be accurately satisfied in a light amount of computation. The experimental results, based on a set of synthetic data and real da- ta, demonstrate that, in the same running time, MDC-NMF outperforms several other similar meth- ods proposed recently.展开更多
Structure of nonnegative nontrivial and positive solutions was precisely studied for some singularly perturbed p-Laplace equations. By virtue of sub- and supersolution method, it is shown that there are many nonnegati...Structure of nonnegative nontrivial and positive solutions was precisely studied for some singularly perturbed p-Laplace equations. By virtue of sub- and supersolution method, it is shown that there are many nonnegative nontrivial spike-layer solutions and positive intermediate spike-layer solutions. Moreover, the upper and lower bound on the measure of each spike-layer were estimated when the parameter is sufficiently small.展开更多
Currently,functional connectomes constructed from neuroimaging data have emerged as a powerful tool in identifying brain disorders.If one brain disease just manifests as some cognitive dysfunction,it means that the di...Currently,functional connectomes constructed from neuroimaging data have emerged as a powerful tool in identifying brain disorders.If one brain disease just manifests as some cognitive dysfunction,it means that the disease may affect some local connectivity in the brain functional network.That is,there are functional abnormalities in the sub-network.Therefore,it is crucial to accurately identify them in pathological diagnosis.To solve these problems,we proposed a sub-network extraction method based on graph regularization nonnegative matrix factorization(GNMF).The dynamic functional networks of normal subjects and early mild cognitive impairment(eMCI)subjects were vectorized and the functional connection vectors(FCV)were assembled to aggregation matrices.Then GNMF was applied to factorize the aggregation matrix to get the base matrix,in which the column vectors were restored to a common sub-network and a distinctive sub-network,and visualization and statistical analysis were conducted on the two sub-networks,respectively.Experimental results demonstrated that,compared with other matrix factorization methods,the proposed method can more obviously reflect the similarity between the common subnetwork of eMCI subjects and normal subjects,as well as the difference between the distinctive sub-network of eMCI subjects and normal subjects,Therefore,the high-dimensional features in brain functional networks can be best represented locally in the lowdimensional space,which provides a new idea for studying brain functional connectomes.展开更多
Considering the sparsity of hyperspectral images(HSIs),dictionary learning frameworks have been widely used in the field of unsupervised spectral unmixing.However,it is worth mentioning here that existing dictionary l...Considering the sparsity of hyperspectral images(HSIs),dictionary learning frameworks have been widely used in the field of unsupervised spectral unmixing.However,it is worth mentioning here that existing dictionary learning method-based unmixing methods are found to be short of robustness in noisy contexts.To improve the performance,this study specifically puts forward a new unsupervised spectral unmixing solution.For the reason that the solution only functions in a condition that both endmembers and the abundances meet non-negative con-straints,a model is built to solve the unsupervised spectral un-mixing problem on the account of the dictionary learning me-thod.To raise the screening accuracy of final members,a new form of the target function is introduced into dictionary learning practice,which is conducive to the growing robustness of noisy HSI statistics.Then,by introducing the total variation(TV)terms into the proposed spectral unmixing based on robust nonnega-tive dictionary learning(RNDLSU),the context information under HSI space is to be cited as prior knowledge to compute the abundances when performing sparse unmixing operations.Ac-cording to the final results of the experiment,this method makes favorable performance under varying noise conditions,which is especially true under low signal to noise conditions.展开更多
Traditional data driven fault detection methods assume that the process operates in a single mode so that they cannot perform well in processes with multiple operating modes. To monitor multimode processes effectively...Traditional data driven fault detection methods assume that the process operates in a single mode so that they cannot perform well in processes with multiple operating modes. To monitor multimode processes effectively,this paper proposes a novel process monitoring scheme based on orthogonal nonnegative matrix factorization(ONMF) and hidden Markov model(HMM). The new clustering technique ONMF is employed to separate data from different process modes. The multiple HMMs for various operating modes lead to higher modeling accuracy.The proposed approach does not presume the distribution of data in each mode because the process uncertainty and dynamics can be well interpreted through the hidden Markov estimation. The HMM-based monitoring indication named negative log likelihood probability is utilized for fault detection. In order to assess the proposed monitoring strategy, a numerical example and the Tennessee Eastman process are used. The results demonstrate that this method provides efficient fault detection performance.展开更多
An image fusion method combining complex contourlet transform(CCT) with nonnegative matrix factorization(NMF) is proposed in this paper.After two images are decomposed by CCT,NMF is applied to their highand low-freque...An image fusion method combining complex contourlet transform(CCT) with nonnegative matrix factorization(NMF) is proposed in this paper.After two images are decomposed by CCT,NMF is applied to their highand low-frequency components,respectively,and finally an image is synthesized.Subjective-visual-quality of the image fusion result is compared with those of the image fusion methods based on NMF and the combination of wavelet /contourlet /nonsubsampled contourlet with NMF.The experimental results are evaluated quantitatively,and the running time is also contrasted.It is shown that the proposed image fusion method can gain larger information entropy,standard deviation and mean gradient,which means that it can better integrate featured information from all source images,avoid background noise and promote space clearness in the fusion image effectively.展开更多
In this paper, we prove that if M is an open manifold with nonnegativeRicci curvature and large volume growth, positive critical radius, then sup Cp = ∞.As an application, we give a theorem which supports strongly Pe...In this paper, we prove that if M is an open manifold with nonnegativeRicci curvature and large volume growth, positive critical radius, then sup Cp = ∞.As an application, we give a theorem which supports strongly Petersen's conjecture.展开更多
Consider a first-order autoregressive processes , where the innovations are nonnegative random variables with regular variation at both the right endpoint infinity and the unknown left endpoint θ. We propose estimate...Consider a first-order autoregressive processes , where the innovations are nonnegative random variables with regular variation at both the right endpoint infinity and the unknown left endpoint θ. We propose estimates for the autocorrelation parameter f and the unknown location parameter θ by taking the ratio of two sample values chosen with respect to an extreme value criteria for f and by taking the minimum of over the observed series, where represents our estimate for f. The joint limit distribution of the proposed estimators is derived using point process techniques. A simulation study is provided to examine the small sample size behavior of these estimates.展开更多
We investigate the existence of nonnegative solutions for a Riemann-Liouville fractional differential equation with integral terms, subject to boundary conditions which contain fractional derivatives and Riemann-Stiel...We investigate the existence of nonnegative solutions for a Riemann-Liouville fractional differential equation with integral terms, subject to boundary conditions which contain fractional derivatives and Riemann-Stieltjes integrals. In the proof of the main results, we use the Banach contraction mapping principle and the Krasnosel’skii fixed point theorem for the sum of two operators.展开更多
To solve the problem of the spatial correlation for adjacent areas in traditional spectral unmixing methods, we propose an area-correlated spectral unmixing method based on Bayesian nonnegative matrix factorization. I...To solve the problem of the spatial correlation for adjacent areas in traditional spectral unmixing methods, we propose an area-correlated spectral unmixing method based on Bayesian nonnegative matrix factorization. In the proposed me-thod, the spatial correlation property between two adjacent areas is expressed by a priori probability density function, and the endmembers extracted from one of the adjacent areas are used to estimate the priori probability density func-tions of the endmembers in the current area, which works as a type of constraint in the iterative spectral unmixing process. Experimental results demonstrate the effectivity and efficiency of the proposed method both for synthetic and real hyperspectral images, and it can provide a useful tool for spatial correlation and comparation analysis between ad-jacent or similar areas.展开更多
The feasibility of using fluorescence excitation-emission matrix(EEM) along with parallel factor analysis(PARAFAC) and nonnegative least squares(NNLS) method for the differentiation of phytoplankton taxonomic groups w...The feasibility of using fluorescence excitation-emission matrix(EEM) along with parallel factor analysis(PARAFAC) and nonnegative least squares(NNLS) method for the differentiation of phytoplankton taxonomic groups was investigated. Forty-one phytoplankton species belonging to 28 genera of five divisions were studied. First, the PARAFAC model was applied to EEMs, and 15 fluorescence components were generated. Second, 15 fluorescence components were found to have a strong discriminating capability based on Bayesian discriminant analysis(BDA). Third, all spectra of the fluorescence component compositions for the 41 phytoplankton species were spectrographically sorted into 61 reference spectra using hierarchical cluster analysis(HCA), and then, the reference spectra were used to establish a database. Finally, the phytoplankton taxonomic groups was differentiated by the reference spectra database using the NNLS method. The five phytoplankton groups were differentiated with the correct discrimination ratios(CDRs) of 100% for single-species samples at the division level. The CDRs for the mixtures were above 91% for the dominant phytoplankton species and above 73% for the subdominant phytoplankton species. Sixteen of the 85 field samples collected from the Changjiang River estuary were analyzed by both HPLC-CHEMTAX and the fluorometric technique developed. The results of both methods reveal that Bacillariophyta was the dominant algal group in these 16 samples and that the subdominant algal groups comprised Dinophyta, Chlorophyta and Cryptophyta. The differentiation results by the fluorometric technique were in good agreement with those from HPLC-CHEMTAX. The results indicate that the fluorometric technique could differentiate algal taxonomic groups accurately at the division level.展开更多
Finding crucial vertices is a key problem for improving the reliability and ensuring the effective operation of networks,solved by approaches based on multiple attribute decision that suffer from ignoring the correlat...Finding crucial vertices is a key problem for improving the reliability and ensuring the effective operation of networks,solved by approaches based on multiple attribute decision that suffer from ignoring the correlation among each attribute or the heterogeneity between attribute and structure. To overcome these problems, a novel vertex centrality approach, called VCJG, is proposed based on joint nonnegative matrix factorization and graph embedding. The potential attributes with linearly independent and the structure information are captured automatically in light of nonnegative matrix factorization for factorizing the weighted adjacent matrix and the structure matrix, which is generated by graph embedding. And the smoothness strategy is applied to eliminate the heterogeneity between attributes and structure by joint nonnegative matrix factorization. Then VCJG integrates the above steps to formulate an overall objective function, and obtain the ultimately potential attributes fused the structure information of network through optimizing the objective function. Finally, the attributes are combined with neighborhood rules to evaluate vertex's importance. Through comparative analyses with experiments on nine real-world networks, we demonstrate that the proposed approach outperforms nine state-of-the-art algorithms for identification of vital vertices with respect to correlation, monotonicity and accuracy of top-10 vertices ranking.展开更多
In this paper, we have proposed an upper bound for the largest Z-eigenvalue of an irreducible weakly symmetric and nonnegative tensor, which is called the Brauer upper bound:■where■ As applications, a bound on the Z...In this paper, we have proposed an upper bound for the largest Z-eigenvalue of an irreducible weakly symmetric and nonnegative tensor, which is called the Brauer upper bound:■where■ As applications, a bound on the Z-spectral radius of uniform hypergraphs is presented.展开更多
In this paper, a lower bound and an upper bound for the spectral radius of nonnegative tensors are obtained. Our new bounds are tighter than the corresponding bounds obtained by Li et al.(J. Inequal. Appl. 2015). A nu...In this paper, a lower bound and an upper bound for the spectral radius of nonnegative tensors are obtained. Our new bounds are tighter than the corresponding bounds obtained by Li et al.(J. Inequal. Appl. 2015). A numerical example is given to show the effectiveness of theoretical results.展开更多
基金Supported by the NSFC(11771087,12171091 and 11831005)。
文摘In this note,we prove a logarithmic Sobolev inequality which holds for compact submanifolds without a boundary in manifolds with asymptotically nonnegative sectional curvature.Like the Michale-Simon Sobolev inequality,this inequality contains a term involving the mean curvature.
基金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.
基金The Pre-Research Foundation of National Ministries andCommissions (No9140A16050109DZ01)the Scientific Research Program of the Education Department of Shanxi Province (No09JK701)
文摘In order to overcome the shortcomings that the reconstructed spectral reflectance may be negative when using the classic principal component analysis （PCA）to reduce the dimensions of the multi-spectral data, a nonnegative constrained principal component analysis method is proposed to construct a low-dimensional multi-spectral space and accomplish the conversion between the new constructed space and the multispectral space. First, the reason behind the negative data is analyzed and a nonnegative constraint is imposed on the classic PCA. Then a set of nonnegative linear independence weight vectors of principal components is obtained, by which a lowdimensional space is constructed. Finally, a nonlinear optimization technique is used to determine the projection vectors of the high-dimensional multi-spectral data in the constructed space. Experimental results show that the proposed method can keep the reconstructed spectral data in [ 0, 1 ]. The precision of the space created by the proposed method is equivalent to or even higher than that by the PCA.
基金This work is supported by NNSF of China (10171029).
文摘Let Ω be a smooth bounded domain in R^n. In this article, we consider the homogeneous boundary Dirichlet problem of inhomogeneous p-Laplace equation --△pu = ｜u｜^q-1 u ＋ λf（x） on Ω, and identify necessary and sufficient conditions on Ω and f（x） which ensure the existence, or multiplicities of nonnegative solutions for the problem under consideration.
基金supported by the National Natural Science Foundation of China(62272078,U21A2019)the Hainan Province Science and Technology Special Fund of China(ZDYF2022SHFZ105)the CAAI-Huawei MindSpore Open Fund(CAAIXSJLJJ-2021-035A)。
文摘High-dimensional and incomplete(HDI)data subject to the nonnegativity constraints are commonly encountered in a big data-related application concerning the interactions among numerous nodes.A nonnegative latent factor analysis(NLFA)model can perform representation learning to HDI data efficiently.However,existing NLFA models suffer from either slow convergence rate or representation accuracy loss.To address this issue,this paper proposes a proximal alternating-directionmethod-of-multipliers-based nonnegative latent factor analysis(PAN)model with two-fold ideas:(1)adopting the principle of alternating-direction-method-of-multipliers to implement an efficient learning scheme for fast convergence and high computational efficiency;and(2)incorporating the proximal regularization into the learning scheme to suppress the optimization fluctuation for high representation learning accuracy to HDI data.Theoretical studies verify that PAN converges to a Karush-KuhnTucker(KKT)stationary point of its nonnegativity-constrained learning objective with its learning scheme.Experimental results on eight HDI matrices from real applications demonstrate that the proposed PAN model outperforms several state-of-the-art models in both estimation accuracy for missing data of an HDI matrix and computational efficiency.
基金supported by National Natural Science Foundation of China(Grant Nos.50875048,51175079,51075069)
文摘Nonnegative Tucker3 decomposition（NTD） has attracted lots of attentions for its good performance in 3D data array analysis. However, further research is still necessary to solve the problems of overfitting and slow convergence under the anharmonic vibration circumstance occurred in the field of mechanical fault diagnosis. To decompose a large-scale tensor and extract available bispectrum feature, a method of conjugating Choi-Williams kernel function with Gauss-Newton Cartesian product based on nonnegative Tucker3 decomposition（NTD_EDF） is investigated. The complexity of the proposed method is reduced from o（nNlgn） in 3D spaces to o（RiR2nlgn） in 1D vectors due to its low rank form of the Tucker-product convolution. Meanwhile, a simultaneously updating algorithm is given to overcome the overfitting, slow convergence and low efficiency existing in the conventional one-by-one updating algorithm. Furthermore, the technique of spectral phase analysis for quadratic coupling estimation is used to explain the feature spectrum extracted from the gearbox fault data by the proposed method in detail. The simulated and experimental results show that the sparser and more inerratic feature distribution of basis images can be obtained with core tensor by the NTD EDF method compared with the one by the other methods in bispectrum feature extraction, and a legible fault expression can also be performed by power spectral density（PSD） function. Besides, the deviations of successive relative error（DSRE） of NTD_EDF achieves 81.66 dB against 15.17 dB by beta-divergences based on NTD（NTD_Beta） and the time-cost of NTD EDF is only 129.3 s, which is far less than 1 747.9 s by hierarchical alternative least square based on NTD （NTD_HALS）. The NTD_EDF method proposed not only avoids the data overfitting and improves the computation efficiency but also can be used to extract more inerratic and sparser bispectrum features of the gearbox fault.
基金Supported by the National Natural Science Foundation of China （ No. 60872083 ） and the National High Technology Research and Development Program of China （No. 2007AA12Z149）.
文摘This paper considers a problem of unsupervised spectral unmixing of hyperspectral data. Based on the Linear Mixing Model （ LMM）, a new method under the framework of nonnegative matrix fac- torization （NMF） is proposed, namely minimum distance constrained nonnegative matrix factoriza- tion （MDC-NMF）. In this paper, firstly, a new regularization term, called endmember distance （ED） is considered, which is defined as the sum of the squared Euclidean distances from each end- member to their geometric center. Compared with the simplex volume, ED has better optimization properties and is conceptually intuitive. Secondly, a projected gradient （PG） scheme is adopted, and by the virtue of ED, in this scheme the optimal step size along the feasible descent direction can be calculated easily at each iteration. Thirdly, a finite step （ no more than the number of endmem- bers） terminated algorithm is used to project a point on the canonical simplex, by which the abun- dance nonnegative constraint and abundance sum-to-one constraint can be accurately satisfied in a light amount of computation. The experimental results, based on a set of synthetic data and real da- ta, demonstrate that, in the same running time, MDC-NMF outperforms several other similar meth- ods proposed recently.
文摘Structure of nonnegative nontrivial and positive solutions was precisely studied for some singularly perturbed p-Laplace equations. By virtue of sub- and supersolution method, it is shown that there are many nonnegative nontrivial spike-layer solutions and positive intermediate spike-layer solutions. Moreover, the upper and lower bound on the measure of each spike-layer were estimated when the parameter is sufficiently small.
基金supported by the National Natural Science Foundation of China(No.51877013),(ZJ),(http://www.nsfc.gov.cn/)the Natural Science Foundation of Jiangsu Province(No.BK20181463),(ZJ),(http://kxjst.jiangsu.gov.cn/)sponsored by Qing Lan Project of Jiangsu Province(no specific grant number),(ZJ),(http://jyt.jiangsu.gov.cn/).
文摘Currently,functional connectomes constructed from neuroimaging data have emerged as a powerful tool in identifying brain disorders.If one brain disease just manifests as some cognitive dysfunction,it means that the disease may affect some local connectivity in the brain functional network.That is,there are functional abnormalities in the sub-network.Therefore,it is crucial to accurately identify them in pathological diagnosis.To solve these problems,we proposed a sub-network extraction method based on graph regularization nonnegative matrix factorization(GNMF).The dynamic functional networks of normal subjects and early mild cognitive impairment(eMCI)subjects were vectorized and the functional connection vectors(FCV)were assembled to aggregation matrices.Then GNMF was applied to factorize the aggregation matrix to get the base matrix,in which the column vectors were restored to a common sub-network and a distinctive sub-network,and visualization and statistical analysis were conducted on the two sub-networks,respectively.Experimental results demonstrated that,compared with other matrix factorization methods,the proposed method can more obviously reflect the similarity between the common subnetwork of eMCI subjects and normal subjects,as well as the difference between the distinctive sub-network of eMCI subjects and normal subjects,Therefore,the high-dimensional features in brain functional networks can be best represented locally in the lowdimensional space,which provides a new idea for studying brain functional connectomes.
基金supported by the National Natural Science Foundation of China(61801513).
文摘Considering the sparsity of hyperspectral images(HSIs),dictionary learning frameworks have been widely used in the field of unsupervised spectral unmixing.However,it is worth mentioning here that existing dictionary learning method-based unmixing methods are found to be short of robustness in noisy contexts.To improve the performance,this study specifically puts forward a new unsupervised spectral unmixing solution.For the reason that the solution only functions in a condition that both endmembers and the abundances meet non-negative con-straints,a model is built to solve the unsupervised spectral un-mixing problem on the account of the dictionary learning me-thod.To raise the screening accuracy of final members,a new form of the target function is introduced into dictionary learning practice,which is conducive to the growing robustness of noisy HSI statistics.Then,by introducing the total variation(TV)terms into the proposed spectral unmixing based on robust nonnega-tive dictionary learning(RNDLSU),the context information under HSI space is to be cited as prior knowledge to compute the abundances when performing sparse unmixing operations.Ac-cording to the final results of the experiment,this method makes favorable performance under varying noise conditions,which is especially true under low signal to noise conditions.
基金Supported by the National Natural Science Foundation of China(61374140,61403072)
文摘Traditional data driven fault detection methods assume that the process operates in a single mode so that they cannot perform well in processes with multiple operating modes. To monitor multimode processes effectively,this paper proposes a novel process monitoring scheme based on orthogonal nonnegative matrix factorization(ONMF) and hidden Markov model(HMM). The new clustering technique ONMF is employed to separate data from different process modes. The multiple HMMs for various operating modes lead to higher modeling accuracy.The proposed approach does not presume the distribution of data in each mode because the process uncertainty and dynamics can be well interpreted through the hidden Markov estimation. The HMM-based monitoring indication named negative log likelihood probability is utilized for fault detection. In order to assess the proposed monitoring strategy, a numerical example and the Tennessee Eastman process are used. The results demonstrate that this method provides efficient fault detection performance.
基金Supported by National Natural Science Foundation of China (No. 60872065)
文摘An image fusion method combining complex contourlet transform(CCT) with nonnegative matrix factorization(NMF) is proposed in this paper.After two images are decomposed by CCT,NMF is applied to their highand low-frequency components,respectively,and finally an image is synthesized.Subjective-visual-quality of the image fusion result is compared with those of the image fusion methods based on NMF and the combination of wavelet /contourlet /nonsubsampled contourlet with NMF.The experimental results are evaluated quantitatively,and the running time is also contrasted.It is shown that the proposed image fusion method can gain larger information entropy,standard deviation and mean gradient,which means that it can better integrate featured information from all source images,avoid background noise and promote space clearness in the fusion image effectively.
文摘In this paper, we prove that if M is an open manifold with nonnegativeRicci curvature and large volume growth, positive critical radius, then sup Cp = ∞.As an application, we give a theorem which supports strongly Petersen's conjecture.
文摘Consider a first-order autoregressive processes , where the innovations are nonnegative random variables with regular variation at both the right endpoint infinity and the unknown left endpoint θ. We propose estimates for the autocorrelation parameter f and the unknown location parameter θ by taking the ratio of two sample values chosen with respect to an extreme value criteria for f and by taking the minimum of over the observed series, where represents our estimate for f. The joint limit distribution of the proposed estimators is derived using point process techniques. A simulation study is provided to examine the small sample size behavior of these estimates.
文摘We investigate the existence of nonnegative solutions for a Riemann-Liouville fractional differential equation with integral terms, subject to boundary conditions which contain fractional derivatives and Riemann-Stieltjes integrals. In the proof of the main results, we use the Banach contraction mapping principle and the Krasnosel’skii fixed point theorem for the sum of two operators.
文摘To solve the problem of the spatial correlation for adjacent areas in traditional spectral unmixing methods, we propose an area-correlated spectral unmixing method based on Bayesian nonnegative matrix factorization. In the proposed me-thod, the spatial correlation property between two adjacent areas is expressed by a priori probability density function, and the endmembers extracted from one of the adjacent areas are used to estimate the priori probability density func-tions of the endmembers in the current area, which works as a type of constraint in the iterative spectral unmixing process. Experimental results demonstrate the effectivity and efficiency of the proposed method both for synthetic and real hyperspectral images, and it can provide a useful tool for spatial correlation and comparation analysis between ad-jacent or similar areas.
基金Supported by the National Natural Science Foundation of China(Nos.41376106,41176063)the Shandong Provincial Natural Science Foundation of China(No.ZR2013DM017)
文摘The feasibility of using fluorescence excitation-emission matrix(EEM) along with parallel factor analysis(PARAFAC) and nonnegative least squares(NNLS) method for the differentiation of phytoplankton taxonomic groups was investigated. Forty-one phytoplankton species belonging to 28 genera of five divisions were studied. First, the PARAFAC model was applied to EEMs, and 15 fluorescence components were generated. Second, 15 fluorescence components were found to have a strong discriminating capability based on Bayesian discriminant analysis(BDA). Third, all spectra of the fluorescence component compositions for the 41 phytoplankton species were spectrographically sorted into 61 reference spectra using hierarchical cluster analysis(HCA), and then, the reference spectra were used to establish a database. Finally, the phytoplankton taxonomic groups was differentiated by the reference spectra database using the NNLS method. The five phytoplankton groups were differentiated with the correct discrimination ratios(CDRs) of 100% for single-species samples at the division level. The CDRs for the mixtures were above 91% for the dominant phytoplankton species and above 73% for the subdominant phytoplankton species. Sixteen of the 85 field samples collected from the Changjiang River estuary were analyzed by both HPLC-CHEMTAX and the fluorometric technique developed. The results of both methods reveal that Bacillariophyta was the dominant algal group in these 16 samples and that the subdominant algal groups comprised Dinophyta, Chlorophyta and Cryptophyta. The differentiation results by the fluorometric technique were in good agreement with those from HPLC-CHEMTAX. The results indicate that the fluorometric technique could differentiate algal taxonomic groups accurately at the division level.
基金Project supported by the National Natural Science Foundation of China (Grant Nos.62162040 and 11861045)。
文摘Finding crucial vertices is a key problem for improving the reliability and ensuring the effective operation of networks,solved by approaches based on multiple attribute decision that suffer from ignoring the correlation among each attribute or the heterogeneity between attribute and structure. To overcome these problems, a novel vertex centrality approach, called VCJG, is proposed based on joint nonnegative matrix factorization and graph embedding. The potential attributes with linearly independent and the structure information are captured automatically in light of nonnegative matrix factorization for factorizing the weighted adjacent matrix and the structure matrix, which is generated by graph embedding. And the smoothness strategy is applied to eliminate the heterogeneity between attributes and structure by joint nonnegative matrix factorization. Then VCJG integrates the above steps to formulate an overall objective function, and obtain the ultimately potential attributes fused the structure information of network through optimizing the objective function. Finally, the attributes are combined with neighborhood rules to evaluate vertex's importance. Through comparative analyses with experiments on nine real-world networks, we demonstrate that the proposed approach outperforms nine state-of-the-art algorithms for identification of vital vertices with respect to correlation, monotonicity and accuracy of top-10 vertices ranking.
基金Supported by the High-Level Innovative Talents of Guizhou ProvinceScience and Technology Fund Project of GZInnovative Talent Team in Guizhou Province(Grant Nos.Zun Ke He Ren Cai[2017]8,Qian Ke He J Zi LKZS[2012]08,Qian Ke HE Pingtai Rencai[2016]5619.)
文摘In this paper, we have proposed an upper bound for the largest Z-eigenvalue of an irreducible weakly symmetric and nonnegative tensor, which is called the Brauer upper bound:■where■ As applications, a bound on the Z-spectral radius of uniform hypergraphs is presented.
基金Supported by the National Natural Science Foundation of China(Grant No.11601473)the Doctoral Innovation Found of Hebei University of Engineering(Grant No.112/SJ010002142)。
文摘In this paper, a lower bound and an upper bound for the spectral radius of nonnegative tensors are obtained. Our new bounds are tighter than the corresponding bounds obtained by Li et al.(J. Inequal. Appl. 2015). A numerical example is given to show the effectiveness of theoretical results.
