Proceedings of the 23rd SIGSPATIAL International Conference on Advances in Geographic Information Systems最新文献_第7页

An interactive visual analytic tool for semantic classification of 3D urban LiDAR point cloud 三维城市激光雷达点云语义分类的交互式可视化分析工具

Proceedings of the 23rd SIGSPATIAL International Conference on Advances in Geographic Information Systems Pub Date : 2015-11-03 DOI: 10.1145/2820783.2820863

B. Kumari, Jaya Sreevalsan-Nair

{"title":"An interactive visual analytic tool for semantic classification of 3D urban LiDAR point cloud","authors":"B. Kumari, Jaya Sreevalsan-Nair","doi":"10.1145/2820783.2820863","DOIUrl":"https://doi.org/10.1145/2820783.2820863","url":null,"abstract":"We propose a novel unsupervised machine learning approach for effective semantic labeling by combining two different multi-class classifications, structural and contextual classification, of points in airborne LiDAR point cloud of urban environment. Structural classification labels a point in the cloud as a point-, line-, or surface-type feature. An additional outcome of this classification is the geometry-preserving downsampling of the point cloud. The contextual classification, on the other hand, labels the points in four classes, namely, buildings, vegetation, natural ground, and asphalt ground, by using data derived from the raw input, which includes the structural classification. Preserving these two classifications in the labeling of the points gives a geometry-aware contextual semantic labeling. We propose: (a) an augmented semantic classification which preserves both structural and contextual classification, (b) an interactive hierarchical clustering method for contextual classification, and (c) an interactive visual analytic framework to aid both the structural and contextual classifications.","PeriodicalId":241302,"journal":{"name":"Proceedings of the 23rd SIGSPATIAL International Conference on Advances in Geographic Information Systems","volume":"151 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122432321","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

Probabilistic estimation of link travel times in dynamic road networks 动态路网中路段行程时间的概率估计

Proceedings of the 23rd SIGSPATIAL International Conference on Advances in Geographic Information Systems Pub Date : 2015-11-03 DOI: 10.1145/2820783.2820836

M. Asghari, Tobias Emrich, Ugur Demiryurek, C. Shahabi

{"title":"Probabilistic estimation of link travel times in dynamic road networks","authors":"M. Asghari, Tobias Emrich, Ugur Demiryurek, C. Shahabi","doi":"10.1145/2820783.2820836","DOIUrl":"https://doi.org/10.1145/2820783.2820836","url":null,"abstract":"Due to the availability of large historical and real-time traffic data, car navigation systems are becoming more and more advanced in predicting the travel time for various routes and finding the fastest route from a source to a destination given a start time. The most advanced of these systems predict the travel time of the routes, given past traffic patterns in order to find the best route. However, the best route is not necessarily a reliable route as well, i.e., the route with the least variation in possible travel times. The most reliable route is desirable when traveling with a deadline, e.g., to reach a flight at the airport or to arrive on time for an important meeting. To find the most reliable route, one needs to predict the probability distribution of travel times for that route. This in turn requires the estimation of travel time probability distributions for each and every link, given a link-entrance-time. In this paper we address the problem of computing these link travel time distributions. To the best of our knowledge there has not been any study on how to compute probability distributions for links (/edges) in road networks. We show how this first step can affect the accuracy of the travel time distribution over the entire route. Our final challenge is to evaluate the result of different approaches in computing these travel time distributions, which is difficult because the reported travel time is not a single value but a probabilistic distribution highly depending on the trip start time. We thus propose a statistical test that enables us to evaluate these outcomes.","PeriodicalId":241302,"journal":{"name":"Proceedings of the 23rd SIGSPATIAL International Conference on Advances in Geographic Information Systems","volume":"96 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122969772","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}

引用次数: 41

STAC: spatial task assignment for crowd sensing with cloaked participant locations STAC:具有隐形参与者位置的人群感知空间任务分配

Proceedings of the 23rd SIGSPATIAL International Conference on Advances in Geographic Information Systems Pub Date : 2015-11-03 DOI: 10.1145/2820783.2820788

Layla Pournajaf, Li Xiong, V. Sunderam, Xiaofeng Xu

引用次数: 21

Spatial cohesion queries 空间内聚查询

Proceedings of the 23rd SIGSPATIAL International Conference on Advances in Geographic Information Systems Pub Date : 2015-11-03 DOI: 10.1145/2820783.2820834

Dimitris Sacharidis, Antonios Deligiannakis

引用次数: 1

Processing streams of spatial k-NN queries and position updates on manycore GPUs 多核gpu上空间k-NN查询和位置更新的处理流

Proceedings of the 23rd SIGSPATIAL International Conference on Advances in Geographic Information Systems Pub Date : 2015-11-03 DOI: 10.1145/2820783.2820803

Francesco Lettich, S. Orlando, C. Silvestri

引用次数: 8

CO2NNIE: personalized fuel consumption and CO2 emissions CO2NNIE:个性化的燃料消耗和二氧化碳排放

Proceedings of the 23rd SIGSPATIAL International Conference on Advances in Geographic Information Systems Pub Date : 2015-11-03 DOI: 10.1145/2820783.2820790

Benjamin B. Krogh, O. Andersen, Edwin Lewis-Kelham, K. Torp

引用次数: 1

Where are the passengers?: a grid-based gaussian mixture model for taxi bookings 乘客在哪里?基于网格的出租车预订高斯混合模型

Proceedings of the 23rd SIGSPATIAL International Conference on Advances in Geographic Information Systems Pub Date : 2015-11-03 DOI: 10.1145/2820783.2820807

Meng-Fen Chiang, Tuan-Anh Hoang, Ee-Peng Lim

{"title":"Where are the passengers?: a grid-based gaussian mixture model for taxi bookings","authors":"Meng-Fen Chiang, Tuan-Anh Hoang, Ee-Peng Lim","doi":"10.1145/2820783.2820807","DOIUrl":"https://doi.org/10.1145/2820783.2820807","url":null,"abstract":"Taxi bookings are events where requests for taxis are made by passengers either over voice calls or mobile apps. As the demand for taxis changes with space and time, it is important to model both the space and temporal dimensions in dynamic booking data. Several applications can benefit from a good taxi booking model. These include the prediction of number of bookings at certain location and time of the day, and the detection of anomalous booking events. In this paper, we propose a Grid-based Gaussian Mixture Model (GGMM) with spatio-temporal dimensions that groups booking data into a number of spatio-temporal clusters by observing the bookings occurring at different time of the day in each spatial grid cell. Using a large-scale real-world dataset consisting of over millions of booking records, we show that GGMM outperforms two strong baselines: a Gaussian Mixture Model (GMM) and the state-of-the-art spatio-temporal behavior model, Periodic Mobility Model (PMM), in estimating the spatio-temporal distribution of bookings at specific grid cells during specific time intervals. GGMM can achieve up to 95.8% (96.5%) reduction in perplexity compared against GMM (PMM). Further, we apply GGMM to detect anomalous bookings and successfully relate the anomalies with some known events, demonstrating GGMM's effectiveness in this task.","PeriodicalId":241302,"journal":{"name":"Proceedings of the 23rd SIGSPATIAL International Conference on Advances in Geographic Information Systems","volume":"27 2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131033680","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}

引用次数: 21

Navigation made personal: inferring driving preferences from GPS traces 导航变得个人化:根据GPS的轨迹推断驾驶偏好

Proceedings of the 23rd SIGSPATIAL International Conference on Advances in Geographic Information Systems Pub Date : 2015-11-03 DOI: 10.1145/2820783.2820808

D. Delling, A. Goldberg, M. Goldszmidt, John Krumm, Kunal Talwar, Renato F. Werneck

引用次数: 48

Alternative routing: k-shortest paths with limited overlap 备选路由:有限重叠的k最短路径

Proceedings of the 23rd SIGSPATIAL International Conference on Advances in Geographic Information Systems Pub Date : 2015-11-03 DOI: 10.1145/2820783.2820858

Theodoros Chondrogiannis, Panagiotis Bouros, J. Gamper, U. Leser

{"title":"Alternative routing: k-shortest paths with limited overlap","authors":"Theodoros Chondrogiannis, Panagiotis Bouros, J. Gamper, U. Leser","doi":"10.1145/2820783.2820858","DOIUrl":"https://doi.org/10.1145/2820783.2820858","url":null,"abstract":"Shortest path computation is a fundamental problem in road networks with application in various domains in research and industry. However, returning only the shortest path is often not satisfying; users are also interested in alternative paths which might be longer but have other advantages, e.g., less frequent traffic congestion. In this paper, we formally introduce the k-Shortest Paths with Limited Overlap (k-SPwLO) problem seeking to recommend k alternative paths which are (a) as short as possible and (b) sufficiently dissimilar based on a user-controlled similarity threshold. We propose two algorithms that examine the paths from a source s to a target t in increasing order of their length and progressively construct the result set. The baseline algorithm BSL builds upon a standard algorithm for computing k-Shortest Paths, followed by a filter step. The OnePass algorithm considers the overlap constraint in each expansion step while traversing the network. We evaluate the performance of both algorithms on real road networks and show that OnePass always outperforms BSL.","PeriodicalId":241302,"journal":{"name":"Proceedings of the 23rd SIGSPATIAL International Conference on Advances in Geographic Information Systems","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124467350","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}

引用次数: 40

Brands in NewsStand: spatio-temporal browsing of business news 报摊中的品牌:商业新闻的时空浏览

Proceedings of the 23rd SIGSPATIAL International Conference on Advances in Geographic Information Systems Pub Date : 2015-11-03 DOI: 10.1145/2820783.2820795

Ahmed Abdelkader, Emily M. Hand, H. Samet

引用次数: 15