Proceedings of the 24th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems最新文献

筛选
英文 中文
Knowledge-based trajectory completion from sparse GPS samples 基于知识的稀疏GPS样本轨迹补全
Yongni Li, Yangyan Li, D. Gunopulos, L. Guibas
{"title":"Knowledge-based trajectory completion from sparse GPS samples","authors":"Yongni Li, Yangyan Li, D. Gunopulos, L. Guibas","doi":"10.1145/2996913.2996924","DOIUrl":"https://doi.org/10.1145/2996913.2996924","url":null,"abstract":"Traffic trajectories collected from GPS-enabled mobile devices or vehicles are widely used in urban planning, traffic management, and location based services. Their performance often relies on having dense trajectories. However, due to the power and bandwidth limitation on these devices, collecting dense trajectory is too costly on a large scale. We show that by exploiting structural regularity in large trajectory data, the complete geometry of trajectories can be inferred from sparse GPS samples without information about the underlying road network - a process called trajectory completion. In this paper, we present a knowledge-based approach for completing traffic trajectories. Our method extracts a network of road junctions and estimates traffic flows across junctions. GPS samples within each flow cluster are then used to achieve fine-level completion of individual trajectories. Finally, we demonstrate that our method is effective for trajectory completion on both synthesized and real traffic trajectories. On average 72.7% of real trajectories with sampling rate of 60 seconds/sample are completed without map information. Comparing to map matching, over 89% of points on completed trajectories are within 15 meters from the map matched path.","PeriodicalId":20525,"journal":{"name":"Proceedings of the 24th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2016-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73051988","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}
引用次数: 30
Polygon consensus: smart crowdsourcing for extracting building footprints from historical maps Polygon consensus:从历史地图中提取建筑足迹的智能众包
B. Budig, Thomas C. van Dijk, F. Feitsch, M. Arteaga
{"title":"Polygon consensus: smart crowdsourcing for extracting building footprints from historical maps","authors":"B. Budig, Thomas C. van Dijk, F. Feitsch, M. Arteaga","doi":"10.1145/2996913.2996951","DOIUrl":"https://doi.org/10.1145/2996913.2996951","url":null,"abstract":"Over the course of three years, the New York Public Library has run a crowdsourcing project to extract polygonal representation of the building footprints from insurance atlases of the 19th and early-20th century. As is common in crowd-sourcing projects, the overall problem was decomposed into small user tasks and each task was given to multiple users. In the case of polygons representing building footprints, it is unclear how best to integrate the answers into a majority vote: given a set of polygons ostensibly describing the same footprint, what is the consensus? We discuss desirable properties of such a \"consensus polygon\" and arrive at an efficient algorithm. We have manually evaluated the algorithm on approximately 3,000 polygons corresponding to 200 footprints and observe that our algorithmic consensus polygons are correct for 96% of the footprints whereas only 85% of the (input) crowd polygons are correct.","PeriodicalId":20525,"journal":{"name":"Proceedings of the 24th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2016-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79402270","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}
引用次数: 15
Real-time detection and classification of traffic jams from probe data 从探针数据实时检测和分类交通阻塞
Bo Xu, Tiffany Barkley, Andrew P. Lewis, Jane Macfarlane, D. Pietrobon, Matei Stroila
{"title":"Real-time detection and classification of traffic jams from probe data","authors":"Bo Xu, Tiffany Barkley, Andrew P. Lewis, Jane Macfarlane, D. Pietrobon, Matei Stroila","doi":"10.1145/2996913.2996988","DOIUrl":"https://doi.org/10.1145/2996913.2996988","url":null,"abstract":"In this paper we present our experience on detecting and classifying traffic jams in real time from probe data. We classify traffic jams at two levels. At a higher level, we classify traffic jams into recurring and non-recurring jams. Then at a lower level we identify accidents out of non-recurring jams based on features that characterize upstream and downstream traffic patterns. Accidents are highly unpredictable and usually create heavy and long lasting congestion, and therefore are particularly worth detecting. We discuss the challenges of detecting accidents in real time as well as our approaches and results.","PeriodicalId":20525,"journal":{"name":"Proceedings of the 24th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2016-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74770665","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
Scalable user assignment in power grids: a data driven approach 电网中可扩展的用户分配:数据驱动的方法
Bo Lyu, Shijian Li, Yanhua Li, Jie Fu, Andrew C. Trapp, Haiyong Xie, Yong Liao
{"title":"Scalable user assignment in power grids: a data driven approach","authors":"Bo Lyu, Shijian Li, Yanhua Li, Jie Fu, Andrew C. Trapp, Haiyong Xie, Yong Liao","doi":"10.1145/2996913.2996970","DOIUrl":"https://doi.org/10.1145/2996913.2996970","url":null,"abstract":"The fast pace of global urbanization is drastically changing the population distributions over the world, which leads to significant changes in geographical population densities. Such changes in turn alter the underlying geographical power demand over time, and drive power substations to become over-supplied (demand << capacity) or under-supplied (demand ≈ capacity). In this paper, we make the first attempt to investigate the problem of power substation-user assignment by analyzing large-scale power grid data. We develop a Scalable Power User Assignment (SPUA) framework, that takes large-scale spatial power user/substation distribution data and temporal user power consumption data as input, and assigns users to substations, in a manner that minimizes the maximum substation utilization among all substations. To evaluate the performance of our SPUA framework, we conduct evaluations on real power consumption data and user/substation location data collected from a province in China for 35 days in 2015. The evaluation results demonstrate that our SPUA framework can achieve a 20%--65% reduction on the maximum substation utilization, and 2 to 3.7 times reduction on total transmission loss over other baseline methods.","PeriodicalId":20525,"journal":{"name":"Proceedings of the 24th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2016-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74627072","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}
引用次数: 10
Spatiotemporal topic association detection on tweets 推文的时空主题关联检测
Zhi Liu, Yan Huang, Joshua R. Trampier
{"title":"Spatiotemporal topic association detection on tweets","authors":"Zhi Liu, Yan Huang, Joshua R. Trampier","doi":"10.1145/2996913.2996933","DOIUrl":"https://doi.org/10.1145/2996913.2996933","url":null,"abstract":"The analysis of Twitter data can help to predict or explain many real world phenomena. The relationships among events in the real world can be reflected among the topics on social media. In this paper, we propose the concept of topic association and the associated mining algorithms. Topics with close temporal and spatial relationship may have direct or potential association in the real world. Our goal is to mine such topic associations and show their relationships in different time-region frames. We propose to use the concepts of participation ratio and participation index to measure the closeness among topics and propose a spatiotemporal index to calculate them efficiently. With the topic filtering and the topic combination, we further optimize the mining process and the mining results. The algorithms are evaluated on a Twitter dataset with 27,956,257 tweets.","PeriodicalId":20525,"journal":{"name":"Proceedings of the 24th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2016-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80303387","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}
引用次数: 4
Immersive tangible geospatial modeling 沉浸式有形地理空间建模
Payam Tabrizian, A. Petrasova, B. Harmon, V. Petras, H. Mitásová, R. Meentemeyer
{"title":"Immersive tangible geospatial modeling","authors":"Payam Tabrizian, A. Petrasova, B. Harmon, V. Petras, H. Mitásová, R. Meentemeyer","doi":"10.1145/2996913.2996950","DOIUrl":"https://doi.org/10.1145/2996913.2996950","url":null,"abstract":"Tangible Landscape is a tangible interface for geographic information systems (GIS). It interactively couples physical and digital models of a landscape so that users can intuitively explore, model, and analyze geospatial data in a collaborative environment. Conceptually Tangible Landscape lets users hold a GIS in their hands so that they can feel the shape of the topography, naturally sculpt new landforms, and interact with simulations like water flow. Since it only affords a bird's-eye view of the landscape, we coupled it with an immersive virtual environment so that users can virtually walk around the modeled landscape and visualize it at a human-scale. Now as users shape topography, draw trees, define viewpoints, or route a walkthrough, they can see the results on the projection-augmented model, rendered on a display, or rendered on a head-mounted display. In this paper we present the Tangible Landscape Immersive Extension, describe its physical setup and software architecture, and demonstrate its features with a case study.","PeriodicalId":20525,"journal":{"name":"Proceedings of the 24th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2016-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80664204","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}
引用次数: 14
Mining city-wide encounters in real-time 实时挖掘全市范围内的遭遇
Anthony Quattrone, L. Kulik, E. Tanin
{"title":"Mining city-wide encounters in real-time","authors":"Anthony Quattrone, L. Kulik, E. Tanin","doi":"10.1145/2996913.2996995","DOIUrl":"https://doi.org/10.1145/2996913.2996995","url":null,"abstract":"Recent advancements in data mining coupled with the ubiquity of mobile devices has led to the possibility of mining for events in real-time. We introduce the problem of mining for an individual's encounters. As people travel, they may have encounters with one another. We are interested in detecting the encounters of traveling individuals at the exact moment in which each of them occur. A simple solution is to use a nearest neighbor search to return potential encounters, this results in slow query response times. To mine for encounters in real-time, we introduce a new algorithm that is efficient in capturing encounters by exploiting the observation that just the neighbors in a defined proximity needs to be maintained. Our evaluation demonstrates that our proposed method mines for encounters for millions of individuals in a city area within milliseconds.","PeriodicalId":20525,"journal":{"name":"Proceedings of the 24th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2016-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88586673","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
Implementing data-dependent triangulations with higher order Delaunay triangulations 用高阶Delaunay三角剖分实现依赖数据的三角剖分
Natalia Rodríguez, Rodrigo I. Silveira
{"title":"Implementing data-dependent triangulations with higher order Delaunay triangulations","authors":"Natalia Rodríguez, Rodrigo I. Silveira","doi":"10.1145/2996913.2996958","DOIUrl":"https://doi.org/10.1145/2996913.2996958","url":null,"abstract":"The Delaunay triangulation is the standard choice for building triangulated irregular networks (TINs) to represent terrain surfaces. However, the Delaunay triangulation is based only on the 2D coordinates of the data points, ignoring their elevation. It has long been recognized that sometimes it may be beneficial to use other, non-Delaunay, criteria to build TINs. Data-dependent triangulations were introduced decades ago to address this. However, they are rarely used in practice, mostly because the optimization of data- dependent criteria often results in triangulations with many thin and elongated triangles. Recently, in the field of computational geometry, higher order Delaunay triangulations (HODTs) were introduced, trying to tackle both issues at the same time-data-dependent criteria and good triangle shape. Nevertheless, most previous studies about them have been limited to theoretical aspects. In this work we present the first extensive experimental study on the practical use of HODTs, as a tool to build data-dependent TINs. We present experiments with two USGS terrains that show that HODTs can give significant improvements over the Delaunay triangulation for the criteria identified as most important for data-dependent triangulations. The resulting triangulations have data-dependent values comparable to those obtained with pure data-dependent approaches, without compromising the shape of the triangles, and are faster to compute.","PeriodicalId":20525,"journal":{"name":"Proceedings of the 24th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2016-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84464266","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}
引用次数: 7
Spatio-temporal modeling of the topology of swarm behavior with persistence landscapes 基于持续性景观的蜂群行为拓扑的时空建模
P. Corcoran, Christopher B. Jones
{"title":"Spatio-temporal modeling of the topology of swarm behavior with persistence landscapes","authors":"P. Corcoran, Christopher B. Jones","doi":"10.1145/2996913.2996949","DOIUrl":"https://doi.org/10.1145/2996913.2996949","url":null,"abstract":"We propose a method for modeling the topology of swarm behavior in a manner which facilitates the application of machine learning techniques such as clustering. This is achieved by modeling the persistence of topological features, such as connected components and holes, of the swarm with respect to time using zig-zag persistent homology. The output of this model is subsequently transformed into a representation known as a persistence landscape. This representation forms a vector space and therefore facilitates the application of machine learning techniques. The proposed model is validated using a real data set corresponding to a swarm of 300 fish. We demonstrate that it may be used to perform clustering of swarm behavior with respect to topological features.","PeriodicalId":20525,"journal":{"name":"Proceedings of the 24th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2016-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79057679","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}
引用次数: 10
A traffic flow approach to early detection of gathering events 一种用于早期检测聚集事件的交通流方法
Xun Zhou, Amin Vahedian Khezerlou, A. Liu, M. Shafiq, Fan Zhang
{"title":"A traffic flow approach to early detection of gathering events","authors":"Xun Zhou, Amin Vahedian Khezerlou, A. Liu, M. Shafiq, Fan Zhang","doi":"10.1145/2996913.2996998","DOIUrl":"https://doi.org/10.1145/2996913.2996998","url":null,"abstract":"Given a spatial field and the traffic flow between neighboring locations, the early detection of gathering events (edge) problem aims to discover and localize a set of most likely gathering events. It is important for city planners to identify emerging gathering events which might cause public safety or sustainability concerns. However, it is challenging to solve the edge problem due to numerous candidate gathering footprints in a spatial field and the non-trivial task to balance pattern quality and computational efficiency. Prior solutions to model the edge problem lack the ability to describe the dynamic flow of traffic and the potential gathering destinations because they rely on static or undirected footprints. In contrast, in this paper, we model the footprint of a gathering event as a Gathering directed acyclic Graph (G-Graph), where the root of the G-Graph is the potential destination and the directed edges represent the most likely paths traffic takes to move towards the destination. We also proposed an efficient algorithm called SmartEdge to discover the most likely non-overlapping G-Graphs in the given spatial field. Our analysis shows that the proposed G-Graph model and the SmartEdge algorithm have the ability to efficiently and effectively capture important gathering events from real-world human mobility data. Our experimental evaluations show that SmartEdge saves 50% computation time over the baseline algorithm.","PeriodicalId":20525,"journal":{"name":"Proceedings of the 24th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2016-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82618484","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}
引用次数: 31
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信