The SANET Toolbox: New Methods for Network Spatial Analysis

This paper describes new methods, called network spatial methods, for analyzing spatial phenomena that occur on a network or alongside a network (referred to as network spatial phenomena). First, the paper reviews network spatial phenomena discussed in the related literature. Second, the paper shows the uniform network transformation, which is used in the study of non‐uniform distributions on a network, such as the densities of traffic and population. Third, the paper outlines a class of network spatial methods, including nearest neighbor distance methods, K‐function methods, cell count methods, clumping methods, the Voronoi diagrams and spatial interpolation methods. Fourth, the paper shows three commonly used computational methods to facilitate network spatial analysis. Fifth, the paper describes the functions of a GIS‐based software package, called SANET, that perform network spatial methods. Sixth, the paper compares network spatial methods with the corresponding planar spatial methods by applying both methods to the same data set. This comparison clearly demonstrates how different conclusions can result. The conclusion summarizes the major findings.     

Network Density Estimation: A GIS Approach for Analysing Point Patterns in a Network Space

Human activities and more generally the phenomena related to human behaviour take place in a network‐constrained subset of the geographical space. These phenomena can be expressed as locations having their positions configured by a road network, as address points with street numbers. Although these events are considered as points on a network, point pattern analysis and the techniques implemented in a GIS environment generally consider events as taking place in a uniform space, with distance expressed as Euclidean and over a homogeneous and isotropic space. Network‐spatial analysis has developed as a research agenda where the attention is drawn towards point pattern analytical techniques applied to a space constrained by a road network. Little attention has been put on first order properties of a point pattern (i.e. density) in a network space, while mainly second order analysis such as nearest neighbour and K‐functions have been implemented for network configurations of the geographical space. In this article, a method for examining clusters of human‐related events on a network, called Network Density Estimation (NDE), is implemented using spatial statistical tools and GIS packages. The method is presented and compared to conventional first order spatial analytical techniques such as Kernel Density Estimation (KDE). Network Density Estimation is tested using the locations of a sample of central, urban activities associated with bank and insurance company branches in the central areas of two midsize European cities, Trieste (Italy) and Swindon (UK).     

The network K‐function in context: examining the effects of network structure on the network K‐function

The flaws of using traditional planar point‐pattern analysis techniques with network constrained points have been thoroughly explored in the literature. Because of this, new network‐based measures have been introduced for their planar analogues, including the network based K‐function. These new measures involve the calculation of network distances between point events rather than traditional Euclidean distances. Some have suggested that the underlying structure of a network, such as whether it includes directional constraints or speed limits, may be considered when applying these methods. How different network structures might affect the results of the network spatial statistics is not well understood. This article examines the results of network K‐functions when taking into consideration network distances for three different types of networks: the original road network, topologically correct networks, and directionally constrained networks. For this aim, four scenarios using road networks from Tampa, Florida and New York City, New York were used to test how network constraints affected the network K‐function. Depending on which network is under consideration, the underlying network structure could impact the interpretation. In particular, directional constraints showed reduced clustering across the different scenarios. Caution should be used when selecting the road network, and constraints, for a network K‐function analysis.     

结合地理国情普查和监测数据的交通网络发展空间格局监测研究

交通通达指数是表征一个区域交通网络空间格局的重要指标。本研究立足于地理国情普查和监测中交通要素等相关数据成果,开展了基于交通网络密度和交通便捷度交通的通达指数测算相关研究,引入了一套核密度分析、欧氏距离分析、吸引力分析等交通通达指数计算方法,并以杭州市为试验区,开展交通网络空间格局监测。     

网络空间中线要素的核密度估计方法

核密度估计(KDE)方法是分析点要素或线要素空间分布模式的一种重要方法,但目前线要素核密度方法只能分析线要素在二维均质平面空间的密度分布,不能正确分析交通拥堵、交叉口排队、出租车载客等线事件在一维非均质道路网络空间中的密度分布。本文提出了一种网络空间中线要素的核密度估计方法(网络线要素KDE方法),首先确定每个线要素在网络空间上的密度分布,然后根据网络空间距离和拓扑关系确定网络空间的线要素核密度与时空分布。以出租车GPS轨迹数据中提取的"上客"线事件为例,分析出租车"上客"线事件在网络空间中的密度分布,通过与现有方法比较的试验结果表明,本文提出的方法更能准确反映路网空间中线事件的分布特征。     

一种顾及道路复杂度的增量路网构建方法

针对传统路网采集和更新需要昂贵的实地测量以及大量的后续内业处理问题,提出了一种从大规模粗糙轨迹数据中自动生成路网的方法。该方法包含轨迹滤选和路网增量构建两步:第1步通过构建空间、时间、逻辑约束的规则模型,在消除数据中的噪音和冗余的同时,将原始轨迹进行合理分割,滤选形成规范轨迹集合;第2步基于信息熵计算轨迹点周围道路的复杂度,据此自动调节道路分割参数,不断将新产生的路段加入到路网,同时计算道路平均交通流量和速度等路况信息,遍历各规范轨迹的定位点重复以上处理过程,最终得到完整路网。通过昆明市200辆出租车采集的约6851万条轨迹数据进行路网构建试验,并与OpenStreetMap数据比较,证明了本文方法的有效性。与已有典型方法比较,本文方法能用更少节点提取更高质量的路网。     

城市交通网络分形维数的不确定性估计、控制与分析

长度-半径维数模型作为描述城市交通网络复杂不确定性现象的一种分形分维方法,其自身存在的不确定性往往被忽视,且相关研究更是鲜见报道。故针对该模型在分形维数测算全过程中存在的不确定性问题,本文率先开展了系统剖析、定量估计和质量控制研究。首先对数据源、矢量化处理、测算中心、尺度选择、以及分维数模型估计等一系列环节进行了不确定性估计与分析,其中首次给出了分形维数在一定置信水平下的不确定性度量区间,并依据误差传播理论对误差的传递和累积进行了描述;然后着重提出了基于LMed S(Least Median of Squares)的质量控制方法。最后通过对拉萨市的算例实验表明:道路的矢量化过程、测算中心和测算尺度的选择都会导致分维的不确定性;并在对数据质量进行控制的基础上,通过置信区间对长度-半径维数模型的不确定性进行了在一定概率水平下的首次度量;同时结合区域现状对研究结果给出了合乎实际的解释。本文在描述表征不确定性问题的分形几何和分形维数的基础上,系统地揭示了其自身不确定性的本质,不仅进一步丰富了分形分维理论,为控制其质量奠定理论基础,而且可为城市交通网络分形维数的地学应用提供可靠的科学依据。     

A reliable traffic prediction approach for bike‐sharing system by exploiting rich information with temporal link prediction strategy

Bike‐sharing systems have been widely used in major cities across the world. As bike borrowing and return at different stations in different periods are not balanced, the bikes in a bike‐sharing system need to be redistributed frequently to rebalance the system. Therefore, traffic flow forecasting of the bike‐sharing system is an important issue, as this is conducive to achieving rebalancing of the bike system. In this article, we present a new traffic flow prediction approach based on the temporal links in dynamic traffic flow networks. A station clustering algorithm is first introduced to cluster stations into groups. A temporal link prediction method based on the dynamic traffic flow network method (STW+M) is then proposed to predict the traffic flow between stations. In our method, the non‐negative tensor decomposition and time‐series analysis model capture the rich information (temporal variabilities, spatial characteristics, and weather information) of the across‐clusters transition. Then, a temporal link prediction strategy is used to forecast potential links and weights in the traffic flow network by investigating both the network structure and the results of tensor computations. In order to assess the methods proposed in this article, we have used the data of bike‐sharing systems in New York and Washington, DC to conduct bike traffic prediction and the experimental results have shown that our method produces the lowest root mean square error (RMSE) and mean square error (MSE). Compared to four prediction methods from the literature, our RMSE and MSE of the two datasets have been lowered by an average of 2.55 (Washington, DC) and 2.41 (New York) and 3.35 (Washington, DC) and 2.96 (New York), respectively. The results show that the proposed approach improves predictions of traffic flow.     

顾及交通时态属性的最优路径算法与实现

GIS软件中最优路径分析多不考虑交通时态属性信息，而是将交通网抽象为理想化的、纯数学上的点一线网络“图”结构，导致结果与实际不符，实用性较差。文中结合交通时态属性信息，探讨一种实用的快速计算最优路径的模式和方法。     

A novel framework for detecting non-recurrent road traffic anomalies by combining a temporal graph convolutional network and hierarchical time memory detector

A non-recurrent road traffic anomaly refers to a sudden change in the capacity of a road segment, which deviates from the general traffic patterns, and is usually caused by abnormal traffic events such as traffic accidents and unexpected road maintenance. Timely and accurate detection of non-recurrent road traffic anomalies facilitates immediate handling to reduce the wastage of resources and the risk of secondary accidents. Compared with other types of traffic anomaly detection methods, prediction algorithms are suitable for detecting non-recurrent anomalies for their potential ability to distinguish non-recurrent anomalies from recurrent congestion (e.g., rush hours). A typical prediction algorithm detects an anomaly when the difference between the predicted traffic parameter (i.e., speed) and the actual one is greater than a threshold. However, the subjective setting of thresholds in many prediction algorithms greatly affects the detection performance. This study proposes a novel framework for non-recurrent road traffic anomaly detection (NRRTAD). The temporal graph convolutional network (T-GCN) model acts as the predictor to learn the general traffic patterns of road segments by capturing both the topological effects and temporal patterns of traffic flows, and to predict the “normal” traffic speeds. The hierarchical time memory detector (HTM-detector) algorithm acts as the detector to evaluate the differences between the predicted speeds and the actual speeds to detect non-recurrent anomalies without setting a threshold. In the experiments with traffic datasets of Beijing, NRRTAD outperformed other methods, not only achieving the highest detection rates but also exhibiting higher resilience to noise. The main advantages of NRRTAD are as follows: (1) adopting the T-GCN with a weighted graph to integrate differentiated connection strengths of multiple types of topological relations between road segments as well as temporal traffic patterns improves the prediction performance; and (2) utilizing a flexible mechanism in the HTM-detector to adapt to changing stream data not only avoids subjective setting of a threshold, but also improves the accuracy and robustness of anomaly detection.     

基于特征的城市交通网络非平面数据库的实现

针对基于特征的GIS及交换网络分析对数据结构的要求，着重讨论了如何建立基于交通网络特征的非平面拓扑，以改进地理分层－关系表设计方法及平面图弧段－节点数据结构在交通网络描述中的不足之处，并通过面向对象的方法、动态分段技术和关系表指针操作，结合实例描述了基于完整交通特征的非平面数据库的实现方法。     

Robust estimation of geodetic datum transformation

The robust estimation of geodetic datum transformation is discussed. The basic principle of robust estimation is introduced. The error influence functions of the robust estimators, together with those of least-squares estimators, are given. Particular attention is given to the robust initial estimates of the transformation parameters, which should have a high breakdown point in order to provide reliable residuals for the following estimation. The median method is applied to solve for robust initial estimates of transformation parameters since it has the highest breakdown point. A smooth weight function is then used to improve the efficiency of the parameter estimates in successive iterative computations. A numerical example is given on a datum transformation between a global positioning system network and the corresponding geodetic network in China. The results show that when the coordinates are contaminated by outliers, the proposed method can still give reasonable results. Received: 25 September 1997 / Accepted: 1 March 1999     

利用时空密度聚类的高速公路交通事故黑点路段鉴别

研究高速公路交通事故黑点路段的时空分布规律和关联因素,一直是交通领域的关注重点。本文针对事故统计的交通事故黑点路段鉴别方法存在地理学中的可塑面积单元(MAUP)问题,提出一种基于时空密度聚类的高速公路交通事故黑点路段鉴别方法。该方法改进了传统的DBSCAN空间聚类算法,引入一种顾及时间周期性和事故严重程度的事故时空邻近计算方法,通过密度连接规则自适应鉴别各种时空尺度的交通事故黑点路段。以2012—2016年湖南省的高速公路交通事故为例进行试验,结果表明,本文方法可有效克服不同划分单元的可塑面积单元问题,自适应鉴别不同长度的黑点路段,同时可进一步挖掘黑点路段上交通事故时空聚集模式。     

顾及Gestalt邻近与简化原则的平面点集形状重建

针对经典Delaunay三角网平面点集形状重构方法存在的经验参数确定和容易出现不符合实际情况的碎洞问题,提出了一种顾及Gestalt邻近与简化原则的Delaunay三角网平面点集形状重构的算法SRGT。首先根据邻近性原则,采用双极差粗差探测技术来识别和定位Delaunay三角网中的极长边,逐步细化三角网中的内外边界;然后基于简化性原则,将形状重构的碎洞优化转化为粗差探测问题,并利用3σ粗差探测原则来实现碎洞的剔除。采用模拟与真实数据验证了本文算法的有效性。与4种经典算法（α-shape、χ-shape、边长比约束法以及∂RGG）进行对照试验,表明本文算法的优越性。模拟数据表明SRGT在面状点集为均匀或随机分布时,无须设置先验参数即可有效提取复杂形状的内外边界,并且L²误差范数值明显低于其余4种方法。真实案例的试验结果也表明本文算法在工程实践中具有良好应用效果。     

城市轨道站点拓扑网络通达性建模及分析

通过研究交通网络的空间连接及由此决定的节点间联系的连通程度,可观测交通可达性水平。本文对地下轨道交通和地面道路交通构成的立体拓扑网络进行了建模,采用空间句法形态分析变量构建了基于轨道站点的通达性模型,分析了深圳市轨道站点通达性水平和空间特征,并探讨了站点通达性与周边土地利用的相互关系。研究结果表明,深圳市轨道站点通达性平均值为0.088 4,通达性数值离散程度较低,在空间上形成了福田中心区、华强北商业区、东门商业区和后海片区4个高值热点区;商业用地、办公用地与站点通达性的相关程度最大,工业仓储用地受轨道站点的影响较小,轨道站点倾向于商业及办公用地等人流量集中的空间节点;轨道站点基本可承载周边的土地开发,组合类型为"高-中""中-低"的27个站点需提升综合立体交通体系功能。笔者从拓扑网络耦合的思路,客观评价了深圳市轨道站点通达性及其与土地利用的相互关系,提供了研究对象由线路向站点转换的研究视角,可为同类研究提供参考意义。     

GIS中矢量与栅格数据相互转换方法研究

本文是关于地理信息系统中数据转换方法的实验研究。作者在分析了数据转换各种方法的优缺点后,在矢量结构向栅格结构特换中,采用了高效的通界代数法思想;在栅格结构特矢量结构中,采纳了新颖的具拓扑关系的转换方法．改进了其搜索迤界、判断结点和起始点查找等栅格数据转矢量数据过程中的难点技术。算法可靠性好且占用内存较小。     

应用网络规划进行InSAR相位解缠的路径跟踪算法

介绍InSAR相位解缠算法中Goldstein枝切法和基于质量指导的Mask－cut等路径跟踪法的基本原理,分析它们的特点;详细阐述基于网络规划的规则格网和不规则格网的最小费用流相位解缠算法的基本原理,说明网络规划算法在效率和精度上确实优于其他路径跟踪算法,是一种极具潜力的相位解缠方法。     

量子粒子群BP神经网络在GNSS高程转换中的应用分析

提出了一种基于量子粒子群神经网络(QPSO-BP)模型的GNSS高程转换方法,通过建立GNSS点平面坐标与正常高之间的三层QPSO-BP数学模型而实现GNSS高程转换。试验分析结果表明,该方法全局迭代进化搜索能力高、稳健性强、拟合及预测精度高,在GNSS高程转换方面具有良好的有效性与先进性。     

网络空间同位模式的加色混合可视化挖掘方法

同位模式挖掘是空间数据挖掘的热点问题之一,应用领域广泛。已有的同位模式挖掘方法一般采用统计或数据挖掘的方式,要求对复杂的数学公式、算法及相关参数等有深刻的理解,主要针对同质的欧式空间中地理现象。而城市空间中人为地理现象大多发生在网络空间,鉴于此,本文提出了一种网络空间同位模式可视化挖掘方法。该方法利用视觉语言表达网络空间现象之间的影响和交互作用。首先,利用网络空间核密度估计表达网络空间现象的分布情况和影响范围,为网络空间现象的同位模式挖掘提供支持,并建立单个地理现象分布情况与颜色之间的映射;然后基于色光加色混合原理获得两个地理现象相互影响的认知,借以挖掘空间同位模式。本文提出的方法属于形象思维,具有直观,形象和易感受等特点。     

Small-world characteristics on transportation networks: a perspective from network autocorrelation

Studies on small-world networks have received intensive interdisciplinary attention during the past several years. It is well-known among researchers that a small-world network is often characterized by high connectivity and clustering, but so far there exist few effective approaches to evaluate small-world properties, especially for spatial networks. This paper proposes a method to examine the small-world properties of spatial networks from the perspective of network autocorrelation. Two network autocorrelation statistics, Moran’s I and Getis–Ord’s G, are used to monitor the structural properties of networks in a process of “rewiring” networks from a regular to a random network. We discovered that Moran’s I and Getis–Ord’s G tend to converge and have relatively low values when properties of small-world networks emerge. Three transportation networks at the national, metropolitan, and intra-city levels are analyzed using this approach. It is found that spatial networks at these three scales possess small-world properties when the correlation lag distances reach certain thresholds, implying that the manifestation of small-world phenomena result from the interplay between the network structure and the dynamics taking place on the network.