该能量的局部极小值是与期望得到的图像属性相关的。
Local minima of this energy then correspond to desired image properties.
经典LBG算法的局部极小值问题是制约其性能的重要因素。
The local minimum problem is a much important factor which restricts the performance of the classic LBG algorithm.
摩擦阻力的变化趋势与速度类似，在产生逆向流处出现局部极小值。
The variation of local friction coefficient is similar to velocity and local minimum value occurred in reverse flow area.
改进后的BP网络具有收敛速度快、稳定、易于跳出局部极小值的特点。
The improved BP is fast and stable in convergence, and easy to pick out partial minimum.
通过多次选择初始变换的搜索策略，解决了搜索过程中出现的局部极小值问题。
Depending on the strategy of choosing initial transformations many a time, the local minimum problem in process of iterative detection have been solved.
最大能量法的结果受初始静校正量的影响，它的解容易陷入目标函数的局部极小值。
The result of maximum energy method depends on the initial values of residual statics. The solution is often trapped into the local minimum of the objective function.
传统的神经网络算法应用于故障诊断时，具有易陷入局部极小值，收敛速度较慢等缺点。
Traditional neural network algorithms are easy to fall into the local minimum, slow convergence when in fault diagnosis.
小波神经网络的训练采用自适应调整学习率及动量系数的方法，以避免陷入局部极小值。
The self-adaptive learning rate and momentum coefficient are used to avoid the local minimum point in the training process of wavelet neural network.
对于传统BP算法存在的收敛速度慢和易陷入局部极小值问题，人们提出了径向基函数网络。
People put forward radial basis function networks considering the conventional BP algorithm problems of slow convergence speed and easily getting into local dinky value.
从本质上讲，无功优化调度问题是具有大量的局部极小值的多约束全局优化问题，且含有大量的离散变量。
Essentially, optimal reactive power dispatch is the multi-restraint overall optimization problem with plentiful local minima and discrete variables.
针对粒子群优化算法(PSO)应用于多极值点函数易陷入局部极小值，提出旋转曲面变换(RST)方法。
Aimed at particle swarm optimization (PSO) algorithm being easily trapped into local minima value in multimodal function, a rotating surface transformation (RST) method was proposed.
另外，R BF神经网络是一种局部逼近网络，问题有唯一确定的解，不存在BP网中所遇到的局部极小值问题。
The RBF nerve network is one kind partial approaches network and the question has the only determination solution, moreover, the BP net often meets the partial minimum problem.
仿真结果表明，此专家系统在训练中能够迅速收敛避免陷入局部极小值，而且同时具有较好的容错性和较高的稳定性。
Stimulation results demonstrate the convergences of expert system are well, and it can avoid falling into local minimum. It also has better fault tolerance and high stability.
实验结果表明，该算法可以避免FCM的误分类，诸如陷于中心死区、中心重叠和局部极小值，而且提高了分割速度。
The experimental results show that the algorithm can avoid the misclassification of FCM such as dead center, center overlapping and local minima, and accelerate the segmentation speed.
然而模拟退火算法依然存在着其自身的不足，即避免陷入局部极小值以及解空间的搜索能力和范围这两项指标不是很理想。
But simulated annealing algorithm also has weak point, that it is not very satisfactory of avoiding falling into local minimum and search capability and area of solution space.
在培训过程中采用培训时间控制策略和再学习策略，有效地防止了培训过度，可作为解决局部极小值问题的一种实用措施。
Strategy of limited training time and learning again prevent the network from over-training, and from being lost in local minimum.
先对传统的BP人工神经网络进行了分析，针对其收敛速度慢，存在局部极小值的缺点提出了一种改进后的BP人工神将网络。
An improved BP neural network is proposed for the purpose of overcoming the slow convergence and existence of local minimum in conventional BP neural network.
本文分析了传统的人工势场法由于局部最小问题而导致规划失败的原因，对可能产生局部极小值区域的障碍物外部几何形状进行分析。
Analysis of the traditional artificial potential field failed in path planning due to the local minimum and the possible local minimum area of the external obstacles on the geometry.
结果表明，对于这种大的分子团簇的结构优化，经典分子动力学能很有效地找到体系局部势能极小值。
The result discovered that, regarding this kind of large molecular cluster of structure optimization, we can very effectively find the local energy minimum by classical molecular dynamics.
如果仅仅小于附近任一点的值，那它就是相对的，或者说是局部的极小值。
If it is merely less than at any nearby point, it is a relative, or local, minimum.
然后以重心为极点，对边缘点极坐标化，形成幅角-极径曲线，在该曲线上寻找局部极大极小值点。
Third, argument-polar radius curve of polar coordinate system whose pole is geometric gravity is formed, and maximum and minimum value points are searched.
然后以重心为极点，对边缘点极坐标化，形成幅角-极径曲线，在该曲线上寻找局部极大极小值点。
Third, argument-polar radius curve of polar coordinate system whose pole is geometric gravity is formed, and maximum and minimum value points are searched.
应用推荐