实验结果表明共扼梯度最优化迭代算法是鲁棒的、快速收敛的，并且大量节省内存。
Experiment results show that the conjugate gradient reconstruction algorithm is robust, rapid convergent, and memory saved.
它们均是一种随机搜索的迭代算法，对优化对象的性态无要求。
They are a kind of stochastic search iterative algorithm and no demand of optimization object.
DOE的相位分布由数值迭代相位恢复算法优化得到。
The phase distribution of DOE is optimization result of iterative phase retrieval algorithm.
建立了相机畸变的数学模型，并通过迭代优化算法估计相机的畸变参数。
The camera distortion model is builded and the distortion parameters can be estimated by iterative optimal algorithm.
在采用一个鲁棒性匹配误差映射函数的基础上，使用一种类牛顿法的迭代优化方法实现了基于仿射模型的图像目标跟踪算法。
With the use of a robust error mapping function, an affine model-based target tracking algorithm is formulated, in which a quasi-Newton's iterative method is implemented in the optimization progress.
它们均是随机搜索的迭代算法，对优化对象的初始状态无要求。
They are stochastic search iterative algorithms and no demand of optimization object.
研究和分析了迭代优化算法的收敛性。
多目标遗传优化算法的一个优点就是可在一次迭代计算中寻找到问题的多个非劣最优解。
One advantage of multi-objective genetic optimization algorithms over classical approaches is that many non-dominated solutions can be simultaneously obtained by their single run.
迭代最优化算法是模式识别中一种重要方法。
The iterative optimization algorithm is an important method in pattern recognition.
给出了角点检测算法、退化问题的避免措施以及基于秩2约束的基础矩阵迭代优化求解的方法。
The corner detection algorithm, avoidance of the degeneration problem and the fundamental matrix iterative optimization algorithm based on rank-2 constraint were introduced.
其中优化迭代搜索过程又包括各参数优化算法的选取、坐标变换过程中灰度的插值计算等。
The optimal iterative search process includes the selection of the parameter optimization algorithm, the gray interpolation calculation during the process of coordinate transformation.
在此基础之上，利用改进的迭代算法完成曲面匹配的精确调整达到了全局最优化的目标。
On basis of these, an improved iterative algorithm is used in the exact adjustment to ensure the global optimization.
粒子群优化算法(PSO)是一种进化计算技术，是一种基于迭代的优化工具。
Particle Swarm optimization (PSO) is an evolutionary computation technique and an optimization tool based on iteration.
该方法基于MAP算法，通过利用梯度投影的方法对重建结果不断进行迭代优化得到最终的理想高分辨率影像。
In order to attain a high-resolution image, the algorithm is based on the MAP algorithm, solving the optimization by proposed iteration steps with using the gradient projection method.
把回弹量作为修改模具几何的基础，本文给出了一个获得优化模具几何的迭代算法。
The springback is extracted to be a basis of modification of die geometry. An iteration algorithm is given to obtain the optimum geometry of die.
本文对于矩形区域上某一内点为奇点的奇异积分的近似计算给出了优化中心数值算法，它在迭代计算过程中避免了函数值的重复计算。
This paper presents an optimum numerical algorithm of center rule for the approximate evaluation of singular integrals over rectangular domains with a inner singularity.
文中给出了融合系统检测性能最优化的必要条件，以及求解最优系统判决规则的数值迭代算法。
The necessary conditions for optimum detection for the distributed detection systems are derived, and a numerical iterative algorithm for obtaining the optimum sensor decision rules is presented.
为确定多层人工神经网络的权值和阈值建立了混合求解方法，即迭代前期采用BP算法，而迭代后期采用梯度优化法进行计算。
Mixed method was built to calculate the weights and thresholds of multi-layer neural network by utilize BP algorithm and terraced optimizations.
为确定多层人工神经网络的权值和阈值建立了混合求解方法，即迭代前期采用BP算法而迭代后期采用梯度优化法进行计算。
Mixed method is built to calculate the weights and thresholds of multi-layer neural network by utilize BP algorithm and terraced optimizations.
但相应算法本质上是迭代性的，这样一来就又存在一个优化的问题，包括算法本身的优化与实现开销的优化两方面。
Due to the iterative property of such algorithm, there arises the issues of optimizations, including algorithmic optimization and cost optimization.
在新的控制条件下，证明了二次型极小化问题的迭代算法的有效性，所得结果改进了徐洪坤关于二次型优化的最新结果。
Under new control conditions, we prove convergence of the quadratic minimization problem, which improves the recent results by Xu about quadratic optimization.
使用迭代的启发式最优化算法来解决多例学习中复杂的整型规划问题，以使分类风险最小化。
The learning approach leads to a hard mixed integer program that can be solved iteratively in a heuristic optimization.
最后充分考虑上下文信息，利用概率松弛迭代算法对粗检测信息进行优化。
Lastly, the probabilistic relaxation iteration algorithm is used to optimize the information after fully considering the context information.
它们的共同目的都是在优化算法中求出每次迭代步的位移，从而求出新的迭代点，但是它们产生迭代步位移的途径不同。
Their common purpose is to compute the displacement at each iteration step in any optimization algorithms and obtain a new iteration point. But the methods of produce iterative step are different.
应用理论模型验证了最短射线路径的优化循环迭代算法的可行性；
The optimized cycling alternation algorithm for the shortest ray path is brought forward and the optimized shortest ray path is given.
实际系统的计算结果表明，此算法的迭代收敛次数稳定，与系统规模关系不大，在求解大规模系统无功优化问题时，其性能优于具有指数时间复杂性的单纯性法。
The computation results of practical power systems show that the number of iterations of this algorithm is independent of system's size, and it is superior to simplex...
该算法将复杂的优化问题转化为几十次简单的迭代加以解决，每次迭代只需几次快速傅里叶变换和收缩操作即可。
The algorithm converts the complex optimization problem to several iterations, each of which requires only several simple Fast Fourier Transformations and shrinkage operations.
通过使用优化的迭代算法，可以使得整个二元BCH码的译码速度得到明显的提高。
So the iterative times are reduced greatly. By optimized iterative algorithm, the speed of decoding BCH codes gets increased obviously.
通过使用优化的迭代算法，可以使得整个二元BCH码的译码速度得到明显的提高。
So the iterative times are reduced greatly. By optimized iterative algorithm, the speed of decoding BCH codes gets increased obviously.
应用推荐