共查询到20条相似文献，搜索用时 31 毫秒
1.
Enhancing data privacy with semantic trajectories: A raster‐based framework for GPS stop/move management 
下载免费PDF全文
下载免费PDF全文 Tracking facilities on smartphones generate enormous amounts of GPS trajectories, which provide new opportunities to study movement patterns and improve transportation planning. Converting GPS trajectories into semantically meaningful trips is attracting increasing research effort with respect to the development of algorithms, frameworks, and software tools. There are, however, few works focused on designing new semantic enrichment functionalities taking privacy into account. This article presents a raster‐based framework which not only detects significant stop locations, segments GPS records into stop/move structures, and brings semantic insights to trips, but also provides possibilities to anonymize users’ movements and sensitive stay/move locations into raster cells/regions so that a multi‐level data sharing structure is achieved for a variety of data sharing purposes. 相似文献
2.
提出了基于栅格数据的面状目标之间的两种空间方向相似性的计算方法：利用栅格数据的特征和方向关系矩阵计算空间方向相似性；基于单个栅格单元与参考目标之间角度的变化计算面状目标之间空间方向相似性。这两种方法简化了由Goyal提出的基于方向关系矩阵模型计算空间方向相似性的方法，克服了方向产生某些细微变化时的限制，在计算面状目标空间方向相似性时具有更广泛的适用性。 相似文献
3.
Identifying a route that avoids obstacles in continuous space is important for infrastructure alignment, robotic travel, and virtual object path planning, among others, because movement through space is not restricted to a predefined road or other network. Vector and raster GIS (geographic information system) solution approaches have been developed to find good/efficient routes. On the vector side, recent solution approaches exploit spatial knowledge and utilize GIS functionality, offering significant computational advantages in finding an optimal solution to this path routing problem. Raster‐based shortest path techniques are widely applied in route planning for wayfinding, corridor alignment, robotics and video gaming to derive an obstacle avoiding path, but represent an approximation approach for solving this problem. This research compares vector and raster approaches for identifying obstacle‐avoiding shortest paths/routes. Empirical assessment is carried out for a number of planning applications, highlighting representational issues, computational requirements and resulting path efficiency. 相似文献
4.
Similarity for spatial directions plays an important role in GIS. In this paper, the conventional approaches are analyzed. Based on raster data areal objects, the authors propose two new methods for measuring similarity among spatial directions. One is to measure the similarity among spatial directions based on the features of raster data and the changes of distances between spatial objects, the other is to measure the similarity among spatial directions according to the variation of each raster cell centroid angle. The two methods overcome the complexity of measuring similarity among spatial directions with direction matrix model and solve the limitation of small changes in direction. The two methods are simple and have broader applicability. 相似文献
5.
DINGHong GUOQingsheng DUXiaochu 《地球空间信息科学学报》2004,7(3):225-230
Similarity for spatial directions plays an important role in GIS. In this paper, the conventional approaches are analyzed. Based on raster data areal objects, the authors propose two new methods for measuring similarity among spatial directions. One is to measure the similarity among spatial directions based on the features of raster data and the changes of distances between spatial objects, the other is to measure the similarity among spatial directions according to the variation of each raster cell centroid angle. The two methods overcome the complexity of measuring similarity among spatial directions with direction matrix model and solve the limitation of small changes in direction. The two methods are simple and have broader applicability. 相似文献
6.
Harri Antikainen 《Transactions in GIS》2013,17(1):96-108
The conventional raster‐based least‐cost path technique, in which the connectivity graph is constructed by treating each raster cell as a node and linking each node to its adjacent neighbors, has been widely used to determine optimum paths in space. Unfortunately, paths calculated with this method are subject to distortions that stem from the imposed node‐link structure. Due to the distortions, the calculated paths may be longer than the true optimum paths in continuous space, and because of this, they may also look highly unrealistic when displayed on a map. This study examines how the quality of the raster‐based paths can be improved by using larger connectivity patterns on the one hand, and placing nodes on the sides of the cells of a raster instead of at their centers, on the other. In addition, the utility of the quadtree structure is examined. The different methods are evaluated against three different datasets using the cost distance of the calculated paths and processing times as evaluation criteria. The results indicate that raster‐based paths can be improved by using the evaluated techniques, although the degree of improvement is also dependent on the properties of the underlying cost raster. 相似文献
7.
8.
Input/output (I/O) of geospatial raster data often becomes the bottleneck of parallel geospatial processing due to the large data size and diverse formats of raster data. The open‐source Geospatial Data Abstraction Library (GDAL), which has been widely used to access diverse formats of geospatial raster data, has been applied recently to parallel geospatial raster processing. This article first explores the efficiency and feasibility of parallel raster I/O using GDAL under three common ways of domain decomposition: row‐wise, column‐wise, and block‐wise. Experimental results show that parallel raster I/O using GDAL under column‐wise or block‐wise domain decomposition is highly inefficient and cannot achieve correct output, although GDAL performs well under row‐wise domain decomposition. The reasons for this problem with GDAL are then analyzed and a two‐phase I/O strategy is proposed, designed to overcome this problem. A data redistribution module based on the proposed I/O strategy is implemented for GDAL using a message‐passing‐interface (MPI) programming model. Experimental results show that the data redistribution module is effective. 相似文献
9.
Multi‐criteria evaluation (MCE) procedures are widely used in raster‐based geographic information systems (GIS) to perform a variety of land use siting applications. Many of the criteria used in an MCE analysis are based on spatial relationships or situation characteristics. Situation factors measure the accessibility that each raster cell is to resources or land uses that generate spatial externalities for the activity being sited. This accessibility can be measured either in terms of distance to the nearest target cell containing resources or the overall level of resource availability as measured by a spatial interaction model. This paper examines the spatial structure of these situation factors to identify the set of critical target cells for which distance estimates are most sensitive. Critical target cells are especially important in the case of positive externalities in which an activity would be inclined to locate near these cells to use or consume the resources there. Critical target cells are useful for evaluating the utility of the final site selection with respect to resource/activity ratios. 相似文献
10.
In this study, we present a newly developed method for the estimation of surface flow paths on a digital elevation model (DEM). The objective is to use a form‐based algorithm, analyzing flow over single cells by dividing them into eight triangular facets and to estimate the surface flow paths on a raster DEM. For each cell on a gridded DEM, the triangular form‐based multiple flow algorithm (TFM) was used to distribute flow to one or more of the eight neighbor cells, which determined the flow paths over the DEM. Because each of the eight facets covering a cell has a constant slope and aspect, the estimations of – for example – flow direction and divergence/convergence are more intuitive and less complicated than many traditional raster‐based solutions. Experiments were undertaken by estimating the specific catchment area (SCA) over a number of mathematical surfaces, as well as on a real‐world DEM. Comparisons were made between the derived SCA by the TFM algorithm with eight other algorithms reported in the literature. The results show that the TFM algorithm produced the closest outcomes to the theoretical values of the SCA compared with other algorithms, derived more consistent outcomes, and was less influenced by surface shapes. The real‐world DEM test shows that the TFM was capable of modeling flow distribution without noticeable ‘artefacts’, and its ability to track flow paths makes it an appropriate platform for dynamic surface flow simulation. 相似文献
11.
Environmental models constructed with a spatial domain require choices about the representation of space. Decisions in the adaptation of a spatial data model can have significant consequences on the ability to predict environmental function as a result of changes to levels of aggregation of input parameters and scaling issues in the processes being modelled. In some cases, it is possible to construct a systematic framework to evaluate the uncertainty in predictions using different spatial models; in other cases, the realm of possibilities plus the complexity of the environmental model in question may inhibit numeric uncertainty estimates. We demonstrate a range of potential spatial data models to parameterize a landscape‐level hydroecological model (RHESSys). The effects of data model choice are illustrated, both in terms of input parameter distributions and resulting ecophysiological predictions. Predicted productivity varied widely, as a function of both the number of modelling units, and of arbitrary decisions such as the origin of a raster grid. It is therefore important to use as much information about the modelled environment as possible. Combinations of adaptive methods to evaluate distributions of input data, plus knowledge of dominant controls of ecosystem processes, can help evaluate potential representations. In this case, variance‐based delineation of vegetation patches is shown to improve the ability to intelligently choose a patch distribution that minimizes the number of patches, while maintaining a degree of aggregation that does not overly bias the predictions. 相似文献
12.
CHRISTOPHER J BROOKES 《Transactions in GIS》1997,2(3):201-212
Locating optimal sites on raster suitability maps is a complex problem when the size of the sites is larger than the cell size. There are a number of techniques for generating suitability maps, but these maps are not solutions to the site location problem. Feasible solutions are clusters of contiguous cells which meet spatial criteria concerning the size and shape of the clusters. Locaring optimal sites involves a trade-off between the intrinsic suitability of individual cells and the spatial configuration of cells. This paper describes a genetic algorithm which searches for optimal clusters and thereby locates optimal sites. The genetic algorithm uses a parameterized regiongrowing program to translate numeric strings into regions on a raster and employs raster GIS functions to evaluate utility scores. In a range of simulated problems, comparisons with an exhaustive search show that the genetic algorithm is efficient and robust. The results indicate that the genetic algorithm can find good solutions to real problems when exhaustive search methods are impractical. 相似文献
13.
Gbor Farkas 《Transactions in GIS》2020,24(1):72-84
Companies and individual developers have recently put serious effort into improving web mapping libraries. A significant front in this development is hardware‐accelerated vector graphics. Owing to those efforts, and the continuously evolving World Wide Web, users can visualize large vector layers, and even animate them. On the other hand, this rapid development cannot be observed with raster data. There are some data abstraction libraries for reading raster files, although web mapping libraries do not use them to offer raster capabilities. Since there are no mature raster management pipelines on the web, this study explores two inherently different techniques for handling raster data. One of them uses the traditional, texture‐based method. The other is a hybrid technique rendering raster layers as vectors, overcoming some limitations of the raster model. While the traditional technique gives a smooth user experience, the hybrid method shows promising results for rendering hexagonal coverages. 相似文献
14.
The discovery of zones and people's movement patterns supports a better understanding of modern cities and enables a more comprehensive strategy for urban planning. This article proposes a modified method based on previous research to simultaneously discover people's zones and movement patterns, called movement patterns between functional zones (MPFZ). The method attempts to take full advantage of taxi GPS data to identify MPFZs by merging the movement traces satisfying the merging conditions. Considering movement directions, movement numbers and the adjacent constraints that consist of spatial relationship and attribute features, the merging conditions limit the movement traces to be merged. The new MPFZs are discovered by an iteration process and are measured by the following three evaluation indices: v‐value, a‐value and c‐value, which represent coverage, accuracy and their trade‐off. Using a real‐world taxi dataset of Beijing, 24 new MPFZs are discovered, which have higher v‐, a‐ and c‐values than the unmerged MPFZs. The results of the real‐world dataset experiment show that the proposed approach is effective and efficient. The proposed method can also be applied to other types of transportation data and regions by adjusting the dataset utilized and controlling the iteration process. 相似文献
15.
《制图学和地理信息科学》2013,40(2):111-116
An important issue in cartography and GIS is determining the appropriate resolution or cell size when converting vector data to raster. The general consensus is to make the cell size as small as possible to resolve geographic features and provide the most accurate estimates of measurements. Finer resolution results in more accurate estimates of polygon area; however, the raster data structure introduces an artifact that causes errors in the estimation of the length of linear features and of the perimeter of polygon features to increase with increasing resolution. Over-estimation as high as 41 percent is theoretically possible and was found to be around 26 percent for representative polygon maps. A method is described that uses a correction coefficient to reduce overestimation error to less than 3 percent. 相似文献
16.
Research on the transmission of infectious diseases amongst the human population at fine scales is limited. At this level,
the dynamics of humans are determined by their social activities and the physical condition of the environment. Raster space
AB (activity bundle) simulation is a method to simulate humans' contacts within a space under the framework of an individual
space–time activity-based model (ISTAM). The parameters of the raster space AB simulation were explored. For static ABs, the
results show the relations between proportion infected and proportion occupied, number of index cases, size of AB, size of
cell, ratio of AB and ratio of cell, respectively due to the different spatial distributions of individuals. The most important
parameters were number of index cases, size of AB and proportion occupied. For dynamic ABs, analysis shows that movement frequency
is more important than movement proportion. An example application of raster space AB simulation shows that this method can
be used effectively to quantify the infection risk (proportion infected) at the within-AB level. This research can further
the understanding of transmission process at fine scales and is beneficial to the design and testing of control measures.
相似文献
17.
Anastasia Petrenko Anton Sizo Winchel Qian A. Dylan Knowles Amin Tavassolian Kevin Stanley Scott Bell 《Transactions in GIS》2014,18(3):351-369
The popularization of tracking devices, such as GPS, accelerometers and smartphones, have made it possible to detect, record, and analyze new patterns of human movement and behavior. However, employing GPS alone for indoor localization is not always possible due to the system's inability to determine location inside buildings or in places of signal occlusion. In this context, the application of local wireless networks for determining position is a promising alternative solution, although they still suffer from a number of limitations due to energy and IT‐resources. Our research outlines the potential for employing indoor wireless network positioning and sensor‐based systems to improve the collection of tracking data indoors. By applying various methods of GIScience we developed a methodology that can be applicable for diverse human indoor mobility analysis. To show the advantage of the proposed method, we present the result of an experiment that included mobility analysis of 37 participants. We tracked their movements on a university campus over the course of 41 days and demonstrated that their movement behavior can be successfully studied with our proposed method. 相似文献
18.
本文介绍了在土地利用现状等基础数据库未建成的情况下,如何利用GIS技术实现栅格图件配准、拼接,界址点坐标无缝展示以及栅格图片的局部矢量化和面积量算等,为建设用地审查提供辅助依据,以提高用地审批的科学性和工作效率。 相似文献
19.
A methodology for analyzing geographic data using the techniques of: (1) qualitative geometric abstraction; and (2) ontological analysis of geographic features is described. The first technique is a bottom‐up approach to extract qualitative spatial relations from geographic representations (raster or vector) while the second technique is a top‐down approach to determine which qualitative relations can possibly hold between the parts of the geographic features. The process of analyzing geographic data includes the extraction of both the features and the qualitative relations among features. These qualitative relations are then used to classify the geographic features within the “space” of ontological possibilities. In this article bays in Wisconsin and their cartographic representation are used as a running example and the subject of a case study. 相似文献
20.
Voronoi图是计算几何学中一个重要数据结构,在诸多领域具有广泛的应用。栅格扫描算法符合计算机离散特征,优化了欧氏距离算法,是最优的栅格Voronoi图生成算法之一。但是,由于栅格单元距离与欧氏距离的差异,在扫描过程中部分单元的归属不可避免地产生一定的误差,使栅格Voronoi图的应用受到一定限制。本文针对传统扫描算法存在的误差缺陷,提出了一种基于横-纵扫描的栅格Voronoi图改进生成算法。首先,深入分析了传统扫描算法产生误差缺陷的原因和区域分布特征;然后,以3×3邻域为模板,在一个正常周期的水平(横向)扫描后,增加一个周期竖直(纵向)扫描,即通过横-纵两个周期扫描实现Voronoi图的准确生成;最后,应用不同的栅格数据进行了试验对比,结果表明:改进后的算法既具备扫描算法效率上的优势,同时解决了原算法扫描的误差缺陷,在高效生成的同时把误差限制在一个格网以内。 相似文献