BPSA混合策略在GPS高程拟合中的应用

针对误差反向传播(BP)算法训练速度慢和易于陷入局部最小值的缺点,利用BP算法监督学习特点,模拟退火算法(SA)在局部极小处的概率突变性,有效结合BP和SA算法,提出一种BPSA混合学习策略。将其应用于GPS高程拟合,并以实例验证了该算法的有效性。     

一种拓扑保持的折线简化算法研究

通过分析Douglas-Peucker折线简化算法之不足,提出了一种基于二叉树数据结构的折线简化算法,解决了传统算法的自相交问题。对于GIS数据简化压缩及制图综合具有很高的实用价值。     

矢量电子地图的线目标在线简化

为了适应实时GIS的变比例尺显示与网络GIS的快速矢量数据传输,提出了数字地图的在线综合概念,讨论了对线目标的在线简化算法。提出的两个在线简化算法都是对DP简化算法进行改造,使算法对时间的复杂度从θ(n)~θ(n²)的乘法运算改进为θ(1)~θ(n)的赋值运算,并讨论了减少算法所涉及的空间复杂度的可能性。     

基于蚁群算法的道路选取模型研究

在制图综合中,道路选取是非常重要的内容之一,研究道路选取的智能化方法是非常必要的。文中在研究道路语义、几何特征、拓扑关系和结构特征的基础上,充分考虑居民点对道路选取过程的影响,建立道路选取的蚁群算法模型。通过实验证明该模型算法的可行性和有效性。     

基于CLEAN算法的GPS监测数据处理方法

对建筑物进行高精度的变形监测是后期信息提取,预防安全隐患的基础。针对GPS变形监测中存在的多径误差问题,本文提出一种基于CLEAN算法的GPS多径提取方法,首先对多径信号理论模型进行分析,结果表明多径信号可以作为直达信号的谐波分量,在此基础上利用CLEAN算法在频域对多径信号进行提取,基于仿真和实测数据的实验结果表明,所提方法相对于小波方法和经验模态分解(Empirical Mode Decomposition,EMD)方法具有更高的提取精度和更好的多径抑制性能。     

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.     

改进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个邻近点之间的欧氏距离,最小归为一类;③设置一定的阈值,对步骤②迭代计算,直至所有类与类之间的距离大于指定阈值。试验证明,欧氏聚类算法对不同测量技术手段获取的点云数据均具有适用性,可以成功对点云数据进行分割,分割效果良好。