A stroke-based method for automated generation of schematic network maps

This article deals with the graphic simplification of a network by schematization. A new method employing a stroke-based and progressive strategy is proposed to generate schematic network maps. This method treats a stroke (which is a long line with segments concatenated together) as a basic unit for the implementation. The procedure is as follows: (a) strokes are formed from line segments, (b) the strokes are re-orientated along grid lines and/or diagonals, and (c) two endpoints and all intersection points on (sub-)strokes are projected onto re-oriented straight lines, and (d) spatial inconsistency is detected and resolved. A methodology for each of these steps is described. This new method has been tested with a set of real-life road network data and evaluated by fractal analysis and empirical study. Experimental results show that this new method is more effective than segment-based methods and is able to produce graphics with great simplicity and clarity. Based on the results obtained, the stroke-based schematization with four primary directions is recommended.     

Comparison of thematic maps using symbolic entropy

Comparison of thematic maps is an important task in a number of disciplines. Map comparison has traditionally been conducted using cell-by-cell agreement indicators. More recently, other methods have been proposed that take into account not only spatially coincident cells in two maps, but also their surroundings or the spatial structure of their differences. The objective of this article is to propose a framework for map comparison that considers (1) the patterns of spatial association in two maps, in other words, the map elements in their surroundings; (2) the equivalence of those patterns; and (3) the independence of patterns between maps. Two new statistics for the spatial analysis of qualitative data are introduced that are based on the symbolic entropy of the maps. As well, all inferential elements to conduct hypothesis testing are developed. The framework is illustrated using real and simulated maps.     

锡林浩特－阿巴嘎火山群内的玛珥式火山

Tephra fallout is an important type of hazard caused by explosive volcanic eruption,and numerical simulation has become a fast and effective approach to assess the dispersion and deposition of tephra fallout.According to the improved 2D diffusion model of Suzuki( 1983),we edited a tephra diffusion program that can run in the Windows system.Based on previous data,we simulated the diffusion scope of the Jinlongdingzi volcanic eruption,which is the latest eruption in the Longgang volcanic cluster.The simulated results are in good agreement with the results from measurement in situ,indicating that the model is reliable and the parameters used in the model are suitable.By using wind profiles of ten years,7,021 simulations under different wind profiles were carried out,and then probabilistic hazard maps of tephra fallout were constructed for tephra thickness thresholds,1cm and 0.5cm.This study can provide an important scientific basis for volcanic hazard analysis,risk mitigation plans and countermeasures in the Longgang volcanic area.     

Integrating general principles into mixed-integer programming to optimize schematic network maps

ABSTRACT

Schematic maps are popular for the representation of transport networks. Many automated methods have been developed to generate such maps. In these methods, optimization techniques work with various sets of constraints. Most of these constraints govern geometric properties of individual features. A few constraints address relationships among features, but none explicitly deal with the main structure of an entire network. We believe that preservation of main structure is the most important and preservation of relative relations is helpful. This is because human perception follows a global-to-local process. These constraints have recently been formed into four general principles, with two for global structure and two for relativity of features. This study develops an automated method by integrating these principles into the mixed-integer programming (MIP) framework. Experimental evaluations have been conducted with two sets of real-world transit networks. In comparison to the existing method, the proposed method has smaller fractal dimensions, better computational performance and higher scores in terms of clarity, recognition of major lines, visual simplicity and satisfaction. Therefore, it is concluded that the proposed method can generate schematic maps with improved clarity and aesthetics. The idea in this study is also helpful for the design of other visual representations.     

Automatic alignment of contemporary vector data and georeferenced historical maps using reinforcement learning

ABSTRACT

With large amounts of digital map archives becoming available, automatically extracting information from scanned historical maps is needed for many domains that require long-term historical geographic data. Convolutional Neural Networks (CNN) are powerful techniques that can be used for extracting locations of geographic features from scanned maps if sufficient representative training data are available. Existing spatial data can provide the approximate locations of corresponding geographic features in historical maps and thus be useful to annotate training data automatically. However, the feature representations, publication date, production scales, and spatial reference systems of contemporary vector data are typically very different from those of historical maps. Hence, such auxiliary data cannot be directly used for annotation of the precise locations of the features of interest in the scanned historical maps. This research introduces an automatic vector-to-raster alignment algorithm based on reinforcement learning to annotate precise locations of geographic features on scanned maps. This paper models the alignment problem using the reinforcement learning framework, which enables informed, efficient searches for matching features without pre-processing steps, such as extracting specific feature signatures (e.g. road intersections). The experimental results show that our algorithm can be applied to various features (roads, water lines, and railroads) and achieve high accuracy.     

空三加密在数字摄影测量中的精度分析

该文结合章丘市1∶2000地形图绘制项目的具体实践,认为航空摄影测量产品误差来源主要为空三加密这一重要工序,影响空三加密精度的因素主要为:影像质量(分辨率、清晰度、重叠度)、像控点选取及精度、加密点的选取及加密解算方法、加密人员的经验等。找出影响空三加密精度的主要因素及解决办法,结合生产实践解决了1∶2000地形图绘制空三加密精度问题。     

基于MicroStation V8的地形图更新与质检系统的开发

在MicroStation VBA环境下,对MicroStation V8进行二次开发,实现了一套基于MicroStation V8平台的多比例尺地形图要素更新与质检系统。该文着重阐述了该系统在处理点、线、面、注记、属性、出图效果及质量检查控制等方面的设计。通过二次开发,快速实现了地形图的更新与维护,并有利于质量的控制,符合入库要求。     

专题地图数据库建设研究——以安徽省专题数据库为例

该文以建设安徽省专题地图数据库为基础,探讨了专题地图数据的建设方法,阐述了系统的总体设计、数据库的分层设计、功能设计和系统的框架设计。