Morphological analysis and recognition of scanned raster nautical chart     

Zhai Jingsheng  Li Deren 《Marine Geodesy》2013,36(4):325-339

In current practice in the development of hydrographic information systems, the automatic acquisition of spatial data has been considered to be very difficult. One of the key problems is recognition and correct separation of a feature from a complex graphic background. For these problems, this article presents a new concept of graph subsets to describe graph structures and composition rules of symbols in nautical charts. Based on this concept, morphological methods and operations in graph theory are unified into a coherent mathematical framework specially designed for analysis and recognition of binary chart images. In particular, an experimental system composed of feature extraction, symbol recognition, geometric reasoning, and intelligent control is developed for automatic digitization of nautical charts.  相似文献   

Efficient risk assessment of lifeline networks under spatially correlated ground motions using selective recursive decomposition algorithm     

Hyun-Woo Lim  Junho Song 《地震工程与结构动力学》2012,41(13):1861-1882

For effective hazard mitigation planning and prompt-but-prudent post-disaster responses, it is essential to evaluate the reliability of infrastructure networks accurately and efficiently. A nonsimulation-based algorithm, termed as a recursive decomposition algorithm (RDA), was recently proposed to identify disjoint cut sets and link sets and to compute the network reliability. This paper introduces a ‘selective’ RDA, which preferentially identifies critical disjoint cut sets and link sets to calculate the probabilities of network disconnection events with a significantly reduced number of identified sets. To this end, the original RDA is improved by replacing the shortest path algorithm with an algorithm that identifies the most reliable path, and by using a graph decomposition scheme based on the probabilities associated with the subgraphs. The critical sets identified by the algorithm are also used to compute conditional probability-based importance measures that quantify the relative importance of network components by their contributions to network disconnection events. This paper also introduces a risk assessment framework for lifeline networks based on the use of the selective RDA, which can consider both interevent and intraevent uncertainties of spatially correlated ground motions. The risk assessment framework and the selective RDA are demonstrated by a hypothetical network example, and the gas and water transmission networks of Shelby County in Tennessee, USA. The examples show that the proposed framework and the selective RDA greatly improve efficiency of risk assessment of complex lifeline networks, which are characterized by a large number of components, complex network topology, and statistical dependence between component failures. Copyright © 2012 John Wiley & Sons, Ltd.  相似文献   

基于Voronoi邻近的物流车辆路径快速优化算法     

涂伟  方志祥  李清泉  鲁仕维 《地球信息科学学报》2012,14(6):781-787

 现代物流业需要快速高效并智能化制定物流运输方案。传统路径优化方法适合处理中小规模的车辆路径问题,计算时间较长,方案质量较低,故需发展短时间内能提供高质量路径方案的启发式算法。针对大规模物流车辆路径优化,本文提出了一种Voronoi邻近的快速优化方法。该方法先创建初始解,而后进行迭代优化。初始解创建利用Voronoi邻近关系,顾及车辆容量约束,自底向上进行客户点空间聚类,将问题降维;采用最廉价插入算法安排聚类内部路径,生成性质良好的初始解。迭代优化在客户点Voronoi邻近内进行有效的局部搜索,利用模拟退火机制接受较差解,从而跳出局部最优,不断提高解的质量。本文利用模拟生成的北京市大规模车辆路径问题进行实验,结果表明:本文算法能够在4500s内优化客户点高达12 000个物流车辆路径问题,计算时间较短,解的质量优良,算法性能稳定。本文与其他算法比较,能在较短时间内提供高质量车辆路径方案,适用于大规模物流车辆路径的优化。  相似文献   

DEM流径算法的相似性分析   总被引：4，自引：0，他引：4  

刘学军  晋蓓  王彦芳 《地理研究》2008,27(6):1347-1357

流径算法是分布式水文模型、土壤侵蚀模拟等研究中的关键技术环节,决定着汇水面积、地形指数等许多重要的地形、水文参数的计算。本文以黄土高原两个典型样区的不同分辨率DEM为研究对象,对常用的五种流径算法(D8、Rho8、Dinf、MFD和DEMON)通过相对差系数、累积频率图、XY散点分布图等进行了定量的对比分析。结果表明:算法的差异主要集中在坡面区域,汇流区域各类算法的差别较小;算法差异在不同DEM尺度下都有所体现,但高分辨率下的差异会更明显;在地形复杂区域,多流向算法要优于单流向算法。研究也进一步指出汇水面积、地形指数等水文参数对流径算法具有强烈的依赖性。  相似文献   

论地理知识图谱     

陆锋  余丽  仇培元 《地球信息科学学报》2017,19(6):723-734

网络文本蕴含大量隐式地理空间信息,为地理知识获取与知识服务提供了巨大潜能。地理知识图谱是将传统地理信息服务拓展到地理知识服务的关键,也是网络文本蕴含地理信息采集与处理的终极目标。本文系统评述了开放地理语义网、开放地理实体及关系抽取、地理语义网对齐、知识图谱存储方法等地理知识图谱相关主题的研究进展,从网络文本蕴含地理空间信息量与质量评价、地理信息语义理解、空间语义计算模型和异构地理语义网对齐等方面剖析了目前亟需解决的关键科学问题。  相似文献   

Experimental evaluation of design methods for in-site detention ponds     

Yao-Ming HONG 《国际泥沙研究》2010,25(1):52-63

In this study,the detention rate of detention pond was defined to include both reduction and delay of peak flow.Flood routing experiments,with various combinations of inflow hydrographs and outlet devices in an in-site detention pond,were performed to examine the effectiveness of two analysis methods,namely the simplified method and the hydrological routing method;and to compare the detention rate of two types of outlet,namely the rectangular sharp-crested weir and the rectangular orifice.Comparison between...  相似文献   

采用AutoLISP语言开发辐射取样图件自动生成程序     

周洪生 《铀矿地质》2009,25(1):37-39

采用AutoLISP语言开发了一套辐射取样图件自动生成程序,该程序完全自主开发,能实现取样图自动生成、自动解释功能,大大提高了辐射取样图件绘制的效率,且避免了手工绘图所带来的误差。  相似文献   

神经网络理论在河道洪水预报中的应用   总被引：2，自引：1，他引：1  

王光生  苏佳林  沈必成  刘超 《水文》2009,29(5)

本文将神经网络用于松花江干流河道汇流计算和河道洪峰水位的预报.对各种转移函数的效果进行了比较,线性函数和双正切函的精度较好超过传统的马斯京根法,其中线性转移函数最好,说明对于大江大河线性转移函数最好.由上游断面洪峰水位预报下游断面洪峰水位也取得了良好的效果.  相似文献   

基于WEB三维虚拟场景的建立   总被引：4，自引：0，他引：4  

万剑华  郑红霞  丁仁伟 《测绘科学》2005,30(4):78-80

随着万维网的发展,在网上实现3维图形的显示、漫游、分析和量测成为研究的焦点内容之一。本文总结了基于WEB的三维虚拟场景的建立与编程技术———VRML与Java3D技术,对这两种技术的运行机理、实现机制作了较详细的论述,并给出了相应的实例。实例证明基于VRML和Java3D建立WEB上的三维模型可以提供给用户一个逼真的、实时的、可交互的三维虚拟场景。  相似文献   

A Voronoi neighborhood-based search heuristic for distance/capacity constrained very large vehicle routing problems     

Zhixiang Fang  Shih-Lung Shaw  Shunqing Chen  Bi Yu Chen 《International journal of geographical information science》2013,27(4):741-764

Local search heuristics for very large-scale vehicle routing problems (VRPs) have made remarkable advances in recent years. However, few local search heuristics have focused on the use of the spatial neighborhood in Voronoi diagrams to improve local searches. Based on the concept of a k-ring shaped Voronoi neighbor, we propose a Voronoi spatial neighborhood-based search heuristic and algorithm to solve very large-scale VRPs. In this algorithm, k-ring Voronoi neighbors of a customer are limited to building and updating local routings, and rearranging local routings with improper links. This algorithm was evaluated using four sets of benchmark tests for 200–8683 customers. Solutions were compared with specific examples in the literature, such as the one-depot VRP. This algorithm produced better solutions than some of the best-known benchmark VRP solutions and requires less computational time. The algorithm outperformed previous methods used to solve very large-scale, real-world distance constrained capacitated VRP.  相似文献