对自组织映射聚类实现道路网网格模式识别

提出了一种基于对自组织映射聚类的道路网网格模式识别方法。以道路网中的网眼为基本单元,从网眼自身形状特征、相邻网眼的形状特征以及与周围网眼的关系等方面定义了5个参量。将由5个参量描述的网眼及由CRITIC方法导出的参量权重作为自组织映射的输入,经过训练,运用K-means方法对神经元码书向量进行聚类。对深圳市道路网数据进行了实验和对比分析,结果表明该方法能有效识别网格模式。     

运用主成分分析识别道路网中的网格模式

提出了基于主成分分析的网格模式识别方法。首先利用形状参量和关系参量描述道路网中的网眼;然后生成网眼数据的主成分;最后,根据主成分分析构造参量权重的思想,导出网眼属于网格模式隶属度,根据该参数识别网格模式。实验结果表明,识别结果与肉眼识别类似。     

网眼矩形特性在道路网模式识别中的运用

从格网模式道路网的基本形态特征出发,研究了基于网眼矩形特性的道路格网模式识别方法。首先从样本道路网中任意选取部分典型的格网模式的道路网,统计该区域所有道路网眼单元的矩形度,求得样本区域道路网眼矩形度的平均值和标准差范围。再另外选取其他样本区域作为检验数据,分别用K均值聚类和系统聚类的方法进行识别实验。实验结果表明,该方法具有较高的识别正确率,为格网模式道路网识别和综合奠定了基础。     

使用自组织映射网络识别城市道路主要结构

城市道路中主要结构的识别在路网综合、多尺度路网建模、导航等方面起着关键作用。本文提出一种使用自组织映射(SOM:the Self-Organizing Map)网络来同时识别城市道路中多行道和立交桥的方法。首先计算道路网眼的几何形态特征指标,然后利用SOM对道路网眼进行分类,根据得出的网眼和道路的空间关系来提取路网中的主要结构。实验结果表明,该方法能有效地识别出城市道路中的多行道和立交桥。     

基于关联规则分类的道路网网格模式识别

提出了一种基于关联规则分类算法进行道路网网格模式识别的方法。首先基于空间认知理论,从人类视觉认知Gestalt原理出发,采用几何与拓扑关系特征量化计算网眼形状参量,从网眼自身形状指标、相邻网眼排列一致性、相邻网眼形状相似性3方面描述网眼模式。然后利用关联规则分类算法对道路网网格描述特征进行识别分类。实验表明,本文方法有效可行,具有一定的鲁棒性。     

基于C4.5算法的道路网网格模式识别

道路网模式的识别对于地图综合、数据匹配和空间分析具有重要意义。网格模式是道路网中的典型模式之一。本文提出一种基于C4.5算法的网格模式识别方法。该方法以道路网中的网眼多边形为基本单元,根据上下文关系将其标识为属于网格模式和不属于网格模式两类。首先采用形状参量和关系参量描述网眼多边形,然后,基于决策树C4.5算法分别对5维参量和3维参量构造分类器,运用10折交叉验证获得具有说服力的结果,其Kappa值分别为0.63和0.66,正确率分别为81.7％和82.9％,置信度90％的置信区间分别为[0.785, 0.846]和[0.797, 0.857]。在新数据上进行了识别效果的验证,结果表明该分类器可用于网格模式的识别。研究试图将传统模式识别和数据挖掘的理论方法应用于空间问题的解答中。     

城市道路网面域层次结构特征的识别与表达

层次性是道路网一个重要的空间结构特征,文中提出一种城市道路网面域层次结构特征的识别与表达方法。首先以路链为基本单元对道路网数据进行重新组织,选取连通度、接近度、中介度和长度对路链的结构特征重要性进行评价;然后以道路网眼作为表达道路网面域层次结构特征的基本单元,依据路链的属性等级、结构特征重要性以及视觉对称性原则,依次选取路链对道路网最大包络区域进行层次剖分从而获得其包含的各级层次道路网眼;最后利用二叉树模型对道路网眼之间的层次关系和邻接关系进行结构化表达。实验结果表明,所提方法能够完整提取出道路网包含的全部道路网眼并准确建立它们之间的空间关系,其结果能较好地反映道路网面域的层次结构特征。     

顾及形态特征和语义信息的双线道路识别方法

双线道路识别与提取是城市路网综合的关键。提出了一种城市双线道路提取的方法。在构建好的道路网眼的基础上,综合考虑双线道路网眼形态特征以及构成网眼路段之间的语义相似度,设计了识别双线道路网眼的综合指标。通过判断网眼综合指标确定最终的双线道路网眼,最后根据识别出的双线道路网眼提取出双线道路。实验表明,该方法能有效提取出城市道路数据中的双线道路。     

两种道路网格网模式识别方法比较研究

基于“数据密集型范式”的研究思路,设计了两种格网模式道路识别方法。一种是基于统计实验区域的道路相交角的方法,另外一种是基于统计实验区域道路网眼格网单元矩形度的方法。经过实验验证,两种方法效果均较好,且易于运用于工程实践。     

结合多级阈值与SOM的土地利用规划碎图斑识别

针对土地利用规划地图数据更新过程中因地块调入调出产生的碎图斑的识别问题,该文在深入分析样本数据特征的基础上提出一种结合多级阈值与 自组织特征映射(SOM)神经网络的碎图斑识别方法.首先通过面积和最大内角阈值排除不符合碎图斑特征的多边形;再将矩形度、圆形度、最小内角以及延展度作为特征向量输入训练好的SOM聚类模型,基于多边形特征相似性识别碎图斑,较好地弥补了 目前制图实践中大量采用的统一面积阈值法指标选取单一、主观性强的不足,实现了碎图斑的准确识别.以福州市长乐区和福清市土地利用规划调整建设用地管制区数据为样本的验证实验表明,该文方法的识别精度与稳定性(针对不同区域数据的适应性)均优于目前制图实践中大量采用的统一面积阈值法.     

Grid pattern recognition in road networks using the C4.5 algorithm

Pattern recognition in road networks can be used for different applications, including spatiotemporal data mining, automated map generalization, data matching of different levels of detail, and other important research topics. Grid patterns are a common pattern type. This paper proposes and implements a method for grid pattern recognition based on the idea of mesh classification through a supervised learning process. To train the classifier, training datasets are selected from worldwide city samples with different cultural, historical, and geographical environments. Meshes are subsequently labeled as composing or noncomposing grids by participants in an experiment, and the mesh measures are defined while accounting for the mesh’s individual characteristics and spatial context. The classifier is generated using the C4.5 algorithm. The accuracy of the classifier is evaluated using Kappa statistics and the overall rate of correctness. The average Kappa value is approximately 0.74, which corresponds to a total accuracy of 87.5%. Additionally, the rationality of the classifier is evaluated in an interpretation step. Two other existing grid pattern recognition methods were also tested on the datasets, and comparison results indicate that our approach is effective in identifying grid patterns in road networks.     

Selection of Streets from a Network Using Self-Organizing Maps

We propose a novel approach to selection of important streets from a network, based on the technique of a self‐organizing map (SOM), an artificial neural network algorithm for data clustering and visualization. Using the SOM training process, the approach derives a set of neurons by considering multiple attributes including topological, geometric and semantic properties of streets. The set of neurons constitutes a SOM, with which each neuron corresponds to a set of streets with similar properties. Our approach creates an exploratory linkage between the SOM and a street network, thus providing a visual tool to cluster streets interactively. The approach is validated with a case study applied to the street network in Munich, Germany.     

城市建筑群网格模式的图论识别方法

建筑群空间分布模式体现了城市的物质形式及其与社会经济功能之间的关系,反应了城市的空间结构特征,对于制图综合和多尺度表达等具有重要意义。结合国内外对该问题的研究,提出了基于图论的建筑群网格模式识别方法。首先分析研究了网格模式的认知特征和定义。然后利用Delaunay三角网构建建筑群的邻近关系,生成邻近图;从Gestalt视觉准则出发,基于三角剖分模型建立视觉距离;考虑直线模式的直线性、紧凑性等约束条件识别出交叉的多连通直线模式。最后对直线模式建立相交图和方向关系图,通过求解极大完全子图、连接、相交和后期修建等图运算,实现网格模式的识别。实验表明该方法能够识别出明显网格模式,其识别结果符合人类空间认知特点。     

网络空间向量剖分法识别城市路网网格模式

将道路网络空间视为嵌在2D空间中的独立子空间,利用形态单一的线性单元剖分图结构的边,实现网络空间的栅格化;提取网格模式的典型特征,包括几何和拓扑特征,以栅格单元邻域为目标计算特征值,构建特征向量描述栅格单元,实现对象空间到特征空间的映射,构建空间向量场;基于支持向量机（support vector machine,SVM）实现网格模式分类;结合格式塔原则完善实验结果。将此方法应用于深圳市路网数据,实验结果表明能有效地识别网格模式。     

一种实现依比例街区自动合并的算法

针对依比例街区的图形特征，介绍了一种实现街区自动合并的有效算法，即利用数学形态学和模式识别对栅格数据进行追踪，然后提取街区轮廓线，编辑后就得到最终合并的街区。     

运用图论进行道路网网格模式提取

提出了一种基于图论的网格模式提取方法。该方法根据道路之间的关系生成关系图,运用交、联、提取连通分量和极大完全子图等图论算子完成模式的提取。实验结果表明,该方法能有效地进行网格模式的提取。     

一种建筑群同质二元组直线模式的识别方法

建筑群空间分布模式识别对制图综合、多尺度表达及空间数据挖掘具有重要意义.针对建筑群中以建筑物组合结构为单元的直线模式识别问题,提出一种建筑群同质二元组直线模式的识别方法.首先分析研究同质二元组直线模式的认知特征和定义;然后利用Delaunay三角网构建建筑群邻近关系,以建筑物邻近性、尺寸和方向相似性约束进行聚类,考虑邻...     

Comparative Study of Approaches to Delineating Built‐Up Areas Using Road Network Data

Delineated built‐up areas may be used for applications such as navigation, database enrichment and the identification of urban sprawl. As more road network data have become available, many studies have considered using road network data to delineate built‐up areas. This study investigated the three existing approaches to delineating built‐up areas on a map: the grid‐based approach, kernel density analysis and an approach based on street blocks. These approaches are evaluated and compared from three angles. First, two measures were proposed to quantitatively evaluate the land area of the delineated built‐up areas; second, a questionnaire was designed to visually compare the representations of the delineated built‐up areas; and, third, the time complexity of using each approach was tested. The three approaches were applied to different sets of road network data for New Zealand; data from buildings and residential areas were used as benchmarks. The results showed that: (1) in a quantitative assessment, both the grid‐based approach and kernel density analysis can usually detect more built‐up areas than the approach based on street blocks; (2) on visual inspection, most of the students who completed the questionnaire performed the representations using the approach based on street blocks; and (3) in time complexity, the approach based on street blocks always takes the least time.     

Model generalization of two different drainage patterns by self-organizing maps

In this study, we develop a new method using self-organizing maps (SOMs) for the selection of hydrographic model generalization. The most suitable attributes of the stream objects are used as input variables to the SOM. The attributes were weighted using Pearson’s chi-square independence test. We used the Radical Law to determine how many features should be selected, and an incremental approach was developed to determine which clusters should be selected from the SOM. Two drainage patterns (dendritic and modified basic) were obtained from the National Hydrography Datasets of United States Geological Survey at 1:24,000-scale (high resolution) and used in order to derive stream networks at 1:100,000-scale (medium resolution). The 1:100,000-scale stream networks, derived in accordance with the proposed approach, are similar to those in the original maps in both quantity and visual aspects. Stream density and pattern were maintained in each subunit, and continuous and semantically correct networks were obtained.