ACM SIGSPATIAL International Workshop on Advances in Geographic Information Systems最新文献_第9页

Annotating and navigating tourist videos 注释和导航旅游视频

ACM SIGSPATIAL International Workshop on Advances in Geographic Information Systems Pub Date : 2010-11-02 DOI: 10.1145/1869790.1869828

Bo Zhang, Qinlin Li, Hongyang Chao, Billy Chen, E. Ofek, Ying-Qing Xu

引用次数: 15

Topological reasoning between complex regions in databases with frequent updates 频繁更新的数据库中复杂区域之间的拓扑推理

ACM SIGSPATIAL International Workshop on Advances in Geographic Information Systems Pub Date : 2010-11-02 DOI: 10.1145/1869790.1869842

Arif Khan, Markus Schneider

{"title":"Topological reasoning between complex regions in databases with frequent updates","authors":"Arif Khan, Markus Schneider","doi":"10.1145/1869790.1869842","DOIUrl":"https://doi.org/10.1145/1869790.1869842","url":null,"abstract":"Reasoning about space has been a considerable field of study both in Artificial Intelligence and in spatial information theory. Many applications benefit from the inference of new knowledge about the spatial relationships between spatial objects on the basis of already available and explicit spatial relationship knowledge that we call spatial (relationship) facts. Hence, the task is to derive new spatial facts from known spatial facts. A considerable amount of work has focused on reasoning about topological relationships (as a special and important subset of spatial relationships) between simple spatial objects like simple regions. There is a common consensus in the GIS and spatial database communities that simple regions are insufficient to model spatial reality and that complex region objects are needed that allow multiple components and holes. Models for topological relationships between complex regions have already been developed. Hence, as the next logical step, the goal of this paper is to develop a reasoning model for them. Further, no reasoning model considers changes of the spatial fact basis stored in a database between consecutive queries. We show that conventional modeling suffers from performance degradation when the database is frequently changing. Our model does not assume any geometric representation model or data structure for the regions. The model is also backward compatible, i.e., it is also applicable to simple regions.","PeriodicalId":359068,"journal":{"name":"ACM SIGSPATIAL International Workshop on Advances in Geographic Information Systems","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121563035","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 8

Energy-efficient processing of spatio-temporal queries in wireless sensor networks 无线传感器网络中时空查询的节能处理

ACM SIGSPATIAL International Workshop on Advances in Geographic Information Systems Pub Date : 2010-11-02 DOI: 10.1145/1869790.1869838

Markus Bestehorn, Klemens Böhm, Erik Buchmann, Stephan Kessler

引用次数: 6

An algorithmic framework for segmenting trajectories based on spatio-temporal criteria 基于时空标准的轨迹分割算法框架

ACM SIGSPATIAL International Workshop on Advances in Geographic Information Systems Pub Date : 2010-11-02 DOI: 10.1145/1869790.1869821

M. Buchin, A. Driemel, M. V. Kreveld, Vera Sacristán Adinolfi

引用次数: 75

T-drive: driving directions based on taxi trajectories T-drive:基于出租车轨迹的行驶方向

ACM SIGSPATIAL International Workshop on Advances in Geographic Information Systems Pub Date : 2010-11-02 DOI: 10.1145/1869790.1869807

Jing Yuan, Yu Zheng, Chengyang Zhang, Wenlei Xie, Xing Xie, Guangzhong Sun, Y. Huang

{"title":"T-drive: driving directions based on taxi trajectories","authors":"Jing Yuan, Yu Zheng, Chengyang Zhang, Wenlei Xie, Xing Xie, Guangzhong Sun, Y. Huang","doi":"10.1145/1869790.1869807","DOIUrl":"https://doi.org/10.1145/1869790.1869807","url":null,"abstract":"GPS-equipped taxis can be regarded as mobile sensors probing traffic flows on road surfaces, and taxi drivers are usually experienced in finding the fastest (quickest) route to a destination based on their knowledge. In this paper, we mine smart driving directions from the historical GPS trajectories of a large number of taxis, and provide a user with the practically fastest route to a given destination at a given departure time. In our approach, we propose a time-dependent landmark graph, where a node (landmark) is a road segment frequently traversed by taxis, to model the intelligence of taxi drivers and the properties of dynamic road networks. Then, a Variance-Entropy-Based Clustering approach is devised to estimate the distribution of travel time between two landmarks in different time slots. Based on this graph, we design a two-stage routing algorithm to compute the practically fastest route. We build our system based on a real-world trajectory dataset generated by over 33,000 taxis in a period of 3 months, and evaluate the system by conducting both synthetic experiments and in-the-field evaluations. As a result, 60-70% of the routes suggested by our method are faster than the competing methods, and 20% of the routes share the same results. On average, 50% of our routes are at least 20% faster than the competing approaches.","PeriodicalId":359068,"journal":{"name":"ACM SIGSPATIAL International Workshop on Advances in Geographic Information Systems","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133431780","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 1071

Verifying spatial queries using Voronoi neighbors 使用Voronoi邻居验证空间查询

ACM SIGSPATIAL International Workshop on Advances in Geographic Information Systems Pub Date : 2010-11-02 DOI: 10.1145/1869790.1869839

Ling Hu, Wei-Shinn Ku, S. Bakiras, C. Shahabi

{"title":"Verifying spatial queries using Voronoi neighbors","authors":"Ling Hu, Wei-Shinn Ku, S. Bakiras, C. Shahabi","doi":"10.1145/1869790.1869839","DOIUrl":"https://doi.org/10.1145/1869790.1869839","url":null,"abstract":"With the popularity of location-based services and the abundant usage of smart phones and GPS enabled devices, the necessity of outsourcing spatial data has grown rapidly over the past few years. Nevertheless, in the database outsourcing paradigm, the authentication of the query results at the client remains a challenging problem. In this paper, we focus on the Outsourced Spatial Database (OSDB) model and propose an efficient scheme, called VN-Auth, that allows a client to verify the correctness and completeness of the result set. Our approach can handle both k nearest neighbor (kNN) and range queries, and is based on neighborhood information derived by the Voronoi diagram of the underlying spatial dataset. Specifically, upon receiving a query result, the client can verify its integrity by examining the signatures and exploring the neighborhood of every object in the result set. Compared to the current state-of-the-art approaches (i.e., methods based on Merkle hash trees), VN-Auth produces significantly smaller verification objects (VO) and is more computationally efficient, especially for queries with low selectivity.","PeriodicalId":359068,"journal":{"name":"ACM SIGSPATIAL International Workshop on Advances in Geographic Information Systems","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128644787","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 32

Augmented internet maps with property information from aerial imagery 增强互联网地图与财产信息从航空图像

ACM SIGSPATIAL International Workshop on Advances in Geographic Information Systems Pub Date : 2010-11-02 DOI: 10.1145/1869790.1869848

P. Meixner, F. Leberl

引用次数: 0

Supporting location-based approximate-keyword queries 支持基于位置的近似关键字查询

ACM SIGSPATIAL International Workshop on Advances in Geographic Information Systems Pub Date : 2010-11-02 DOI: 10.1145/1869790.1869802

Sattam Alsubaiee, Alexander Behm, Chen Li

引用次数: 46

Scalable shortest paths browsing on land surface 可扩展的最短路径浏览陆地表面

ACM SIGSPATIAL International Workshop on Advances in Geographic Information Systems Pub Date : 2010-11-02 DOI: 10.1145/1869790.1869806

Songhua Xing, C. Shahabi

{"title":"Scalable shortest paths browsing on land surface","authors":"Songhua Xing, C. Shahabi","doi":"10.1145/1869790.1869806","DOIUrl":"https://doi.org/10.1145/1869790.1869806","url":null,"abstract":"The growing popularity of online Earth visualization tools and geo-realistic games and the availability of high resolution terrain data have motivated a new class of queries to the interests of the GIS and spatial database community: spatial queries (e.g., kNN) over land surface. However, the fundamental challenges that restrict the applicability of these studies to real world applications are the prohibitive time complexity and storage overhead to precompute the shortest surface paths. In this paper, for the first time, we propose an approximate solution to address both challenges and allow browsing the shortest surface paths in O(log N + √N) time, where N is the size of the terrain. With this method, the time and space requirements for an exhaustive all-pair pre-computation have been reduced from O(N3) to O(N1.5) and O(N) respectively. The substantial savings in both time and storage are gained by taking advantage of the fact that the O(N2) surface paths only deviate from approximate straight lines at O(√N) points, termed rough vertices. As a result, we propose a linear time shortest surface path computation algorithm between two arbitrary vertices and a linear size storage structure, which captures all the shortest surface paths between any pair of vertices. We experimentally verified the applicability and scalability of the proposed methods with large real world and synthetic data sets and showed that accuracy higher than 97% can be obtained in most cases.","PeriodicalId":359068,"journal":{"name":"ACM SIGSPATIAL International Workshop on Advances in Geographic Information Systems","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122036445","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 5

Semi-automatic interpretation of buildings and settlement areas in user-generated spatial data 在用户生成的空间数据中对建筑物和居民点区域进行半自动解释

ACM SIGSPATIAL International Workshop on Advances in Geographic Information Systems Pub Date : 2010-11-02 DOI: 10.1145/1869790.1869836

S. Werder, Birgit Kieler, Monika Sester

{"title":"Semi-automatic interpretation of buildings and settlement areas in user-generated spatial data","authors":"S. Werder, Birgit Kieler, Monika Sester","doi":"10.1145/1869790.1869836","DOIUrl":"https://doi.org/10.1145/1869790.1869836","url":null,"abstract":"In recent times the amount of spatial data being collected by voluntary users, e.g. as part of the OpenStreetMap project, is rapidly increasing. Due to the fact, that everyone can participate in this social collaboration, the completeness and accuracy of the data is very heterogeneous. Although a object catalogue exists as part of the OSM project, users are not restricted which attributes they set and to which detail. Therefore the geometry of a feature is more reliable than its attributes. However, in order to use the data for analysis purposes, knowledge about the semantic contents is of importance.\u0000 In our work, we propose an approach to classify spatial data solely based on geometric and topologic characteristics. We use both building outlines and road network information. In the first step, topology errors are fixed in order to create a consistent dataset. In the second step, we use unsupervised classification to separate buildings into clusters sharing the same characteristics. Including expert knowledge by visual inspection and interaction, some of these clusters are grouped together and semantically enriched. In the third step, we transfer the derived information from individual buildings to city blocks that are enclosed by edges of the road network. We evaluate our approach with test datasets from OSM and available authoritative datasets. Our results show, that enrichment of user-generated data is possible based on geometric and topologic feature characteristics.","PeriodicalId":359068,"journal":{"name":"ACM SIGSPATIAL International Workshop on Advances in Geographic Information Systems","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131322657","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 23