无拓扑矢量数据快速压缩算法的研究与实现

首先论述传统矢量数据压缩算法：道格拉斯—普克法，分析将其应用于多边形边界数据压缩所造成的图形失真现象，在此基础上提出一种针对无拓扑矢量数据的快速压缩算法，并在MapInfo环境中实现该算法。     

The Integration of Cooperation Model and Genetic Algorithm

In the photogrammetry,some researchers have applied genetic algorithms in aerial image texture classification and reducing hyper-spectrum remote sensing data.Genetic algorithm can rapidly find the solutions which are close to the optimal solution.But it is not easy to find the optimal solution.In order to solve the problem,a cooperative evolution idea integrating genetic algorithm and ant colony algorithm is presented in this paper.On the basis of the advantages of ant colony algorithm,this paper proposes the method integrating genetic algorithms and ant colony algorithm to overcome the drawback of genetic algorithms.Moreover,the paper takes designing texture classification masks of aerial images as an example to illustrate the integration theory and procedures.     

Shape Similarity measures of Linear Entities

The essential of feature matching technology lies in how to measure the similarity of spatial entities.Among all the possible similarity measures,the shape similarity measure is one of the most important measures because it is easy to collect the necessary parameters and it is also well matched with the human intuition.In this paper a new shape similarity measure of linear entities based on the differences of direction change along each line is presented and its effectiveness is illustrated.     

改进Moser法射线追踪

地震波场正演模拟、层析成像、偏移成像经常需要用到射线追踪,本文在基于图形理论的Ｍｏｓｅｒ法基础上,改进其网格节点的划分、追踪时路径的选取,并增加直射线追踪以消除在速度变化不大时射线受节点布置影响出现不合理的折曲现象．     

基于遗传算法的巷道位移反分析研究

将遗传算法应用到位移反分析研究中,采用遗传算法与FLAC数值软件相结合的手段,研制了弹塑性巷道位移反分析程序。对该程序测试的结果表明,用遗传算法这一模拟生物进化的方法,进行巷道位移反分析,可以同时反演E,μ,C,ф,σx,σy,τxy7个参数,反演精度较高。     

Improving the efficiency of ant algorithms using adaptive refinement: Application to storm water network design

The ant algorithm is a new evolutionary optimization method proposed for the solution of discrete combinatorial optimization problems. Many engineering optimization problems involve decision variables of continuous nature. Application of the ant algorithm to the optimization of these continuous problems requires discretization of the continuous search space, thereby reducing the underlying continuous problem to a discrete optimization problem. The level of discretization of the continuous search space, however, could present some problems. Generally, coarse discretization of the continuous design variables could adversely affect the quality of the final solution while finer discretization would enlarge the scale of the problem leading to higher computation cost and, occasionally, to low quality solutions. An adaptive refinement procedure is introduced in this paper as a remedy for the problem just outlined. The method is based on the idea of limiting the originally wide search space to a smaller one once a locally converged solution is obtained. The smaller search space is designed to contain the locally optimum solution at its center. The resulting search space is discretized and a completely new search is conducted to find a better solution. The procedure is continued until no improvement can be made by further refinement. The method is applied to a benchmark problem in storm water network design discipline and the results are compared with those of existing methods. The method is shown to be very effective and efficient regarding the optimality of the solution, and the convergence characteristics of the resulting ant algorithm. Furthermore, the method proves itself capable of finding an optimal, or near-optimal solution, independent of the discretization level and the size of the colony used.     

欧氏聚类算法支持下的点云数据分割

欧氏聚类算法是多元统计中的一种重要分类方法,可以将其应用于测绘领域中点云数据的分割。本文首先计算点云数据中两点之间的欧氏距离,将距离小于指定阈值作为分为一类的判定准则;然后迭代计算,直至所有的类间距大于指定阈值,完成欧氏聚类分割。具体步骤为：①利用Octree法建立点云数据拓扑组织结构;②对每个点进行k近邻搜索,计算该点与k个邻近点之间的欧氏距离,最小归为一类;③设置一定的阈值,对步骤②迭代计算,直至所有类与类之间的距离大于指定阈值。试验证明,欧氏聚类算法对不同测量技术手段获取的点云数据均具有适用性,可以成功对点云数据进行分割,分割效果良好。     

动态城市交通网络优化模型研究及算法设计

在城市交通网络中,行车路线所耗时间是用户关心的关键因素之一.本文构建了基于时间因素的城市交通网络模型,为反映交通网络随时间动态变化的特性,网络模型中弧的权重是和时间统计变量相关.本文设计了交通网络模型算法,并对算法进行了详细的论述.针对实际交通网络的行驶线路选择人群中乐观型、保守型和折中型,给出了路线选择的简化模型.文...     

面向LiDAR/Radar松组合的迭代加权IEKF-BP组合算法精度分析

为了验证目前高精度定位中多传感器组合定位模型性能的优越性,以更好地解决自动驾驶场景下自主定位中出现的预测精度标准不一致、预测不及时及误预测率高等问题,本文利用LiDAR与Radar数据,建立了一种基于迭代加权的IEKF-BP组合算法的松组合模型,并对两种传感器组合定位结果精度进行了分析.试验表明,迭代加权的IEKF-B...