传统算法

• The algorithm transforms 2 - dimesion image data to 1 - dimension data by projecting the character binary image on vertical and horizon direction , as to a character image of w x h size , it reduced the operation time from about w + h level to about w x h level compared to the traditional algorithm and greatly reduced the time complexity of later processing , meanwhile it saved enough vertical and horizon lattice distribution information of the character
  算法通过将字符二值化点阵图像进行垂直与水平方向投影，实现了从二维图像数据到一维数据的转化，对于w h大小字符图像，相对于传统算法，本算法将运算量从w h数量级将至w + h数量级，大大降低了后续处理运算的时间复杂度，同时保留了足够的关于字符垂直及水平点阵分布的特征信息。
• This 3d modeling method overcomes the limitations of traditional algorithm which is extremely complicated , difficult in combination operation , hard to build the correct topologicai relation among data and solves a series of technical difficulties such as model interaction and division . therefore it greatly facilitates and simplifies the construction and processing of 3d model
  该建模方法克服了传统算法建模数据结构过于复杂，交接拼合计算困难，难于建立模型控制点之间正确的拓扑关系等局限；解决了模型交互、任意剖切等技术难题，大大方便和简化了三维模型的建立和后续处理过程。
• 3 ) the instruction - level parallel calculation of streamlines on 3d curvilinear grids has been implemented firstly by using the streaming simd extensions ( sse ) , which are a set of extensions of the intel pentium hi / 4 processor . compared with the conventional algorithm , sse - based algorithm coded by vector class library enhances performance about 55 % , and coded by inlined - assembly is about 75 %
  ) pentium ( pentium4 )处理器的流simd扩展( sse ) ，首次实现了3d曲线网格流线计算的指令级并行，与传统算法相比，向量类库编码实现的sse算法将性能提高了55左右，嵌入汇编实现提高了75左右。
• Simple cell mapping is improved by altering cell and combined with point mapping respectively to enhance the ability and reliability of global analysis . as an example , pseudo - periodic cells , which were included in the numerical solutions given by conventional cell mapping method , can be excluded from the attractors . in this paper , simple cell mapping method is able to analyze and study the extremely complex non - linear system of atmospheric environment
  本文分别通过在传统简单胞映射中引入变胞映射的思想，和将点映射和胞映射相结合的方法，明显提高了简单胞映射的全局分析能力和可靠程度，例如有效地从吸引子中排除了传统算法带来的伪胞，使其能够胜任大气环境非线性复杂系统的分析和研究。
• A novel motion estimation algorithm which is based on compensability analysis of the input video signal is proposed . the motion estimation operation is performed only on the compensable blocks in the image frame . the time of estimation computation and the bits for coding the motion vectors are all reduced significantly than those of conventional algorithms
  本文介绍了一种新颖的运动矢量估计算法，我们首先对待编码的图像进行可补偿性分析，然后运动矢量搜索只对可补偿块操作，因此无论是搜索次数还是用于对运动矢量编码的比特数均明显少于传统算法
• For the reason that this method use the arrangement of characteristic light spot directly to avoid the aberrance that come out during calculating in traditional method , it can improve the estimation precision of position and attitude . besides , it provides a certain degree of redundancy to the visual navigation system
  由于该算法直接利用特征光点的几何配置条件,避免了传统算法在计算过程中出现畸变的问题,从而提高了位置和姿态角估值的精度,并使月球车的视觉导航系统具有一定的冗余性。
• To accelerate the learning process of self - organizing mapping in the situation of large mount of data or high dimension , two learning algorithms were proposed in this paper , by using partial distortion search and extended partial distortion search respectively to solve the problem of nearest neighbor search during learning process , which could reduce the multiplications greatly
  摘要针对传统的自组织映射网络在大数据量或高维情形下训练过程较慢的问题，提出了分别使用部分失真搜索和扩展的部分失真搜索来完成传统算法中最耗时的最近邻搜索过程，减少了完成训练所需乘法次数。
• The conventional ways has low efficiency , which result in the application of overlap grid in moving - grid problem , which need re - disposes the interpolating connection in every step in time direction , is very difficult considering the computational efficiency . aim at the above problem in application of overlap grid , this paper using an new manner rooting in analysissitus to put forward a “ method of distinguishing points of intersection ” and develop corresponding computational soft , which could realize the automatic and shape - independent pre - disposal process for overlap grid . to deal with the problem of low efficiency for pre - disposal process in moving - grid , this paper bring forward the “ mosaic ” method and adt method which based on the huge memory of modern computer
  对于重叠网格在动网格应用中的计算效率问题,本文通过进一步研究插值信息的高速查询方法,提出不同于传统算法思路,以现代计算机大内存为基础,用计算机物理内存空间换计算时间的” mosaic ”方法以及应用基于二叉树数据结构的adt ( alternatingdigitaltree )方法两类方法,成功的将原处理时间提高了两个数量级? ?即将网格规模在百万量级的重叠网格预处理时间从传统方法的耗时30 60分钟提高到几十秒钟,从而成功解决了这一问题。