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.展开更多
<span style="line-height:1.5;"><span>In this paper, we consider a constrained low rank approximation problem: </span><img src="Edit_57d85c54-7822-4512-aafc-f0b0295a8f75.png" wi...<span style="line-height:1.5;"><span>In this paper, we consider a constrained low rank approximation problem: </span><img src="Edit_57d85c54-7822-4512-aafc-f0b0295a8f75.png" width="100" height="24" alt="" /></span><span style="line-height:1.5;"><span>, where </span><i><span>E</span></i><span> is a given complex matrix, </span><i><span>p</span></i><span> is a positive integer, and </span></span><span style="line-height:1.5;"></span><span style="line-height:1.5;"><span> is the set of the Hermitian nonnegative-definite least squares solution to the matrix equation </span><img src="Edit_ced08299-d2dc-4dbb-907a-4d8d36d2e87a.png" width="60" height="16" alt="" /></span><span style="line-height:1.5;"><span>. We discuss the range of </span><i><span>p</span></i><span> and derive the corresponding explicit solution expression of the constrained low rank approximation problem by matrix decompositions. And an algorithm for the problem is proposed and the numerical example is given to show its feasibility.展开更多
Orthogonal nonnegative matrix factorization(ONMF)is widely used in blind image separation problem,document classification,and human face recognition.The model of ONMF can be efficiently solved by the alternating direc...Orthogonal nonnegative matrix factorization(ONMF)is widely used in blind image separation problem,document classification,and human face recognition.The model of ONMF can be efficiently solved by the alternating direction method of multipliers and hierarchical alternating least squares method.When the given matrix is huge,the cost of computation and communication is too high.Therefore,ONMF becomes challenging in the large-scale setting.The random projection is an efficient method of dimensionality reduction.In this paper,we apply the random projection to ONMF and propose two randomized algorithms.Numerical experiments show that our proposed algorithms perform well on both simulated and real data.展开更多
In this paper,we develop an active set identification technique.By means of the active set technique,we present an active set adaptive monotone projected Barzilai-Borwein method(ASAMPBB)for solving nonnegative matrix ...In this paper,we develop an active set identification technique.By means of the active set technique,we present an active set adaptive monotone projected Barzilai-Borwein method(ASAMPBB)for solving nonnegative matrix factorization(NMF)based on the alternating nonnegative least squares framework,in which the Barzilai-Borwein(BB)step sizes can be adaptively picked to get meaningful convergence rate improvements.To get optimal step size,we take into account of the curvature information.In addition,the larger step size technique is exploited to accelerate convergence of the proposed method.The global convergence of the proposed method is analysed under mild assumption.Finally,the results of the numerical experiments on both synthetic and real-world datasets show that the proposed method is effective.展开更多
该文提出一种基于非负张量分解的高光谱图像压缩算法。首先将高光谱图像的每个谱段进行2维离散5／3小波变换，消除高光谱图像的空间冗余。然后将所有谱段的每级小波变换的4个小波子带看作为4个张量。对每个小波子带张量采用改进HALS（Hi...该文提出一种基于非负张量分解的高光谱图像压缩算法。首先将高光谱图像的每个谱段进行2维离散5／3小波变换，消除高光谱图像的空间冗余。然后将所有谱段的每级小波变换的4个小波子带看作为4个张量。对每个小波子带张量采用改进HALS（Hierarchical Alternating Least Squares）算法进行非负分解，来消除光谱冗余和空间残余冗余，同时保护了光谱信息。最后，将分解的因子矩阵进行熵编码。实验结果表明，该文提出的压缩算法具有良好压缩性能，在压缩比32：1-4：1范围内，平均信噪比高于40dB，与传统高光谱图像压缩算法比较，平均峰值信噪比提高了1．499dB。有效地提高了高光谱图像压缩算法的压缩性能和保护了光谱信息。展开更多
基金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.
文摘<span style="line-height:1.5;"><span>In this paper, we consider a constrained low rank approximation problem: </span><img src="Edit_57d85c54-7822-4512-aafc-f0b0295a8f75.png" width="100" height="24" alt="" /></span><span style="line-height:1.5;"><span>, where </span><i><span>E</span></i><span> is a given complex matrix, </span><i><span>p</span></i><span> is a positive integer, and </span></span><span style="line-height:1.5;"></span><span style="line-height:1.5;"><span> is the set of the Hermitian nonnegative-definite least squares solution to the matrix equation </span><img src="Edit_ced08299-d2dc-4dbb-907a-4d8d36d2e87a.png" width="60" height="16" alt="" /></span><span style="line-height:1.5;"><span>. We discuss the range of </span><i><span>p</span></i><span> and derive the corresponding explicit solution expression of the constrained low rank approximation problem by matrix decompositions. And an algorithm for the problem is proposed and the numerical example is given to show its feasibility.
基金the National Natural Science Foundation of China(No.11901359)Shandong Provincial Natural Science Foundation(No.ZR2019QA017)。
文摘Orthogonal nonnegative matrix factorization(ONMF)is widely used in blind image separation problem,document classification,and human face recognition.The model of ONMF can be efficiently solved by the alternating direction method of multipliers and hierarchical alternating least squares method.When the given matrix is huge,the cost of computation and communication is too high.Therefore,ONMF becomes challenging in the large-scale setting.The random projection is an efficient method of dimensionality reduction.In this paper,we apply the random projection to ONMF and propose two randomized algorithms.Numerical experiments show that our proposed algorithms perform well on both simulated and real data.
基金the support from the National Natural Science Foundation of China(Nos.12171384,12201492,61976176)the National Science Foundation of Shaanxi(No.2021JM-323).
文摘In this paper,we develop an active set identification technique.By means of the active set technique,we present an active set adaptive monotone projected Barzilai-Borwein method(ASAMPBB)for solving nonnegative matrix factorization(NMF)based on the alternating nonnegative least squares framework,in which the Barzilai-Borwein(BB)step sizes can be adaptively picked to get meaningful convergence rate improvements.To get optimal step size,we take into account of the curvature information.In addition,the larger step size technique is exploited to accelerate convergence of the proposed method.The global convergence of the proposed method is analysed under mild assumption.Finally,the results of the numerical experiments on both synthetic and real-world datasets show that the proposed method is effective.
文摘该文提出一种基于非负张量分解的高光谱图像压缩算法。首先将高光谱图像的每个谱段进行2维离散5／3小波变换，消除高光谱图像的空间冗余。然后将所有谱段的每级小波变换的4个小波子带看作为4个张量。对每个小波子带张量采用改进HALS（Hierarchical Alternating Least Squares）算法进行非负分解，来消除光谱冗余和空间残余冗余，同时保护了光谱信息。最后，将分解的因子矩阵进行熵编码。实验结果表明，该文提出的压缩算法具有良好压缩性能，在压缩比32：1-4：1范围内，平均信噪比高于40dB，与传统高光谱图像压缩算法比较，平均峰值信噪比提高了1．499dB。有效地提高了高光谱图像压缩算法的压缩性能和保护了光谱信息。
