邻域

To advance the concept system of half space in the vicinity of parametric surface which has been used to settle the key technique problem of set operations-a unified classification method between surface and solid.

提出了参数曲面的邻域半空间的概念体系，并利用邻域半空间解决了集合运算过程中曲面与实体统一分类的关键技术问题。

Based on data cloud, which is measured from 3-coordinate measuring machine or so, an algorithm to search lopological structure from 3D unorganized points using Envelopment-box technology is proposed in this thesis. Based on this method, we searching neighbor points of sampling point. We also improve the Max-Min angle criteria to realize local triangulation, and then get the normal of sampling point from the triangulation. Using the normal and neighbor relationship, classification of scattered data points is realized according to the quadric surface.

本文以测量得到的曲面数据点点云为基础，提出了一种基于包围盒的自动寻找三维散乱数据点之间拓扑结构的方法，采用该方法寻找采样点的邻域结点，并对三角剖分中的典型优化准则—最小内角最大准则提出了改进，按照改进后的优化准则实现了采样点的局部三角划分，并进一步求解得到采样点的法向量，依据法向量及邻域拓扑关系在二次曲面的基础上实现了散乱数据曲面重构中的数据点的自动分类。

Experiments show that rhomb partitioning is more powerful in suppressing block artifacts than square partitioning, results in much higher reconstructed image quality, but takes longer encoding time; 2 For solving exhausting encoding problem of fractal image coding, we present a fast rhomb-partitioning fractal image coding based on neighbor-searching; we present a fast rhomb-partitioning fractal image coding based on block classification; we present a fast square-partitioning fractal image coding based on neighbor-searching, block classification and wavelet transform.

2针对分形图象压缩编码过程非常耗时的致命弱点，提出了基于邻域搜索的菱形块分割的快速分形图象压缩编码方法，提出了基于块分类的菱形块分割的快速分形图象压缩编码方法，提出了基于邻域搜索·块分类和小波变换的方块分割的快速分形图象压缩编码方法，实验结果表明，我们提出的快速分形图象压缩编码与传统的分形图象压缩编码相比，编码速度提高了近40倍。

The success of star map match is judged according to compute the EMD distance of two stars.

针对现有的识别算法存在识别速度慢，识别成功率不高，提出了一种新的星图识别算法，该算法根据恒星星等，利用锚定的方法，使待识别星图中的星落于导航星图中的星的ε邻域，对于未落于ε邻域的星，建立有向赋权二部图，进行完美匹配，根据计算星对之间EMD距离，来确定星图的匹配是否成功。

It is proved that the topological neighborhood is self-adaptive and goes to triviality with the increase of the dimension.

对拓扑邻域进行了理论分析，说明其是自适应的，随着维数的不断升高，趋于平凡拓扑邻域。

In the meanwhile, new neighborhood-search reference model is added into the new method to enhance ulteriorly overall situation of classification results.

同时在新方法中使用新的邻域搜索参考模型，增强了方法在搜索过程中对邻域信息的参考强度，使得分类结果的全局性得到了进一步加强。

At first, we give the more precisely expression of the system in some sufficiently small neighborhood of the saddle point under some suitable transformation, and use the foundational solutions of the linear variational equation of the unperturbed system along the homoclinic or heteroclinic orbits as the demanded local coordinate system.

首先，我们在鞍点的充分小邻域内给出系统在适当的变换下的更加精确的表达形式，利用未扰系统沿同宿，异宿环的线性变分方程的基本解组作为系统在同宿，异宿环的小管状邻域内的新的局部坐标系。

Coordinate sequence method is made up of the instruct information of polygon boundary x, y coordinate. It is the easiest polygon vector encoding method. The file structure of this method is easy, but because of the polygon boundary has stored two times, it will produce data redundancy, moreover, short of neighbor threshold information; Tree index encoding method make all the boundary points digitizing, store the coordinate sequence, connect the point index to boundary line, and then connect the line index to other polygons, so as to the tree index structure has came into being. It eliminates neighbor polygons boundary data redundancy problems; Topology structure encoding method is a method which by setting up a complete topology relationship structure, resolve the neighbor threshold and island information process problem. However, it makes arithmetic more complicated and makes database bigger.

坐标序列法是由多边形边界的x，y坐标对集合及说明信息组成，是最简单的一种多边形矢量编码法，文件结构简单，但多边形边界被存储两次产生数据冗余，而且缺少邻域信息；树状索引编码法是将所有边界点进行数字化，顺序存储坐标对，由点索引与边界线号相联系，以线索引与各多边形相联系，形成树状索引结构，消除了相邻多边形边界数据冗余问题；拓扑结构编码法是通过建立一个完整的拓扑关系结构，彻底解决邻域和岛状信息处理问题的方法，但增加了算法的复杂性和数据库的大小。

As it can be expressed easily by argument equations, we use the conicoid as the criteria of points" classification. Based on the point"s normal and the adjacent field, corresponding to the conicoid equation such as plane, ball and cylinder, we search the points that fit the equation along the adjacent field. Using this method, we realized the automatic classification of unorganized points.The experiments using the algoritlim and criteria approved from this thesis are also carried out.

本文采用了可以比较方便地用参数方程表示的二次曲面作为数据点的分类标准，根据点的法向量以及其邻域结点的各种属性，对应于平面、球面、柱面等二次曲面，依据曲面方程的特点，从起始点开始沿邻域深度优先递归寻找符合方程的数据点，实现了散乱数据点的自动分类。

This framework has several applications, including improve the performance of HAMMER algorithm and extent HAMMER method from pre-segmented image to intensity image domain, which greatly overcome it limitation. In the first application, after the fixed scale used in HAMMER algorithm to extract GMI feature is replaced with the learnt best scale and active point is learnt according to the saliency and consistency measurement, more accurate registration results have been obtained in both real data and simulated data.

首先，用学习到的最佳邻域大小代替HAMMER算法中的固定邻域，用学习到的图像关键点代替HAMMER中只经过简单阈值处理得到的驱动点，使得HAMMER算法的性能在真实和模拟的人脑MR图像上得到了显著的提高。

According to the clear water experiment, aeration performance of the new equipment is good with high total oxygen transfer coefficient and oxygen utilization ratio.

曝气设备的动力效率在叶轮转速为120rpm～150rpm时取得最大值，此时氧利用率和充氧能力也具有较高值。

The environmental stability of that world - including its crushing pressures and icy darkness - means that some of its most famous inhabitants have survived for eons as evolutionary throwbacks, their bodies undergoing little change.

稳定的海底环境─包括能把人压扁的压力和冰冷的黑暗─意谓海底某些最知名的栖居生物已以演化返祖的样态活了万世，形体几无变化。