案例支撑下的朴素贝叶斯树状河系自动分级方法

河流分级是树状水系综合的关键。现有方法大多根据河段的局部几何特征进行主支流识别,较少顾及河流和河系的整体结构特征,且使用多指标综合评价判别时对权重的设定缺乏科学的方法,对综合知识利用较少,应用的灵活性有待提高。对此,本文从案例学习的角度出发,针对河段主支流关系识别,提出一种基于朴素贝叶斯的树状河系自动分级方法。首先,从已有成果数据中提取出主支流分类的案例,利用朴素贝叶斯机器学习方法进行训练得到主支流分类模型;对于待分类树状河系,使用分类模型,从河口出发自下游向上游依次计算各上游河段分类为主流的概率,以概率最大的上游河段作为主流河段,将各主流河段依次连接得到主流河流;主流河流以外的支流部分,重复以上步骤进行层次结构化实现河系分级。试验证明,本文方法能很好地模仿专家意图,对树状河系的主支流进行很好地识别分类,并构建合理的层次结构,分级效果良好。     

顾及密度差异的河系简化

河系简化是地图综合中经常需要处理的任务,其难点主要在于依据上下文环境对河流进行结构化选取,以保持河网密度差异等宏观特征。提出一种新的河流等级规则,依据河流的各级支流的数量确定河流的等级,以反映河流的密度差异;设计一种结合河流等级、长度与所在层次的综合指标进行河流选取;探讨在自动构建河系树的基础上计算河流等级、所在层次等指标的方法;最后使用综合指标进行河流结构化选取试验。结果表明,以新等级规则为基础的综合指标切实可行,能够在一定程度上保持河网密度的区域差异。     

面向自动综合的河系结构化模型研究

针对地图上河流的自动综合,建立了基于河段的河系结构化数据模型,该模型充分考虑了河段与河段、河段与面状水系要素之间的空间关系,以及河系河段的层次关系;建立了一种面向自动综合的河系结构化数据模型,模型包含了大量水系综合所需要的信息。基于上述数据模型,设计了一种方便快捷的河系结构化算法,该算法较好地克服了现有河系结构化算法只针对河流以及只适用于形态相对简单的河系的缺陷,较为全面地考虑了河系结构中出现的各种复杂问题,具有较强的实用性。     

河网汇水区域的层次化剖分与地图综合

对于具有网络状结构的河系数据的综合化简,判断河流分支在河网中的重要性需要考虑三个层次的结构信息:全局范围内的空间分布模式;局域环境下的分布密度;单条河流的几何特征。为提取这些结构化信息,本文基于网络分析运用Delaunay三角网模型建立了各级河流分支汇水区域的层次化剖分模型,其基本思想是将汇水区域划定当作“空间竞争”问题来求解,运用类似于Voronoi图的空间等剖分几何构造表达“袭水”过程,在各支流子系统内部及其环境之间通过Delaunay三角网骨架线确定汇水区域的分水岭。基于该层次剖分模型可计算河流分布密度、相邻河流间距、汇水范围及层次关系,进而推算出河系网中每一条河流的重要性系数,实现不同尺度下河流的综合选取。     

河网线要素与DEM综合的三维Douglas-Peucker算法

目前三维Douglas-Peucker(3D_DP)算法主要应用于单一类型的DEM综合。本文引入"弯曲调节指数"来改进3D_DP算法,提出了一种三维空间河网要素与DEM综合的新方法,即将河网线矢量提取成三维离散点数据集(增加高程属性),与DEM三维离散点数据集合并,在河网层次化选取基础上,利用改进的3D_DP算法对合并数据集进行综合操作。通过试验结果的对比和分析表明,该方法通过弯曲调节指数的调节使河流自身所具有的弯曲形态与地形的主要特征得以同时保留,试验效果良好,实现了三维空间河网要素与DEM数据在同一简化因子作用下的综合,提升了地图综合的质量。     

Identification of drainage patterns using a graph convolutional neural network

Various geological factors shape drainage patterns. Identifying drainage patterns is a classic problem in topographical knowledge mining and map generalization. Existing rule-based methods rely heavily on the parameter settings of cartographers for drainage-pattern recognition. These methods effectively identify drainage patterns in specific areas but require manual parameter tuning to identify drainage patterns in other areas. Owing to the complexity of topological and geometric characteristics, drainage pattern recognition involves nonlinear problems, and it is difficult to build mapping relationships between characteristics and patterns using rule-based methods. Therefore, we proposed a data-driven method based on a graph convolutional neural network to avoid heavy reliance on human experience and automatically mine implicit relationships between characteristics and drainage patterns. First, six typical drainage patterns (dendritic, rectangular, parallel, trellis, reticulate, and fanned) were listed based on map specifications, and the unique characteristics of each drainage pattern were illustrated. Subsequently, the drainage graphs were constructed. The characteristics of the whole, local, and individual units in the drainage networks were quantified based on drainage vector data. Finally, an identification model was developed using graph convolution, self-attention pooling, and multiple fully connected layers for drainage pattern recognition. After training and testing, the accuracy of our model (0.801 ± 0.014) was better than that of the rule-based method (0.572 ± 0.000) and the traditional machine learning methods (less than 0.733 ± 0.016). The results demonstrate that the ability of our model to identify drainage patterns surpasses that of other methods.     

基于SWBD修复的SRTM DEM的1∶250000水系自动更新——以浙江省瓯江流域为例

以浙江省瓯江流域为例,基于SWBD修复的SRTM DEM数据,采用Arc Hydro Tools水文分析工具自动提取瓯江水系,并分地貌、分河流等级地定量评价水系数据精度,开展1∶250 000水系自动更新的可行性研究。结果表明：①SWBD修复的SRTM DEM的空白区域面积为54.78 km2,有效地弥补了SRTM DEM的数据缺失,进而提高了水系提取的准确度和精度;②与1∶250 000水系数据相比,基于SWBD修复后的SRTM DEM,在小起伏山、中起伏低山、低海拔丘陵上提取的水系数据精度高于其他地貌,而干流、一级支流、二级支流的精度又高于三级支流;③以资源三号卫星ZY-3遥感影像为参照,从水系上采集同名点反复比较点位精度后发现,利用SRTM DEM提取的水系符合制图规范和测绘内业规范（限差1 mm）,可以满足1∶250 000水系自动更新的要求。     

基于DEM的流域特征提取方法初步研究

以岷江上游典型流域为例,从该区的Aster影像上提取DEM,利用GIS技术从该DEM上提取流域特征,并划分出子流域,通过实地考察数据和所提取的河网矢量数据对照,表明用该方法提取研究区流域特征是可行并有效的。     

直线排列建筑物群渐进式典型化方法

地图综合中,建筑物群的排列结构是需要重点考虑的因素。当不同排列的子建筑物群之间存在空间图形冲突时,这些建筑物群的综合就显得更为复杂。直线排列建筑物群的综合在大比例尺地形图上以典型化操作为主。本文提出一种相互之间存在潜在空间图形冲突的多个直线排列建筑物子群的渐进式典型化方法,渐进式地处理多个直线排列建筑物子群之间的空间图形冲突,保留建筑物群重要的直线排列结构;以建筑物表达的视觉图形约束为限制条件,自动确定典型化后的建筑物位置、形状、大小和方位。本文还研究了基于建筑物群空间邻近图的直线排列建筑物子群的自动识别方法,分析了这些直线排列之间的邻近关系和相交关系。最后,以1：5000地图上的建筑物群综合为1：25 000为试验对象,验证了所提出算法的可用性和有效性。     

A points of interest matching method using a multivariate weighting function with gradient descent optimization

Volunteered geographic information contains abundant valuable data, which can be applied to various spatiotemporal geographical analyses. While the useful information may be distributed in different, low‐quality data sources, this issue can be solved by data integration. Generally, the primary task of integration is data matching. Unfortunately, due to the complexity and irregularities of multi‐source data, existing studies have found it difficult to efficiently establish the correspondence between different sources. Therefore, we present a multi‐stage method to match multi‐source data using points of interest. A spatial filter is constructed to obtain candidate sets for geographical entities. The weights of non‐spatial characteristics are examined by a machine learning‐related algorithm with artificially labeled random samples. A case study on Fuzhou reveals that an average of 95% of instances are accurately matched. Thus, our study provides a novel solution for researchers who are engaged in data mining and related work to accurately match multi‐source data via knowledge obtained by the idea and methods of machine learning.     

Multi‐scale approach to mining significant spatial co‐location patterns

Spatial co‐location pattern mining aims to discover a collection of Boolean spatial features, which are frequently located in close geographic proximity to each other. Existing methods for identifying spatial co‐location patterns usually require users to specify two thresholds, i.e. the prevalence threshold for measuring the prevalence of candidate co‐location patterns and distance threshold to search the spatial co‐location patterns. However, these two thresholds are difficult to determine in practice, and improper thresholds may lead to the misidentification of useful patterns and the incorrect reporting of meaningless patterns. The multi‐scale approach proposed in this study overcomes this limitation. Initially, the prevalence of candidate co‐location patterns is measured statistically by using a significance test, and a non‐parametric model is developed to construct the null distribution of features with the consideration of spatial auto‐correlation. Next, the spatial co‐location patterns are explored at multi‐scales instead of single scale (or distance threshold) discovery. The validity of the co‐location patterns is evaluated based on the concept of lifetime. Experiments on both synthetic and ecological datasets show that spatial co‐location patterns are discovered correctly and completely by using the proposed method; on the other hand, the subjectivity in discovery of spatial co‐location patterns is reduced significantly.     

Integrating domain knowledge and graph convolutional neural networks to support river network selection

Deep learning is increasingly being used to improve the intelligence of map generalization. Vector-based map generalization, utilizing deep learning, is an important avenue for research. However, there are three questions: (1) transforming vector data into a deep learning data paradigm; (2) overcoming the limitation of the number of samples; and (3) determining whether existing knowledge can accelerate deep learning. To address these questions, taking river network selection as an example, this study presents a framework integrating hydrological knowledge into graph convolutional neural networks (GCNNs). This framework consists of the following steps: constructing a dual graph of river networks (DG_RN), extracting domain knowledge as node attributes of DG_RN, developing an architecture of GCNNs for the selection, and designing a fine-tuning rule to refine the GCNN results. Experiments show that our framework outperforms existing machine learning and traditional feature sorting methods using different datasets and achieves good morphological consistency after the selection. Furthermore, these results indicate that DG_RN meets the data paradigm of graph deep learning, and the framework integrating existing characteristics (i.e., Strahler coding, the number of tributaries, the distance between proximity rivers, and upstream drainage area) mitigates the dependence of GCNNs on plenty of samples and enhance its performance.     

A GIS‐based multi‐criteria seismic vulnerability assessment using the integration of granular computing rule extraction and artificial neural networks

This study proposes multi‐criteria group decision‐making to address seismic physical vulnerability assessment. Granular computing rule extraction is combined with a feed forward artificial neural network to form a classifier capable of training a neural network on the basis of the rules provided by granular computing. It provides a transparent structure despite the traditional multi‐layer neural networks. It also allows the classifier to be applied on a set of rules for each incoming pattern. Drawbacks of original granular computing (GrC) are covered, where some input patterns remained unclassified. The study was applied to classify seismic vulnerability of the statistical units of the city of Tehran, Iran. Slope, seismic intensity, height and age of the buildings were effective parameters. Experts ranked 150 randomly selected sample statistical units with respect to their degree of seismic physical vulnerability. Inconsistency of the experts' judgments was investigated using the induced ordered weighted averaging (IOWA) operator. Fifty‐five classification rules were extracted on which a neural network was based. An overall accuracy of 88%, κ = 0.85 and R² = 0.89 was achieved. A comparison with previously implemented methodologies proved the proposed method to be the most accurate solution to the seismic physical vulnerability of Tehran.     

河流自动选取中的分级优化

水系是具有高度结构化特征的复杂空间数据,在不同水文条件和地形环境下发育的水系形态可以表现为多种模式,如格状河系、羽毛状河系、平行状河系等,使得水系选取具有较大难度。探讨了河流分级(汇流区域特征)、河网结构层次化(河流分布的地理特征)与水系选取之间的关系,提出了基于流域的河流自动选取,从河流的局部重要性出发,考虑河流的分级主要基于两点:一是确定选取单元为流域;二是对流域内河流通过等级关系选取高等级河流,同等级间河流根据长度、密度、河流间距离等综合指标进行选取。     

An enhanced approach for surface flow routing over drainage‐constrained triangulated irregular networks

The accuracy and efficiency of the simulations in distributed hydrological models must depend on the proper estimation of flow directions and paths. Numerous studies have been carried out to delineate the drainage patterns based on gridded digital elevation models (DEMs). The triangulated irregular network (TIN) has been increasingly applied in hydrological applications due to the advantages of high storage efficiency and multi‐scale adaptive performance. Much of the previous literature focuses mainly on filling the depressions on gridded DEMs rather than treating the special cases in TIN structures, which has hampered its applications to hydrological models. This study proposes a triangulation‐based solution for the removal of flat areas and pits to enhance the simulation of flow routing on triangulated facet networks. Based on the drainage‐constrained TIN generated from only a gridded DEM by the compound point extraction (CPE) method, the inconsistent situations including flat triangles, V‐shape flat edges and sink nodes are respectively identified and rectified. The optimization algorithm is an iterative process of TIN reconstruction, in which the flat areas are generalized into their center points and the pits are rectified by embedding break lines. To verify the proposed algorithm and investigate the potential for flow routing, flow paths of steepest descent are derived by the vector‐based tracking algorithm based on the optimized TIN. A case study of TIN optimization and flow path tracking was performed on a real‐world DEM. The outcomes indicate that the proposed approach can effectively solve the problem of inconsistencies without a significant loss in accuracy of the terrain model.     

A Back‐Propagation Neural Network‐Based Approach for Multi‐Represented Feature Matching in Update Propagation

Spatial data infrastructures, which are characterized by multi‐represented datasets, are prevalent throughout the world. The multi‐represented datasets contain different representations for identical real‐world entities. Therefore, update propagation is useful and required for maintaining multi‐represented datasets. The key to update propagation is the detection of identical features in different datasets that represent corresponding real‐world entities and the detection of changes in updated datasets. Using polygon features of settlements as examples, this article addresses these key problems and proposes an approach for multi‐represented feature matching based on spatial similarity and a back‐propagation neural network (BPNN). Although this approach only utilizes the measures of distance, area, direction and length, it dynamically and objectively determines the weight of each measure through intelligent learning; in contrast, traditional approaches determine weight using expertise. Therefore, the weight may be variable in different data contexts but not for different levels of expertise. This approach can be applied not only to one‐to‐one matching but also to one‐to‐many and many‐to‐many matching. Experiments are designed using two different approaches and four datasets that encompass an area in China. The goals are to demonstrate the weight differences in different data contexts and to measure the performance of the BPNN‐based feature matching approach.     

基于分形的数字水系集水面积阈值确定研究

集水面积阈值的确定是基于数字高程模型提取水系过程中的关键环节,但目前集水面积阈值的确定存在着随意性和主观性.本文引入分维数量化集水面积阈值对水系提取的影响.研究表明,在给定标度区间内集水面积阈值和分维数存在着良好的回归关系.二者的拟合方程可用来进行集水面积阈值的合理确定和水系的准确提取.     

基于分形分维和数学函数的南流江流域河网信息提取

利用南流江流域30 m分辨率的DEM数据,介绍了Arc GIS中进行河网提取的一系列过程,并利用其图解建模工具,提取南流江流域的不同汇流累积面积的水系河网,实现了提取过程的流程化处理。分别统计河源密度和沟壑密度,并分别计算它们与汇流累积面积的几何函数关系,并对其进行二阶求导,确定其二阶导数关系,得到合适的汇流累积阈值,并借助分形分维理论对河网的分维值进行了验证。利用函数关系和分形分维确定汇流累积面积提取水系河网的方法有效地避免了人工选择汇流累积面积的主观性,提高了研究结果的准确性和可靠性,在知道研究流域河网分维值的前提下,可快速获取准确的汇流累计面积阈值。     

基于GASA混合策略的BP网络在基准地价测算中的应用

结合遗传算法的并行搜索结构和模拟退火的概率突跳特性 ,提出了一种用于BP网络权值学习的GASA混合策略。以江西省赣县县城商业用地为例 ,应用基于GASA混合策略的BP网络对其基准地价进行了测算 ,并与回归模型方法作了比较。结果表明 ,混合策略能有效地避免BP算法陷入局部极小和网络单目标学习易产生的过拟合现象。将神经网络用于基准地价的测算 ,精度优于常规的回归模型方法。