算法

extended progressive refinement method as a fast algorithm of radiosity minimize the recomputation time after any virtual scene modification.in this paper,the extended progressive refinement method is studied and implemented in the way of opengl.then the data which can prove the efficiency of the algorithm by changing scene reflectivity and scene geometry during experiment is obtained.in this way,the method is proved to be efficient.

摘 要：当虚拟场景发生变化时，扩展的逐步求精算法作为一种快速的辐射度算法，大量减少了重新计算辐射度所花费的时间。对扩展的逐步求精算法进行研究，并利用opengl对算法进行了实现。通过在实验中对虚拟场景的表面反射率和几何属性进行改变，获得了一些证明算法有效性的数据，从而验证了该算法的有效性。

Based on the analysis and research of the domestic and overseas EIT algorithms, a practical and fast EIT algorithm with better resolution---Fast Newton's One-Step Error Reconstructor dynamic algorithm is studied and realized in this dissertation. Based on a great deal of experiment researches, the EIT algorithm and performance of hardware-measuring device needed by imaging system are analyzed.

本论文在分析、研究国内外有关电阻抗成像重建算法及其研究状况的基础上，研究实现了一种实用、快速、具有一定分辨率的电阻抗成像算法——快速牛顿一步误差重构动态算法，对成像算法进行了大量的实验研究和数据分析，对成像系统所采用的硬件测量装置的性能进行了研究。

As the Jacobi Matrix of Fast One-Step Newton Error Reconstructor algorithm can be calculated previously t, the same imaging speed as back-projection algorithm can be made. The study results show that the FNOSER algorithm can obtain static image with a character of high space resolution, accurate orientation, fast imaging, and so on.

2基于牛顿法的一步误差重构算法对静态电阻抗成像技术进行了详细研究，推导出FNOSER 静态算法，快速牛顿一步误差重构算法其雅可比矩阵等可以事先计算好，从而可以获得和反投影算法类似的成像速度。

Based on the study of triangle mesh of creation algorithm, include the arithmetic of regular data make triangle mesh and irregular data make triangle mash. The paper put forward a optimized triangle mesh algorithm. Its key point is divide data into pieces in advance, then set up the net. The experiment result shows that this algorithm improves not only the efficiency of terrain molding, but also the precision compared with the old algorithms The main purposes of this paper are research visualization algorithm of three dimensions and the arithmetic of terrain visualization.

本文研究了基于三角形网格的地形建模的基本理论和方法，包括规则数据的三角网生成以及不规则三角网 TIN 的生成算法，总结了前人在这些方面所做的工作，本文提出了一种优化的三角网格生成算法，实验结果表明，该算法不仅提高了地形建模的效率，而且所生成的三角网格模型与以往算法相比精确性也有很大的提高。

And a new method of image stabilization is presented in order to quickly solve the problem of the translational and rotational motion between image sequences.First,the translational motion is calculated and compensated based on the gray projection algorithm.

针对视频图像序列的非稳特性，研究了电子稳像算法中灰度投影算法和块匹配算法各自的不足之处，提出了一种快速补偿视频图像序列间平移及旋转运动的稳定成像算法。

Finally, the programme of design for routing protocols is chose in the thesis. Secondly, improved algorithms are introduced in detail. In order to achieve to reduce duplication of data sent in, save energy, prolong the network lifetime and balance the network load, improved algorithms are based on the minimum hops algorithm which is one of the energy-aware routing, When the characters of the minimum hops algorithm are analysed in detail,multi-path routing, adaptive dynamic routing, routing reliability are designed.Then a new algorithm based on minimum hops in plane routing protocol and a new algorithm based on minimum hops in clustering routing protocol are designed in the thesis.

接著详细介绍了本文的改进路由算法，为实现减少数据的重复发送量、节约能量、延长网络寿命、平衡网络负载的目标，本文以能量感知路由之一的最小跳数算法为基础，详细分析了最小跳数算法的特点，设计了多路径修正路由，自适应动态路由，路由可靠性机制三方面的改进方案，并且结合改进方案设计了基于最小跳数的改进平面路由协议和基于最小跳数的改进分簇路由协议，将两种类型算法的优点相结合，提高网络的健壮性与可扩展性。

Three polygon scan conversion algorithm, the seed fill algorithm, boundary markers algorithm, scan-line algorithm.

详细说明：多边形的三种扫描转换算法，种子填充算法，边界标志算法，扫描线算法。

Description of seed filling algorithm and the scan line fill algorithm algorithms to compare the advantages and disadvantages of these two algorithms.

详细说明：描述种子填充算法和扫描线填充算法的算法原理，比较这两种算法的优缺点。

And an exact maximum likelihood registration algorithm is presented based on three-dimensional plane. This method contains two sets of partially separable variables (the actual target positions and the sensor registration errors) and provides a two-step recursive optimization algorithm to ensure fast convergence. Described by expressions:(5.26)?(5.39). It resolves the problems on Multiple-platform.

同时本文还推导出了三维立体投影的极大似然配准算法，算法包括两组部分可分的变量：实际目标位置和传感器的配准误差，利用两步递归优化算法对收敛速度进行了优化处理，实现过程可参阅式5.26～5.39，此算法解决了不同平台内多传感器配准过程中所存在的问题。

However, its decision surface is still a hyperplane, In order to enhance its classification ability and solve the limitations of kernel perceptron algorithm, kernel method is used to generalize the α-LMS algorithm without considering whether the projected data set in high dimensional space is linearly separable or not.

另外，经典的核感知器算法也只能解决高维空间中的线性可分问题，对线性不可分问题仍无法收敛，为提高α-LMS算法的分类能力和克服核感知器算法的局限性，本文利用核方法构造了核α-LMS算法。

But we don't care about Battlegrounds.

但我们并不在乎沙场中的显露。

Ah! don't mention it, the butcher's shop is a horror.

啊！不用提了。提到肉，真是糟透了。