查询词典 corresponding points

First,the convex hull points of the characteristic region such as eyes,mouth etc. are confirmed,and,the integral contour points are obtained by fitting the curve.Then,the coordinate of the contour and the corresponding points of the adapted facial model are transformed to a new coordinate.At last,the model is adjusted in the new coordinate to get a good adaptation between the human facial model and human face image by revising the corresponding detail data in the model.

首先，对检测出的眼睛、嘴巴等特征区域，确定出其外凸包点集，通过曲线拟合得出其完整外轮廓，然后对此轮廓点以及已经粗调的对应模型点进行坐标转换，在转换后的坐标系中，对模型中相应的细节数据进行修改，实现模型和人脸图像的配准。

Article 13 A local people's congress at or above the county level shall examine the draft general budget at the corresponding level and the report on the implementation of the general budget, approve the budget and the report on its implementation at the corresponding level, alter or annuls inappropriate resolutions made by the standing committee of the people's congress at the corresponding level on budget or final accounts, and annuls inappropriate decisions and orders made by the government at the corresponding level on budget or final accounts.

第十三条县级以上地方各级人民代表大会审查本级总预算草案及本级总预算执行情况的报告；批准本级预算和本级预算执行情况的报告；改变或者撤销本级人民代表大会常务委员会关于预算、决算的不适当的决议；撤销本级政府关于预算、决算的不适当的决定和命令。

Refer to the research findings of CHengDu Research Institute of Geosciences and Minerals(1990) and Nanjing Research Institute of Geography and Lake of Chinese Academy of Sciences(1989), according to the Guidebook of China Stratum(2000), the chronostratigraphy of Kunming Basin is divided into 4 age: the bottom of the Quaternary corresponding to M/G Boundary, age is 2.6Ma;the Bottom of the Mid-Pleistocene corresponding to B/M Boundary, age is 0.78Ma;the Bottom of the Upper-Pleistocene corresponding to the Blake event, age is 0.128Ma;the Bottom of the Holocene corresponding to the Gothenburg event,age is 0.012Ma.

本次研究获得了大量的测年数据，参考成都地质矿产研究所(1990)及中科院南京地理与湖泊研究所(1989)等的研究成果，按照中国地层指南(2000)的方案，厘定了昆明盆地第四纪年代地层划分：第四系底界对应古地磁松山反向期与高斯正向期界线处，年龄为2.6Ma；更新统中部底界对应古地磁布容正向期与松山反向期界线，年龄为0.78Ma；更新统上部底界对应古地磁布莱克事件附近，年龄约0.128Ma：全新统底界对应古地磁哥德堡事件附近，年龄约0.012ma。

Point clouds are discrete data points without the topology relationship between them. So, to facilitate and expedite the extraction of contour points for the late NPR style, firstly we should simplify the point cloud data. In other words, non-contour points should be eliminated but their contour points and feature points should be retained .

点云数据本身是无拓扑关系的离散数据点集，所以，为了方便和加速后期非真实感绘制风格化所需轮廓点的提取，首先对点云数据进行了"粗略"地简化处理，即剔除点云数据中非轮廓点保留了其轮廓点和特征点；然后应用判定准则提取出所表示物体的轮廓点并对其进行"归并"形成便于NPR风格化处理的特征轮廓线；最后再对得到的轮廓线进行NPR风格化效果"加密"处理。

Based on analyzing the algorithms of Delaunay triangulation creation in domestic and abroad, in view of the situation of building DTM and the need of realizing railway 3D visual design, a divide-and-conquer algorithm to build DTM is presented, the algorithm use square grids to manage disordered points, to form triangular meshes in grids, DTM can be obtained by merging the triangular meshes, so that the work of sorting of the disordered points before building DTM is reduced greatly; moreover, the algorithm utilize subarea to control the vertices of convex hull so that the range which support points locate in can be predefined when searching support points, the workload of searching support points can be reduced and the speed of merging two triangulations is raised.

在分析了国内外构建DTM算法的基础上，针对DTM算法的现状及铁路线路三维可视化设计的需要，创立了一种构建DTM的分治算法。算法引入方格网管理离散点数据，在格中构建三角网，然后再将这些三角网合并形成DTM，极大地减少了构网前对所有参加构网的离散点进行排序的工作量。此外，通过对凸包顶点数据进行分区管理，在搜寻凸包支撑线时，能预先确定出支撑点的范围，减少了搜索工作量，提高了三角网的合并速度。

Mainly in a method of the lattice vector quantifying coding and decoding, a new basic code book is selected out and directly or indirectly comprises all points whose value is less than or equal to 3 of any dimension in a RE point set, and points on a fourth grade hypersphere in the basic code book are all odd points so that part of nearest adjoint point values can be comprised in the basic code book only via corresponding odd number processing.

一种格矢量量化编解码的实现方法及装置，其主要是在格矢量量化编码方案中，选定新的基础码本，在该基础码本中直接或间接地包含了RE 8 点集中任意维的数值小于等于3的所有点，且该基础码本中的第4级超球面上的点全部为奇数点，以使得部分的最近邻点数值仅经过相应的奇数化处理便可以包含于基础码本中。

The synthesis scheme we developed can deal with changes in visibility, produce perspectively correct views and handle the distortion around the circumferences in the synthesized views. In our scheme, the area without corresponding points was first determined by using Fourier transformation in order to deal with distortion problem, within the mutual overlapped area the z-buffer values of matched key points were computed so that the visibility in novel views can be handle correctly, lastly the common points in new views are rendered through epipolar geometry constraint.

算法的步骤为：利用傅立叶变换方法确定相邻源图像无对应点的区域；然后，利用尺度空间和相位一致原理在共同区域提取及匹配边缘上的关键点，计算其深度值，并在新图像中由该值判别虚拟图像中的可见性；再由关键点恢复极线约束，通过极线间的位置和颜色插值生成虚拟图像中有对应区域的一般点；在确定极线位于无对应点区域段后，利用加权平均或放大插值的方法实现了源图像无对应点区域在虚拟图像中的自然过渡。

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.

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

Firstly, because the triangle constrained matching propagation begins with the initial corresponding triangulations formed by a few seed points in the stereo pairs, this dissertation studies the affects of different numbers and different distributions of seed points on the image matching results through experimental analysis, and proposes a seed point selection strategy for different image texture conditions, an automatic selection algorithm is also designed that gives good distribution quality for a defined number of seed points.

首先，针对匹配传播过程中的种子点选取问题，通过实验分析研究了不同数量与分布的种子点所构成的初始三角网对匹配结果的影响，进而提出了不同影像条件下的种子点选取策略和一种自动提取一定数量、满足一定分布均匀度的种子点自动选取算法；其次，研究了海量数据情况下同名三角网的快速构建、数据组织存储与局部动态更新的方法；在此基础上，本文提出了随机传播、基于三角形拓扑关系的邻近传播和顾及纹理特征的自适应传播等三种传播策略，分别介绍了其详细的实现算法，并通过实验分析对这几种传播策略进行了比较，实验结果证明自适应传播方法在匹配的可靠性上最优。

This is my last OpenGL for a project to use the "three-dimensional vector space / point" and related functions, they can use a definition of space vector / points, for the vector translation, zooming and rotation, the use of correlation function can also achieve two vector by the fork, get a Vectors absolute length of a vector unit, received a 3:00 decision vector perpendicular to the plane, a space to be the distance between two points, two vector to be the plot points, to be the angle between two vectors, such as operating for the use of user-friendly, each function is detailed Notes, it is particularly important if the calculation vector plot points, fork also took note, we hope to have useful.

这是我过去进行一个OpenGL项目时使用到的"三维空间向量/点"类及相关函数，使用它们可以定义一个空间向量/点，实现向量的平移，缩放和旋转等，使用相关函数还可以实现两向量的叉乘，得到一个向量的绝对长度，将一个向量单位化，得到一个三点决定的平面的垂直向量，得到空间中两点的距离，得到两向量的点积，得到两向量的夹角等操作，为方便用户的使用，每个函数都有详细的注释，特别重要的向量计算如点积，叉乘还有相关说明，希望对大家有所用处。

Now she was hungry and angry.She began to smoulder.

现在她又饿又气，她开始流露难以抑制的怒火。

You have placed our iniquities before You, Our secret sins in the light of Your presence.

诗90：8 你将我们的罪孽摆在你面前、将我们的隐恶摆在你面光之中。