共查询到20条相似文献，搜索用时 31 毫秒
1.
With the rapid advance of geospatial technologies, the availability of geospatial data from a wide variety of sources has increased dramatically. It is beneficial to integrate / conflate these multi‐source geospatial datasets, since the integration of multi‐source geospatial data can provide insights and capabilities not possible with individual datasets. However, multi‐source datasets over the same geographical area are often disparate. Accurately integrating geospatial data from different sources is a challenging task. Among the subtasks of integration/conflation, the most crucial one is feature matching, which identifies the features from different datasets as presentations of the same real‐world geographic entity. In this article we present a new relaxation‐based point feature matching approach to match the road intersections from two GIS vector road datasets. The relaxation labeling algorithm utilizes iterated local context updates to achieve a globally consistent result. The contextual constraints (relative distances between points) are incorporated into the compatibility function employed in each iteration's updates. The point‐to‐point matching confidence matrix is initialized using the road connectivity information at each point. Both the traditional proximity‐based approach and our relaxation‐based point matching approach are implemented and experiments are conducted over 18 test sites in rural and suburban areas of Columbia, MO. The test results show that our relaxation labeling approach has much better performance than the proximity matching approach in both simple and complex situations. 相似文献
2.
Michael Govorov Giedr&#x; Beconyt&#x; Gennady Gienko Viktor Putrenko 《Transactions in GIS》2019,23(5):1048-1077
In this article, multilayer perceptron (MLP) network models with spatial constraints are proposed for regionalization of geostatistical point data based on multivariate homogeneity measures. The study focuses on non‐stationarity and autocorrelation in spatial data. Supervised MLP machine learning algorithms with spatial constraints have been implemented and tested on a point dataset. MLP spatially weighted classification models and an MLP contiguity‐constrained classification model are developed to conduct spatially constrained regionalization. The proposed methods have been tested with an attribute‐rich point dataset of geological surveys in Ukraine. The experiments show that consideration of the spatial effects, such as the use of spatial attributes and their respective whitening, improve the output of regionalization. It is also shown that spatial sorting used to preserve spatial contiguity leads to improved regionalization performance. 相似文献
3.
Virtual globes enable the combination of heterogeneous datasets for optimal routing analyses in transportation, environmental ecology, and construction engineering. In this study, considering the advantages of the hierarchical tiling structure and topography of virtual globes, we propose a tile‐based optimal routing method for large‐scale road networks in a virtual globe. This method designs a topographically preserved road‐network tile model by partitioning roads into tiles and constructs the road‐network pyramid from the bottom to the top. During construction, a TileArc is calculated and flagged as the shortest path in a tile. Based on the built road‐network pyramid carrying hierarchical TileArcs, a multi‐level and flexible shortest path query can be executed efficiently. The proposed method is implemented with large road networks with different road grades in a virtual globe. Experimental results verify its validity, efficiency, and exactness. Moreover, the length of the shortest path with surface distance is approximately 1.3 times longer than that with Euclidean distance. 相似文献
4.
5.
This article presents an approach to hierarchical matching of nodes in heterogeneous road networks in the same urban area. Heterogeneous road networks not only exist at different levels of detail (LoD), but also have different coordinate systems, leading to difficulties in matching and integrating them. To overcome these difficulties, a pattern‐based method was implemented. Based on the authors' previous work on detecting patterns of divided highways, complex road junctions, and strokes to eliminate the LoD effect of road networks, the proposed method extracts the local networks around each node in a road network and uses them as the matching units for the nodes. Second, the degree of shape similarity between the matching units is measured using a Minimum Road Edit Distance based on a transformation. Finally, the proposed method hierarchically matches the nodes in a road network using the Minimum Road Edit Distance and eliminates false matching nodes using M‐estimators. An experiment involving matching heterogeneous road networks with different LoDs and coordinate systems was carried out to verify the validity of the proposed method. The method achieves good and effective matching regardless of differences in LoDs and road‐network coordinate systems. 相似文献
6.
Yan Zhou Yanxi Li Qing Zhu Fen Chen Junming Shao Yunxin Luo Yeting Zhang Pengcheng Zhang Weijun Yang 《Transactions in GIS》2019,23(5):1125-1151
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. 相似文献
7.
Multiple constraints for schematic road network map cartographic design are analyzed and summarized. Based on this, a set of quantitative criteria are set up and a new road network generalization method including progressive selection and displacement is proposed. Furthermore, topological checking methods for road networks are researched. Based on these constraints, the points in a road network are classified, and a satisfactory and effective schematic map is designed in a concrete experiment while maintaining topological consistency of the road network between the original and the schematic map. 相似文献
8.
Qi Zhou 《Transactions in GIS》2015,19(6):848-876
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. 相似文献
9.
Multiple constraints for schematic road network map cartographic design are analyzed and summarized. Based on this, a set of quantitative criteria are set up and a new road network generalization method including progressive selection and displacement is proposed. Furthermore, topological checking methods for road networks are researched. Based on these constraints, the points in a road network are classified, and a satisfactory and effective schematic map is designed in a con- crete experiment while maintaining topological consistency of the road network between the original and the schematic map 相似文献
10.
Advancing New Testament interpretation through spatio‐temporal analysis: Demonstrated by case studies 
下载免费PDF全文
下载免费PDF全文 This article explores, via three case studies, how spatio‐temporal analysis can advance New Testament text interpretation. Acts 2, verse 9 to 11 is the text of study. Case study 1 applies network analysis to data representing the Roman road network constrained by parameters valid for ancient times. This analysis provided new information on the background of people attending a festival in Jerusalem. Case study 2 located geographical entities from the text in a cartographic visualization and provided supportive information to compare contemporary textual resources. For the disciplines of textual and conjectural criticism (case study 3), spatio‐temporal analysis opens a new window to study what would be the most probable variant of the original text. The case study puts emendations that have been proposed over centuries in a 3D spatial context and provides in this way a sophisticated tool to relate different alternative variants of a specific text. From the case studies, it can be concluded that spatializing, visualizing, and spatially analyzing geographical concepts from the texts in Acts 2 contributes to the field of New Testament interpretation. Further work will elaborate on the findings. 相似文献
11.
Recent advances in network science and the development of volunteered geographic information (VGI) have created new research opportunities in the topological analysis of road networks. The degree correlation of road networks is rarely studied. This study applied four measures, including the average degree of nearest neighbor, correlation profile, Newman's assortativity coefficient, and Litvak–Hofstad's assortativity coefficient, to measure the degree correlations of road networks represented as dual graphs of strokes, axial lines, and named roads. After investigating 100 road networks worldwide obtained from OpenStreetMap, it has been found that road networks are mostly disassortative or uncorrelated in stroke and named road representations, but assortative when represented as axial lines. Inconsistency in different measures persists regardless of method of representation; therefore, qualitative dichotomy or trichotomy is insufficient to describe the actual connection pattern in road networks. A taxonomy of road network assortativity is proposed. Two of the proposed disassortative types are associated with the absence of a grid pattern and are less robust than the typical disassortative type. 相似文献
12.
ZhangCai Yin Sanjuan Li Shen Ying ZhangHaoNan Jin Hui Liu JiaQiang Xiao 《Transactions in GIS》2020,24(2):402-422
Probabilistic time geography (PTG) can be used to measure the probability of random encounters between two moving objects. Available PTG methods are based on homogeneous space, while the network space is typically heterogeneous, which constrains individuals to the network. Therefore, the PTG of the network must consider the geographic network. Based on this, we put forward a method for calculating the encounter probability of objects that are moving in a network by considering network constraints on movement. These constraints not only restrict the space‐time accessibility of the moving objects, but also affect the probability of them visiting locations or encountering other objects in space and time. Therefore, in network space, our method improves measures of the likelihood of encounters between moving objects, thereby enabling more accurate predictions of encounter events and their probabilities. Finally, the performance of the method is experimentally evaluated. In the experiment, campus road network data and simulated trip data are used to calculate the encounter probabilities of two moving objects and to determine when and where two moving objects meet with the highest probability. 相似文献
13.
Geometric quality assessment of trajectory‐generated VGI road networks based on the symmetric arc similarity 下载免费PDF全文
下载免费PDF全文 Haiyang Lyu Yehua Sheng Ningning Guo Baoqun Huang Siyang Zhang 《Transactions in GIS》2017,21(5):984-1009
As large amounts of trajectories from a wide variety of Volunteered Geographic Information (referred to as VGI) contributors pour into the spatial database, the geometric qualities of the VGI road networks generated from these trajectories are different from the ground truth road dataset and so need to be differently assessed. To address this issue, an assessment approach based on symmetric arc similarity is proposed, and the geometric quality of a VGI road network is assessed by its conformity with the corresponding ground truth road network, the results being visualized as hierarchical thematic maps. To compute the conformity, the geometric similarity between the VGI road arc and the corresponding ground truth road arc, which is selected by the adaptive searching distance, is measured based on the symmetric arc similarity method; the geometric quality is assessed based on an assessment matrix. Also, the symmetric arc similarity method is independent of directions and with a feature of shift‐independence, which is applicable to assess the geometric qualities of different VGI road networks and makes the assessment result consistent with the actual situation of the real world. The robustness and scalability of the approach are examined using VGI road networks from different sources. 相似文献
14.
Integrated compression of vehicle spatio‐temporal trajectories under the road stroke network constraint 下载免费PDF全文
下载免费PDF全文 With fast growth of all kinds of trajectory datasets, how to effectively manage the trajectory data of moving objects has received a lot of attention. This study proposes a spatio‐temporal data integrated compression method of vehicle trajectories based on stroke paths coding compression under the road stroke network constraint. The road stroke network is first constructed according to the principle of continuous coherence in Gestalt psychology, and then two types of Huffman tree—a road strokes Huffman tree and a stroke paths Huffman tree—are built, based respectively on the importance function of road strokes and vehicle visiting frequency of stroke paths. After the vehicle trajectories are map matched to the spatial paths in the road network, the Huffman codes of the road strokes and stroke paths are used to compress the trajectory spatial paths. An opening window algorithm is used to simplify the trajectory temporal data depicted on a time–distance polyline by setting the maximum allowable speed difference as the threshold. Through analysis of the relative spatio‐temporal relationship between the preceding and latter feature tracking points, the spatio‐temporal data of the feature tracking points are all converted to binary codes together, accordingly achieving integrated compression of trajectory spatio‐temporal data. A series of comparative experiments between the proposed method and representative state‐of‐the‐art methods are carried out on a real massive taxi trajectory dataset from five aspects, and the experimental results indicate that our method has the highest compression ratio. Meanwhile, this method also has favorable performance in other aspects: compression and decompression time overhead, storage space overhead, and historical dataset training time overhead. 相似文献
15.
Yan Shi Min Deng Jianya Gong Chang‐Tien Lu Xuexi Yang Huimin Liu 《Transactions in GIS》2019,23(2):312-333
Spatio‐temporal clustering is a highly active research topic and a challenging issue in spatio‐temporal data mining. Many spatio‐temporal clustering methods have been designed for geo‐referenced time series. Under some special circumstances, such as monitoring traffic flow on roads, existing methods cannot handle the temporally dynamic and spatially heterogeneous correlations among road segments when detecting clusters. Therefore, this article develops a spatio‐temporal flow‐based approach to detect clusters in traffic networks. First, a spatio‐temporal flow process is modeled by combining network topology relations with real‐time traffic status. On this basis, spatio‐temporal neighborhoods are captured by considering traffic time‐series similarity in spatio‐temporal flows. Spatio‐temporal clusters are further formed by successive connection of spatio‐temporal neighbors. Experiments on traffic time series of central London's road network on both weekdays and weekends are performed to demonstrate the effectiveness and practicality of the proposed method. 相似文献
16.
Zidong Fang Ci Song Hua Shu Jie Chen Tianyu Liu Xi Wang Xiao Chen Xiaorui Yan Tao Pei 《Transactions in GIS》2023,27(2):476-493
Network-constrained points are constrained by and distributed on road networks, for example, taxi pick-up and drop-off locations. The aggregation pattern (clustering) of network-constrained points (significantly denser than randomly distributed) along roads may indicate spatial anomalies. For example, detecting and quantifying the aggregation with the highest intensity (i.e., the number of taxi pick-up points per network length) can reveal high taxi demand. The network K-function and its derivative (incremental network K-function) have been utilized to identify point aggregations and measure aggregation scale, yet can only identify radius-based planar-scale results, thereby mis-estimating aggregation patterns owing to the network topology configuration heterogeneity. Specifically, complex road networks (e.g., intersections) may incur aggregations despite their low intensity. This study constructs the length L-function for network-constrained points, using its first derivative to quantify the true-to-life aggregation scale and the local function to extract aggregations. Synthetic and practical data experiments show innovative detection of aggregations at the length-based scale and with high intensity, providing a new approach to point pattern analysis of networks unaffected by topological complexity. 相似文献
17.
Mathias Versichele Tijs Neutens Manuel Claeys Bouuaert Nico Van de Weghe 《Transactions in GIS》2014,18(5):687-703
Certain datasets on moving objects are episodic in nature – that is, the data is characterized by time gaps during which the position of the object is unknown. In this article, a model is developed to study the sparsely sampled network‐constrained movement of several objects by calculating both potential and feasible (i.e. more likely) co‐presence opportunities over time. The approach is applied to the context of a static sensor network, where the location of an object is only registered when passing a sensor location along a road network. Feasibility is incorporated based on the deviation from the shortest path. As an illustration, the model is applied to a large Bluetooth tracking dataset gathered at a mass event. The model output consists of maps showing the temporal evolution of the distribution of feasible co‐presence opportunities of tracked visitors over the network (i.e. the number of visitors that could have been present together). We demonstrate the model's usefulness in studying the movement and distribution of a crowd over a study area with relatively few sampling locations. Finally, we discuss the results with a special emphasis on the distinction between feasible and actual presence, the need for further validation and calibration, and the performance of the implementation. 相似文献
18.
针对网络Voronoi图中点与点之间通过实际路径距离而非传统欧式距离相连,在实际应用中较平面Voronoi图更加合理,该文提出了一种基于改进脉冲耦合神经网络的网络Voronoi图构建算法。借助模型的自动波发放及并行处理特性,较好地实现了基于路网的网络空间剖分,顾及了道路网及其点群自身属性对其服务范围的影响。实验表明,该算法实现了点群网络Voronoi图的构建,最短路径思想的引入使得构建的网络Voronoi图符合Voronoi图基本特征,可以用来表示点群的服务范围,不仅如此,算法的并行特性保证了算法的高效率。 相似文献
19.
In the real world, there are many kinds of phenomena that are represented by points on a network, such as traffic accidents
on a street network. To analyse these phenomena, the basic point pattern methods (i.e. the nearest neighbour distance method,
the quadrat method, the K-function method and the clumping method) defined on a plane (referred to as the planar basic point pattern methods) are extended to the basic point pattern methods on a network (referred to as the network basic point pattern methods). However, like the planar basic point pattern methods, the network basic point pattern methods assume a uniform network
and this assumption is hard to accept when analysing actual phenomena. To overcome this limitation, this paper formulates
a transformation, called the uniform network transformation, that transforms a non-uniform network into a uniform network. This transformation provides a simple procedure for analysing
point patterns on non-uniform networks: first, a given non-uniform network is transformed into a uniform network; second,
the network basic point pattern methods (which assume a uniform network) are applied to this transformed uniform network.
No modification to the network basic point pattern methods is necessary. The paper also shows an actual application of this
transformation to traffic accidents in Chosei, Japan. 相似文献
20.
This research develops a clustering‐based location‐allocation method to the Capacitated Facility Location Problem (CFLP), which provides an approximate optimal solution to determine the location and coverage of a set of facilities to serve the demands of a large number of locations. The allocation is constrained by facility capacities – different facilities may have different capacities and the overall capacity may be inadequate to satisfy the total demands. This research transforms this special location‐allocation problem into a clustering model. The proposed approach has two parts: (1) the allocation of demands to facilities considering capacity constraints while minimizing the cost; and (2) the iterative optimization of facility locations using an adapted K‐means clustering method. The quality of a location‐allocation solution is measured using an objective function, which is the demand‐weighted distance from demand locations to their assigned facilities. The clustering‐based method is evaluated against an adapted Genetic Algorithm (GA) alternative, which integrates the allocation component as described above but uses GA operations to search for ‘optimal’ facility locations. Experiments and evaluations are carried out with various data sets (including both synthetic and real data). 相似文献