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

Reverse k-Nearest Neighbor monitoring on mobile objects 对移动对象进行反向k近邻监控

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

Tobias Emrich, H. Kriegel, Peer Kröger, M. Renz, Naixin Xu, Andreas Züfle

引用次数: 13

Cartography and information presentation: a graphics/visualization perspective 制图和信息表示:图形/可视化视角

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

Maneesh Agrawala

{"title":"Cartography and information presentation: a graphics/visualization perspective","authors":"Maneesh Agrawala","doi":"10.1145/1869790.1869792","DOIUrl":"https://doi.org/10.1145/1869790.1869792","url":null,"abstract":"Over the last 15 years spatial databases and mapping services have become one of the most important applications on the Internet. In that time we have seen transformative increases in the availability of spatial data such as detailed satellite, streetside and casual images, 3D terrain and building models, and real-time traffic information. Such data has made it possible to create a variety of new kinds of maps and online experiences of any location on earth. Yet, only a handful of different kinds of maps are available online today. Moreover, it is not always clear what task today's online maps are designed to solve.\u0000 This talk presents a user-centered view of map design. Some of the difficult spatial tasks people regularly face as they navigate the world are described and the long history of mapmaking is drawn upon to show a variety of maps that are carefully designed to address these tasks. Examples include maps designed to help users find their way from one location to another, to aid viewers in better understanding the spatial layout of 3D environments, and to assist tourists in finding points of interest in a new city. The talk concludes with a set of open challenges for online map design.","PeriodicalId":359068,"journal":{"name":"ACM SIGSPATIAL International Workshop on Advances in Geographic Information Systems","volume":"104 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":"124689138","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}

引用次数: 0

Detecting nearly duplicated records in location datasets 检测位置数据集中几乎重复的记录

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

Yu Zheng, Xixuan Fen, Xing Xie, Shuang Peng, J. Fu

{"title":"Detecting nearly duplicated records in location datasets","authors":"Yu Zheng, Xixuan Fen, Xing Xie, Shuang Peng, J. Fu","doi":"10.1145/1869790.1869812","DOIUrl":"https://doi.org/10.1145/1869790.1869812","url":null,"abstract":"The quality of a local search engine, such as Google and Bing Maps, heavily relies on its geographic datasets. Typically, these datasets are obtained from multiple sources, e.g., different vendors or public yellow-page websites. Therefore, the same location entity, like a restaurant, might have multiple records with slightly different presentations of title and address in different data sources. For instance, 'Seattle Premium Outlets' and 'Seattle Premier Outlet Mall' describe the same Outlet located in the same place while their titles are not identical. This will cause many nearly-duplicated records in a location database, which would bring trouble to data management and make users confused by the various search results of a query. To detect these nearly duplicated records, we propose a machine-learning-based approach, which is comprised of three steps: candidate selection, feature extraction and training/inference. Three key features consisting of name similarity, address similarity and category similarity, as well as corresponding metrics, are proposed to model the differences between two entity records. We evaluate our method with intensive experiments based on a large-scale real dataset. As a result, both the precision and recall of our method exceeded 90%.","PeriodicalId":359068,"journal":{"name":"ACM SIGSPATIAL International Workshop on Advances in Geographic Information Systems","volume":"42 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":"122233779","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}

引用次数: 27

A variant of particle filtering using historic datasets for tracking complex geospatial phenomena 利用历史数据集跟踪复杂地理空间现象的粒子滤波的一种变体

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

A. Panangadan, A. Talukder

{"title":"A variant of particle filtering using historic datasets for tracking complex geospatial phenomena","authors":"A. Panangadan, A. Talukder","doi":"10.1145/1869790.1869824","DOIUrl":"https://doi.org/10.1145/1869790.1869824","url":null,"abstract":"The paper presents an extension of the particle filtering algorithm that is applicable when an accurate state prediction model cannot be specified but a database of prior state evolution tracks is available. The conventional particle filtering algorithm represents the belief state as a collection of particles, where each particle is a sample from the state space. The particles are updated by applying the state space equations. In the proposed approach, each particle is an instance of a complete state trajectory, drawn from the database of historic state trajectories. An explicit state update model is not required as the trajectory represented by each particle is covers the entire modeling time period. When new observations become available, a proportion of the particles are replaced using trajectories from the database, selected based on distance from the observation. This tracking algorithm is applicable where the state evolves in a complex manner as in the eye of tropical cyclones. The proposed technique is evaluated by tracking selected cyclones from 2005 using a database of cyclone tracks from the previous 25 years.","PeriodicalId":359068,"journal":{"name":"ACM SIGSPATIAL International Workshop on Advances in Geographic Information Systems","volume":"118 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":"128871160","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

Beyond rasters: introducing the new OGC web coverage service 2.0 光栅之外:介绍新的OGC web覆盖服务2.0

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

P. Baumann

{"title":"Beyond rasters: introducing the new OGC web coverage service 2.0","authors":"P. Baumann","doi":"10.1145/1869790.1869835","DOIUrl":"https://doi.org/10.1145/1869790.1869835","url":null,"abstract":"In the classical triad of vector, raster, and meta data, it is the raster part which is not yet sufficiently supported in SDIs nowadays. Consequently, integration of earth observation imagery, LIDAR, legacy map scans, etc. into Spatial Data Infrastructures (SDIs) remains incomplete. In terms of standards, the OGC Web Coverage Service (WCS) Standard defines open interfaces for accessing and processing of raster data, more generally: coverages. In August 2010, the completely overhauled WCS 2.0 has been adopted by OGC. To make coverages interchangeable across all OGC-based services, WCS 2.0 has been based on Geography Markup Language (GML) 3.2.1, with a small, backwards compatible addition to achieve informational completeness. In parallel to specification writing, its reference implementation and an online demo are being pursued.\u0000 WCS 2.0 offers several advantages over previous versions, such as: support for general n-D raster data and non-raster coverage types; crisp, modular, and easy to understand; flexible and adaptive; harmonized with GML and Sensor Web Enablement (SWE); improved testability; and allows for efficient and scalable implementations.\u0000 In this paper we present WCS 2.0 and some central design rationales. Further, we inspect the reference implementation architecture discussing some features critical for scalability. Finally, we give an outlook on next steps, such as the planned WCS Earth Observation Application Profile.","PeriodicalId":359068,"journal":{"name":"ACM SIGSPATIAL International Workshop on Advances in Geographic Information Systems","volume":"2013 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":"114638870","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}

引用次数: 13

Kernelized map matching 核映射匹配

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

A. Jawad, K. Kersting

引用次数: 6

Exploring labeled spatial datasets using association analysis 利用关联分析探索标记空间数据集

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

T. Stepinski, Josue Salazar, W. Ding

{"title":"Exploring labeled spatial datasets using association analysis","authors":"T. Stepinski, Josue Salazar, W. Ding","doi":"10.1145/1869790.1869882","DOIUrl":"https://doi.org/10.1145/1869790.1869882","url":null,"abstract":"We use an association analysis-based strategy for exploration of multi-attribute spatial datasets possessing naturally arising classification. In this demonstration, we present a prototype system, ESTATE (Exploring Spatial daTa Association patTErns), inverting such classification by interpreting different classes found in the dataset in terms of sets of discriminative patterns of its attributes. The system consists of several core components including discriminative data mining, similarity between transactional patterns, and visualization. An algorithm for calculating similarity measure between patterns is the major original contribution that facilitates summarization of discovered information and makes the entire framework practical for real life applications. We demonstrate two applications of ESTATE in the domains of ecology and sociology. The ecology application is to discover the associations of between environmental factors and the spatial distribution of biodiversity across the contiguous United States, and the sociology application aims to discover different spatio-social motifs of support for Barack Obama in the 2008 presidential election.","PeriodicalId":359068,"journal":{"name":"ACM SIGSPATIAL International Workshop on Advances in Geographic Information Systems","volume":"29 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":"124994411","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}

引用次数: 0

Easiest-to-reach neighbor search 最容易到达的邻居搜索

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

Jie Shao, L. Kulik, E. Tanin

{"title":"Easiest-to-reach neighbor search","authors":"Jie Shao, L. Kulik, E. Tanin","doi":"10.1145/1869790.1869840","DOIUrl":"https://doi.org/10.1145/1869790.1869840","url":null,"abstract":"Studies in cognitive science have shown that people have different optimization goals in mind for route selection: beyond shortest travel distance (or time), criteria such as smallest number of turns or straightest path are often considered. A common query that a traveller in a foreign city may ask is \"where is a facility of type X\". When multiple facilities of the same type are available in the nearby area, usually not the nearest neighbor but the one which is easiest to find is preferred for giving instructions by locals, especially in an unfamiliar and complex urban environment. This paper studies a novel type of neighboring object selection problem, taking cognitive complexity of navigation into account. The main difficulty arises from incorporating spatial chunking and landmark information into neighbor comparisons. We propose an algorithm based on network expansion, which uses incremental processing of graph transformation that models instruction complexity. Our approach can efficiently find the easiest-to-reach neighbor with the guaranteed smallest navigation cost. Through experimental evaluation on real road networks, the performance of the proposed algorithm is demonstrated under various settings. Our comparison results reveal that on average the travel distance of the easiest-to-reach neighbor is only 19.3% longer than that of the nearest neighbor, whereas the navigation cost can achieve a 64.8% reduction.","PeriodicalId":359068,"journal":{"name":"ACM SIGSPATIAL International Workshop on Advances in Geographic Information Systems","volume":"14 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":"127273138","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}

引用次数: 6

Algorithms for compressing GPS trajectory data: an empirical evaluation 压缩GPS轨迹数据的算法:一个经验评价

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

Jonathan Muckell, Jeong-Hyon Hwang, C. Lawson, S. Ravi

引用次数: 69

Evaluation of cardinal direction developments between moving points 移动点之间基本方向发展的评估

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

Tao Chen, Hechen Liu, Markus Schneider

引用次数: 7