A new restoration algorithm based on double loops and alternant iterations is proposed to restore the object image effectively from a few frames of turbulence-degraded images, Based on the double loops, the iterative ...A new restoration algorithm based on double loops and alternant iterations is proposed to restore the object image effectively from a few frames of turbulence-degraded images, Based on the double loops, the iterative relations for estimating the turbulent point spread function PSF and object image alternately are derived. The restoration experiments have been made on computers, showing that the proposed algorithm can obtain the optimal estimations of the object and the point spread function, with the feasibility and practicality of the proposed algorithm being convincing.展开更多
Due to the digital transformation tendency among cultural institutions and the substantial influence of the social media platform,the demands of visual communication keep increasing for promoting traditional cultural ...Due to the digital transformation tendency among cultural institutions and the substantial influence of the social media platform,the demands of visual communication keep increasing for promoting traditional cultural artifacts online.As an effective medium,posters serve to attract public attention and facilitate broader engagement with cultural artifacts.However,existing poster generation methods mainly rely on fixed templates and manual design,which limits their scalability and adaptability to the diverse visual and semantic features of the artifacts.Therefore,we propose CAPGen,an automated aesthetic Cultural Artifacts Poster Generation framework built on a Multimodal Large Language Model(MLLM)with integrated iterative optimization.During our research,we collaborated with designers to define principles of graphic design for cultural artifact posters,to guide the MLLM in generating layout parameters.Later,we generated these parameters into posters.Finally,we refined the posters using an MLLM integrated with a multi-round iterative optimization mechanism.Qualitative results show that CAPGen consistently outperforms baseline methods in both visual quality and aesthetic performance.Furthermore,ablation studies indicate that the prompt,iterative optimization mechanism,and design principles significantly enhance the effectiveness of poster generation.展开更多
In this paper, equivalence between the Mann and Ishikawa iterations for a generalized contraction mapping in cone subset of a real Banach space is discussed.
In this paper, Aitken’s extrapolation normally applied to convergent fixed point iteration is extended to extrapolate the solution of a divergent iteration. In addition, higher order Aitken extrapolation is introduce...In this paper, Aitken’s extrapolation normally applied to convergent fixed point iteration is extended to extrapolate the solution of a divergent iteration. In addition, higher order Aitken extrapolation is introduced that enables successive decomposition of high Eigen values of the iteration matrix to enable convergence. While extrapolation of a convergent fixed point iteration using a geometric series sum is a known form of Aitken acceleration, it is shown that in this paper, the same formula can be used to estimate the solution of sets of linear equations from diverging Gauss-Seidel iterations. In both convergent and divergent iterations, the ratios of differences among the consecutive values of iteration eventually form a convergent (divergent) series with a factor equal to the largest Eigen value of the iteration matrix. Higher order Aitken extrapolation is shown to eliminate the influence of dominant Eigen values of the iteration matrix in successive order until the iteration is determined by the lowest possible Eigen values. For the convergent part of the Gauss-Seidel iteration, further acceleration is made possible by coupling of the extrapolation technique with the successive over relaxation (SOR) method. Application examples from both convergent and divergent iterations have been provided. Coupling of the extrapolation with the SOR technique is also illustrated for a steady state two dimensional heat flow problem which was solved using MATLAB programming.展开更多
The simultaneous iterations rithms of the ART family. It is used reconstruction technique （SIRT） widely in tomography because of is one of several reconstruction algoits convenience in dealing with large sparse matr...The simultaneous iterations rithms of the ART family. It is used reconstruction technique （SIRT） widely in tomography because of is one of several reconstruction algoits convenience in dealing with large sparse matrices. Its theoretical background and iteration model are discussed at the beginning of this paper. Then, the implementation of the SIRT to reconstruct the three-dimensional distribution of water vapor by simulation is discussed. The results show that the SIRT can function effectively in water vapor tomography, obtain rapid convergence, and be implemented more easily than inversion.展开更多
Under the weak Lipschitz condition about the solution of the equation, convergence theorems for a family of iterations with one parameter are obtained. An estimation of the radius of the attraction ball is shown. At l...Under the weak Lipschitz condition about the solution of the equation, convergence theorems for a family of iterations with one parameter are obtained. An estimation of the radius of the attraction ball is shown. At last two examples are given.展开更多
Based on local algorithms,some parallel finite element(FE)iterative methods for stationary incompressible magnetohydrodynamics(MHD)are presented.These approaches are on account of two-grid skill include two major phas...Based on local algorithms,some parallel finite element(FE)iterative methods for stationary incompressible magnetohydrodynamics(MHD)are presented.These approaches are on account of two-grid skill include two major phases:find the FE solution by solving the nonlinear system on a globally coarse mesh to seize the low frequency component of the solution,and then locally solve linearized residual subproblems by one of three iterations(Stokes-type,Newton,and Oseen-type)on subdomains with fine grid in parallel to approximate the high frequency component.Optimal error estimates with regard to two mesh sizes and iterative steps of the proposed algorithms are given.Some numerical examples are implemented to verify the algorithm.展开更多
This note explores the relations between two different methods. The first one is the Alternating Least Squares (ALS) method for calculating a rank<em>-k</em> approximation of a real <em>m</em>&...This note explores the relations between two different methods. The first one is the Alternating Least Squares (ALS) method for calculating a rank<em>-k</em> approximation of a real <em>m</em>×<em>n</em> matrix, <em>A</em>. This method has important applications in nonnegative matrix factorizations, in matrix completion problems, and in tensor approximations. The second method is called Orthogonal Iterations. Other names of this method are Subspace Iterations, Simultaneous Iterations, and block-Power method. Given a real symmetric matrix, <em>G</em>, this method computes<em> k</em> dominant eigenvectors of <em>G</em>. To see the relation between these methods we assume that <em>G </em>=<em> A</em><sup>T</sup> <em>A</em>. It is shown that in this case the two methods generate the same sequence of subspaces, and the same sequence of low-rank approximations. This equivalence provides new insight into the convergence properties of both methods.展开更多
In order to improve the performance of time difference of arrival(TDOA)localization,a nonlinear least squares algorithm is proposed in this paper.Firstly,based on the criterion of the minimized sum of square error of ...In order to improve the performance of time difference of arrival(TDOA)localization,a nonlinear least squares algorithm is proposed in this paper.Firstly,based on the criterion of the minimized sum of square error of time difference of arrival,the location estimation is expressed as an optimal problem of a non-linear programming.Then,an initial point is obtained using the semi-definite programming.And finally,the location is extracted from the local optimal solution acquired by Newton iterations.Simulation results show that when the number of anchor nodes is large,the performance of the proposed algorithm will be significantly better than that of semi-definite programming approach with the increase of measurement noise.展开更多
This paper considers Stokes and Newton iterations to solve stationary Navier- Stokes equations based on the finite element discretization. We obtain new sufficient conditions of stability and convergence for the two i...This paper considers Stokes and Newton iterations to solve stationary Navier- Stokes equations based on the finite element discretization. We obtain new sufficient conditions of stability and convergence for the two iterations. Specifically, when 0 〈 σ =N｜｜f｜｜-1/v2≤1/√2＋1 , the Stokes iteration is stable and convergent, where N is defined in the paper. When 0 〈 σ ≤5/11, the Newton iteration is stable and convergent. This work gives a more accurate admissible range of data for stability and convergence of the two schemes, which improves the previous results. A numerical test is given to verify the theory.展开更多
We introduce a general iterative method for a finite family of generalized asymptotically quasi- nonexpansive mappings in a hyperbolic space and study its strong convergence. The new iterative method includes multi-st...We introduce a general iterative method for a finite family of generalized asymptotically quasi- nonexpansive mappings in a hyperbolic space and study its strong convergence. The new iterative method includes multi-step iterative method of Khan et al. [1] as a special case. Our results are new in hyperbolic spaces and generalize many known results in Banach spaces and CAT(0) spaces, simultaneously.展开更多
Let E be a real Banach space and T be a continuous Φ-strongly accretive operator. By using a new analytical method, it is proved that the convergence of Mann, Ishikawa and three-step iterations are equivalent to the ...Let E be a real Banach space and T be a continuous Φ-strongly accretive operator. By using a new analytical method, it is proved that the convergence of Mann, Ishikawa and three-step iterations are equivalent to the convergence of multistep iteration. The results of this paper extend the results of Rhoades and Soltuz in some aspects.展开更多
玉米育种过程中,灌浆期籽粒含水率检测时,通常需要脱粒,采集穗中间200粒为检测样本。为了保护亲本,避免破坏性检测,该研究提出一种基于近红外光谱的灌浆期玉米籽粒水分定量分析通用模型,用于灌浆期玉米籽粒水分的田间原位检测。首先构建...玉米育种过程中,灌浆期籽粒含水率检测时,通常需要脱粒,采集穗中间200粒为检测样本。为了保护亲本,避免破坏性检测,该研究提出一种基于近红外光谱的灌浆期玉米籽粒水分定量分析通用模型,用于灌浆期玉米籽粒水分的田间原位检测。首先构建GA-IRIV-DS光谱数据处理策略。利用遗传算法(genetic algorithm,GA)和迭代保留信息变量(iterative retention of information variables,IRIV)二次波长筛选方法,提取光谱数据中有效的水分变量信息,减小特征空间维度的同时提高模型预测精度;再结合直接校正算法(direct standardization,DS),降低预测样本与建模样本的差异性,将玉米灌浆期穗尖部籽粒光谱数据校正为中间200籽粒的光谱,使水分定量分析模型能够具备中间200籽粒和穗尖部籽粒2种检测样本的通用性。在GA-IRIV-DS光谱数据处理策略的基础上,构建基于偏最小二乘法(partial lpeast squares regression,PLSR)的水分定量分析通用模型。经过验证,GA-IRIV-DS光谱数据处理策略校正后的光谱差异性降低了59.4%。为了进一步验证GA-IRIV-DS光谱数据处理策略的有效性,分析了GA+IRIVN组合波长筛选提取光谱特征,并分别与全光谱、多种典型波长筛选方法结合DS方法构建基于偏最小二乘法(PLSR)的水分定量分析模型结果相比较。试验结果表明,两种样本预测集GA-IRIVN-DS-PLSR模型效果均优于全光谱和其他模型,中间籽粒样本和穗尖部籽粒样本的预测决定系数(R^(2))达到了0.9715和0.9012,均方根误差(RMSEP)较全光谱下降了80.10%和64.60%。证明基于GA-IRIVN-DS光谱数据处理策略建立的近红外光谱水分定量分析模型具有一定泛化能力,可以为玉米育种过程中,减少检测过程中的样本破坏和提高检测效率提供可行的参考方法。展开更多
固态变压器(solid state transformer,SST)在新型电力系统中的应用逐渐增加,因其复杂的拓扑结构、节点数多、子模块内开关频率高等特点,使得面向SST的电磁暂态仿真计算效率低,目前针对SST大步长仿真方法的研究较少。为此,提出一种基于...固态变压器(solid state transformer,SST)在新型电力系统中的应用逐渐增加,因其复杂的拓扑结构、节点数多、子模块内开关频率高等特点,使得面向SST的电磁暂态仿真计算效率低,目前针对SST大步长仿真方法的研究较少。为此,提出一种基于离散状态空间小步合成的SST大步长仿真方法。首先,建立小步长建模、小步长仿真的离散状态空间模型;然后,根据离散状态空间方程的特点,采用小步迭代合成法构建离散状态空间大步长仿真模型,从而实现小步长建模、大步长仿真;最后,给出大步长仿真模型的二次等效方法,减少系统整体建模的系数矩阵维度,降低计算复杂度。结果表明,所提方法不仅能减少数值积分误差和电力电子开关动作误差,实现100 k Hz开关频率下SST换流系统的精确仿真,还能显著提升SST的仿真效率。展开更多
文摘A new restoration algorithm based on double loops and alternant iterations is proposed to restore the object image effectively from a few frames of turbulence-degraded images, Based on the double loops, the iterative relations for estimating the turbulent point spread function PSF and object image alternately are derived. The restoration experiments have been made on computers, showing that the proposed algorithm can obtain the optimal estimations of the object and the point spread function, with the feasibility and practicality of the proposed algorithm being convincing.
基金supported by the National Key Research and Development Program of China(2023YFF0906502)the Postgraduate Research and Innovation Project of Hunan Province under Grant(CX20240473).
文摘Due to the digital transformation tendency among cultural institutions and the substantial influence of the social media platform,the demands of visual communication keep increasing for promoting traditional cultural artifacts online.As an effective medium,posters serve to attract public attention and facilitate broader engagement with cultural artifacts.However,existing poster generation methods mainly rely on fixed templates and manual design,which limits their scalability and adaptability to the diverse visual and semantic features of the artifacts.Therefore,we propose CAPGen,an automated aesthetic Cultural Artifacts Poster Generation framework built on a Multimodal Large Language Model(MLLM)with integrated iterative optimization.During our research,we collaborated with designers to define principles of graphic design for cultural artifact posters,to guide the MLLM in generating layout parameters.Later,we generated these parameters into posters.Finally,we refined the posters using an MLLM integrated with a multi-round iterative optimization mechanism.Qualitative results show that CAPGen consistently outperforms baseline methods in both visual quality and aesthetic performance.Furthermore,ablation studies indicate that the prompt,iterative optimization mechanism,and design principles significantly enhance the effectiveness of poster generation.
文摘In this paper, equivalence between the Mann and Ishikawa iterations for a generalized contraction mapping in cone subset of a real Banach space is discussed.
文摘In this paper, Aitken’s extrapolation normally applied to convergent fixed point iteration is extended to extrapolate the solution of a divergent iteration. In addition, higher order Aitken extrapolation is introduced that enables successive decomposition of high Eigen values of the iteration matrix to enable convergence. While extrapolation of a convergent fixed point iteration using a geometric series sum is a known form of Aitken acceleration, it is shown that in this paper, the same formula can be used to estimate the solution of sets of linear equations from diverging Gauss-Seidel iterations. In both convergent and divergent iterations, the ratios of differences among the consecutive values of iteration eventually form a convergent (divergent) series with a factor equal to the largest Eigen value of the iteration matrix. Higher order Aitken extrapolation is shown to eliminate the influence of dominant Eigen values of the iteration matrix in successive order until the iteration is determined by the lowest possible Eigen values. For the convergent part of the Gauss-Seidel iteration, further acceleration is made possible by coupling of the extrapolation technique with the successive over relaxation (SOR) method. Application examples from both convergent and divergent iterations have been provided. Coupling of the extrapolation with the SOR technique is also illustrated for a steady state two dimensional heat flow problem which was solved using MATLAB programming.
基金supported by the National Natural Science Foundation of China(40974018)Nationa l863 Plan Projects(2009AA12Z307)
文摘The simultaneous iterations rithms of the ART family. It is used reconstruction technique （SIRT） widely in tomography because of is one of several reconstruction algoits convenience in dealing with large sparse matrices. Its theoretical background and iteration model are discussed at the beginning of this paper. Then, the implementation of the SIRT to reconstruct the three-dimensional distribution of water vapor by simulation is discussed. The results show that the SIRT can function effectively in water vapor tomography, obtain rapid convergence, and be implemented more easily than inversion.
基金Supported by Shanghai Municipal Foundation of Selected Academic Research and the National Natural Science Foundation of China（10571059,10571060）.
文摘Under the weak Lipschitz condition about the solution of the equation, convergence theorems for a family of iterations with one parameter are obtained. An estimation of the radius of the attraction ball is shown. At last two examples are given.
基金Project supported by the National Natural Science Foundation of China(Nos.11971410 and12071404)the Natural Science Foundation of Hunan Province of China(No.2019JJ40279)+2 种基金the Excellent Youth Program of Scientific Research Project of Hunan Provincial Department of Education(Nos.18B064 and 20B564)the China Postdoctoral Science Foundation(Nos.2018T110073 and 2018M631402)the International Scientific and Technological Innovation Cooperation Base of Hunan Province for Computational Science(No.2018WK4006)。
文摘Based on local algorithms,some parallel finite element(FE)iterative methods for stationary incompressible magnetohydrodynamics(MHD)are presented.These approaches are on account of two-grid skill include two major phases:find the FE solution by solving the nonlinear system on a globally coarse mesh to seize the low frequency component of the solution,and then locally solve linearized residual subproblems by one of three iterations(Stokes-type,Newton,and Oseen-type)on subdomains with fine grid in parallel to approximate the high frequency component.Optimal error estimates with regard to two mesh sizes and iterative steps of the proposed algorithms are given.Some numerical examples are implemented to verify the algorithm.
文摘This note explores the relations between two different methods. The first one is the Alternating Least Squares (ALS) method for calculating a rank<em>-k</em> approximation of a real <em>m</em>×<em>n</em> matrix, <em>A</em>. This method has important applications in nonnegative matrix factorizations, in matrix completion problems, and in tensor approximations. The second method is called Orthogonal Iterations. Other names of this method are Subspace Iterations, Simultaneous Iterations, and block-Power method. Given a real symmetric matrix, <em>G</em>, this method computes<em> k</em> dominant eigenvectors of <em>G</em>. To see the relation between these methods we assume that <em>G </em>=<em> A</em><sup>T</sup> <em>A</em>. It is shown that in this case the two methods generate the same sequence of subspaces, and the same sequence of low-rank approximations. This equivalence provides new insight into the convergence properties of both methods.
基金This study was supported by the“High level research and training project for professional leaders of teachers in Higher Vocational Colleges in Jiangsu Province”.
文摘In order to improve the performance of time difference of arrival(TDOA)localization,a nonlinear least squares algorithm is proposed in this paper.Firstly,based on the criterion of the minimized sum of square error of time difference of arrival,the location estimation is expressed as an optimal problem of a non-linear programming.Then,an initial point is obtained using the semi-definite programming.And finally,the location is extracted from the local optimal solution acquired by Newton iterations.Simulation results show that when the number of anchor nodes is large,the performance of the proposed algorithm will be significantly better than that of semi-definite programming approach with the increase of measurement noise.
基金supported by the National Natural Science Foundation of China(No.11271298)
文摘This paper considers Stokes and Newton iterations to solve stationary Navier- Stokes equations based on the finite element discretization. We obtain new sufficient conditions of stability and convergence for the two iterations. Specifically, when 0 〈 σ =N｜｜f｜｜-1/v2≤1/√2＋1 , the Stokes iteration is stable and convergent, where N is defined in the paper. When 0 〈 σ ≤5/11, the Newton iteration is stable and convergent. This work gives a more accurate admissible range of data for stability and convergence of the two schemes, which improves the previous results. A numerical test is given to verify the theory.
文摘We introduce a general iterative method for a finite family of generalized asymptotically quasi- nonexpansive mappings in a hyperbolic space and study its strong convergence. The new iterative method includes multi-step iterative method of Khan et al. [1] as a special case. Our results are new in hyperbolic spaces and generalize many known results in Banach spaces and CAT(0) spaces, simultaneously.
基金Supported by the Nature Science Foundation of Guangdong Province (020163).
文摘Let E be a real Banach space and T be a continuous Φ-strongly accretive operator. By using a new analytical method, it is proved that the convergence of Mann, Ishikawa and three-step iterations are equivalent to the convergence of multistep iteration. The results of this paper extend the results of Rhoades and Soltuz in some aspects.
文摘玉米育种过程中,灌浆期籽粒含水率检测时,通常需要脱粒,采集穗中间200粒为检测样本。为了保护亲本,避免破坏性检测,该研究提出一种基于近红外光谱的灌浆期玉米籽粒水分定量分析通用模型,用于灌浆期玉米籽粒水分的田间原位检测。首先构建GA-IRIV-DS光谱数据处理策略。利用遗传算法(genetic algorithm,GA)和迭代保留信息变量(iterative retention of information variables,IRIV)二次波长筛选方法,提取光谱数据中有效的水分变量信息,减小特征空间维度的同时提高模型预测精度;再结合直接校正算法(direct standardization,DS),降低预测样本与建模样本的差异性,将玉米灌浆期穗尖部籽粒光谱数据校正为中间200籽粒的光谱,使水分定量分析模型能够具备中间200籽粒和穗尖部籽粒2种检测样本的通用性。在GA-IRIV-DS光谱数据处理策略的基础上,构建基于偏最小二乘法(partial lpeast squares regression,PLSR)的水分定量分析通用模型。经过验证,GA-IRIV-DS光谱数据处理策略校正后的光谱差异性降低了59.4%。为了进一步验证GA-IRIV-DS光谱数据处理策略的有效性,分析了GA+IRIVN组合波长筛选提取光谱特征,并分别与全光谱、多种典型波长筛选方法结合DS方法构建基于偏最小二乘法(PLSR)的水分定量分析模型结果相比较。试验结果表明,两种样本预测集GA-IRIVN-DS-PLSR模型效果均优于全光谱和其他模型,中间籽粒样本和穗尖部籽粒样本的预测决定系数(R^(2))达到了0.9715和0.9012,均方根误差(RMSEP)较全光谱下降了80.10%和64.60%。证明基于GA-IRIVN-DS光谱数据处理策略建立的近红外光谱水分定量分析模型具有一定泛化能力,可以为玉米育种过程中,减少检测过程中的样本破坏和提高检测效率提供可行的参考方法。
文摘固态变压器(solid state transformer,SST)在新型电力系统中的应用逐渐增加,因其复杂的拓扑结构、节点数多、子模块内开关频率高等特点,使得面向SST的电磁暂态仿真计算效率低,目前针对SST大步长仿真方法的研究较少。为此,提出一种基于离散状态空间小步合成的SST大步长仿真方法。首先,建立小步长建模、小步长仿真的离散状态空间模型;然后,根据离散状态空间方程的特点,采用小步迭代合成法构建离散状态空间大步长仿真模型,从而实现小步长建模、大步长仿真;最后,给出大步长仿真模型的二次等效方法,减少系统整体建模的系数矩阵维度,降低计算复杂度。结果表明,所提方法不仅能减少数值积分误差和电力电子开关动作误差,实现100 k Hz开关频率下SST换流系统的精确仿真,还能显著提升SST的仿真效率。
