{"title":"Conntrans","authors":"Fandel Lin, Hsun-Ping Hsieh","doi":"10.1145/3474717.3483926","DOIUrl":"https://doi.org/10.1145/3474717.3483926","url":null,"abstract":"Transportation between satellite cities or inside the city center has always been a crucial factor in contributing to a better quality of life. This paper focuses on a multi-criteria distributed competitive route planning for parking slot cruising in regions where neither real-time nor historical availability of parking slots is accessible. An inference-than-planning framework is proposed for solving the parking slot searching using a zero-information distributed model with an availability inference for parking slots in areas with no sensor coverage. Meanwhile, a proposed Conntrans algorithm is suggested as a two-stage structure with three relaxing policies: adjacent cruising, on-orbital annealing, and orbital transitioning. The evaluation is conducted based on the simulation in a publicly accessible real-world parking data from SFPark in San Francisco; the area is divided into 3 separated regions with different urban characteristics. Overall results show that the proposed availability inference model can retrieve decent performance. Furthermore, Conntrans is able to outperform baselines and state-of-the-arts in overall score by at most 77% with a success rate at around 97% and maintains the quality of solutions under various circumstances.","PeriodicalId":340759,"journal":{"name":"Proceedings of the 29th International Conference on Advances in Geographic Information Systems","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-11-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114759705","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}
Yang Zhen, Masato Sugasaki, Y. Kawahara, K. Tsubouchi, Matthew Ishige, M. Shimosaka
{"title":"AI-BPO: Adaptive incremental BLE beacon placement optimization for crowd density monitoring applications","authors":"Yang Zhen, Masato Sugasaki, Y. Kawahara, K. Tsubouchi, Matthew Ishige, M. Shimosaka","doi":"10.1145/3474717.3483964","DOIUrl":"https://doi.org/10.1145/3474717.3483964","url":null,"abstract":"With the pandemic of COVID-19, indoor crowd density monitoring has become one of the most critical responsibilities of public space managers. Beacon placement optimization has been tackled as fundamental research work as the performance of crowd density monitoring highly depends on how BLE beacons are allocated. In this research, we propose a novel beacon placement optimization approach to incrementally place the beacon on the updated detection status adaptively in favor of Bayesian optimization, which can help to provide the optimal beacon placement. Our proposed method can optimize the beacon placement effectively to improve the signal coverage quality in the given environment and minimize human workload.","PeriodicalId":340759,"journal":{"name":"Proceedings of the 29th International Conference on Advances in Geographic Information Systems","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-11-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124128760","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}
{"title":"Disaster Damage Estimation from Real-time Population Dynamics using Graph Convolutional Network (Industrial Paper)","authors":"Keiichi Ochiai, Hiroto Akatsuka, Wataru Yamada, Masayuki Terada","doi":"10.1145/3474717.3483972","DOIUrl":"https://doi.org/10.1145/3474717.3483972","url":null,"abstract":"Storm and flood disasters such as typhoons and torrential rains are becoming more intense and frequent. The national government and municipalities must respond to such natural disasters as soon as possible. When the scale of damage is large; however, it takes much time to investigate the severity of damage, and the initial response can be delayed. If we could precisely and rapidly estimate the severity of damage for each city at an early stage, the national government would be able to better support the municipalities, and consequently respond quickly to help citizens. In this paper, we propose a novel approach to estimate the severity of disaster damage within a short time period after a disaster occurs by exploiting real-time population data generated from cellular networks. First, we investigate the relationship between real-time population data and the severity of damage. Then, we design a Graph Convolutional Networks for Disaster Damage Estimation, called D2E-GCN, which fully exploits the directed and weighted characteristics of human mobility graph. We conduct an offline evaluation on real-world datasets including two typhoons that hit Japan. The evaluation results show that the proposed method outperforms baseline methods which do not consider the graph structure of cities, and the proposed method can estimate the severity of damage approximately 48 hours after typhoons passed. Moreover, we find the experimental insight that the estimation performance can be significantly affected by the graph construction method for GCN models.","PeriodicalId":340759,"journal":{"name":"Proceedings of the 29th International Conference on Advances in Geographic Information Systems","volume":"414 18","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-11-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120936156","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}
{"title":"Tiering in Contraction and Edge Hierarchies for Stochastic Route Planning","authors":"Payas Rajan, C. Ravishankar","doi":"10.1145/3474717.3484267","DOIUrl":"https://doi.org/10.1145/3474717.3484267","url":null,"abstract":"Stochastic route planning is a hard problem, since it deals with uncertain edge weights, usually modeled as probability distributions. Stochastic shortest path queries are very expensive, as they must compute convolutions of edge weight distributions, whose representations can have a major impact on query costs. Effective speedup techniques for shortest path queries exist for deterministic edge weights, but their extensions to stochastic settings have had limited success, and real-time stochastic routing queries remain beyond reach. We introduce the tiering technique for Contraction and Edge Hierarchies (CHs and EHs) to address this challenge. We divide the hierarchy into tiers, and represent edge weights in each tier in ways that permit effective tradeoffs between accuracy, convolution costs, and space use. We show how to use Gaussians to approximate histograms, and bound errors using the KL divergence and Hellinger distance measures. We develop Uncertain Contraction Hierarchies (UCHs) and Uncertain Edge Hierarchies (UEHs) using these methods, and show that they improve both CH and EH performance for three different stochastic query types: probabilistic budget routes, non-dominated routes, and routes to minimize the mean-risk objective. We evaluate our methods using real-world data from Mapbox Traffic Data for a section of Los Angeles. Finally, our results show that query times for EHs can be competitive with CHs for stochastic edge weights, contrary to current belief.","PeriodicalId":340759,"journal":{"name":"Proceedings of the 29th International Conference on Advances in Geographic Information Systems","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-11-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132696642","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}
{"title":"SRC: Incorporating Geographic Information for Building a Location-based Recommendation System","authors":"Yuankun Jiao, Yao-Yi Chiang","doi":"10.1145/3474717.3486811","DOIUrl":"https://doi.org/10.1145/3474717.3486811","url":null,"abstract":"This study proposes a novel approach for location recommendation based on content-based recommendation algorithms incorporated with geographic information. The study also analyzes the impact of various dimension reduction (DR) methods on the recommendation quality using various baseline approaches. The experiment demonstrates that the proposed approach to content-based location recommendations is feasible and valuable, with potentials for further research.","PeriodicalId":340759,"journal":{"name":"Proceedings of the 29th International Conference on Advances in Geographic Information Systems","volume":"85 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-11-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132019527","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}
{"title":"Discovering Mixture-Based Best Regions of Arbitrary Shapes","authors":"Dimitrios Skoutas, Dimitris Sacharidis, Kostas Patroumpas","doi":"10.1145/3474717.3484215","DOIUrl":"https://doi.org/10.1145/3474717.3484215","url":null,"abstract":"Given a collection of geospatial points of different types, mixture-based best region search aims at discovering spatial regions exhibiting either very high or very low mixture with respect to the types of enclosed points. Existing works detect fixed-shape regions, such as circles or rectangles, thus often missing interesting regions occurring in real-world data that may have arbitrary shapes. In this paper, we formulate the problem of mixture-based best region search for arbitrarily shaped regions, introducing certain desired properties to ensure their cohesiveness and completeness. Since computing exact solutions to this problem has exponential cost with respect to the number of points, we propose anytime algorithms that efficiently search the space of candidate solutions to produce high-scoring regions under any given time budget. Our experiments on several real-world datasets show that our algorithms can produce high-quality results even within tight time constraints.","PeriodicalId":340759,"journal":{"name":"Proceedings of the 29th International Conference on Advances in Geographic Information Systems","volume":"141 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-11-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133488813","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}
{"title":"Travel Time Estimation Based on Neural Network with Auxiliary Loss","authors":"Yunchong Gan, Haoyu Zhang, Mingjie Wang","doi":"10.1145/3474717.3488238","DOIUrl":"https://doi.org/10.1145/3474717.3488238","url":null,"abstract":"Estimated Time of Arrival (ETA) plays an important role in various applications, for instance, scene of order dispatch, estimate price, travel time prediction, route decision, etc. In this project, we propose a new systematical Wide-Deep-Double-Recurrent model with Auxiliary loss (WDDRA), which involves Auxiliary Loss for Link Current Status prediction task. Our extensive evaluations show that WDDRA significantly outperforms the state-of-the-art learning algorithms. And our final ensemble model wins second place on the SIGSPATIAL 2021 GISCUP leaderboard without data augmentation. Our source code is available at:https://github.com/Phimos/SIGSPATIAL-2021-GISCUP-2nd-Place-Solution","PeriodicalId":340759,"journal":{"name":"Proceedings of the 29th International Conference on Advances in Geographic Information Systems","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-11-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127637840","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}
Solomiia Kurchaba, J. Vliet, J. Meulman, F. Verbeek, C. Veenman
{"title":"Improving evaluation of NO2 emission from ships using spatial association on TROPOMI satellite data","authors":"Solomiia Kurchaba, J. Vliet, J. Meulman, F. Verbeek, C. Veenman","doi":"10.1145/3474717.3484213","DOIUrl":"https://doi.org/10.1145/3474717.3484213","url":null,"abstract":"As of 2021, more demanding NOx emission requirements entered into force for newly built ships operating on the North and Baltic Sea. Even though various methods are used to assess ships' pollution in ports and off the coastal areas, monitoring over the open sea has been infeasible until now. In this work, we present a novel automated method for evaluation of NO2 emissions produced by individual seagoing ships. We use the spatial association statistic local Moran's I in order to improve the distinguishability between the plume and the background. Using the Automatic Identification Signal (AIS) data of ship locations as well as incorporated uncertainties in wind speed and wind direction, we automatically associate the detected plumes with individual ships. We evaluate the quality of ship-plume matching by calculating the Pearson correlation coefficient between the values of a model-based emission proxy and the estimated NO2 concentrations. For five of the six analyzed areas, our method yields results that are an improvement over the baseline approach used in a previous study.","PeriodicalId":340759,"journal":{"name":"Proceedings of the 29th International Conference on Advances in Geographic Information Systems","volume":"73 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-11-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124697315","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}
Joseph Boulis, Mohamed Hemdan, A. Shokry, Maged A. Youssef
{"title":"Data Augmentation using GANs for Deep Learning-based Localization Systems","authors":"Joseph Boulis, Mohamed Hemdan, A. Shokry, Maged A. Youssef","doi":"10.1145/3474717.3486807","DOIUrl":"https://doi.org/10.1145/3474717.3486807","url":null,"abstract":"Recently, deep learning-based localization systems have become one of the most promising techniques due to their accuracy in complex environments. However, these techniques require large amounts of data for training. Obtaining such data is usually a tedious and time-consuming process, which hinders their practical deployment. In this paper, we propose a data augmentation framework for deep learning-based localization systems. The basic idea is to use a conditional Generative Adversarial Network that is able to learn the complex structures in the original training data and then generate high-quality synthetic data that matches the original data distribution. Evaluation of the proposed data augmentation framework in a real testbed shows that our technique can increase the average localization accuracy by 22.2% compared to the case of not using data augmentation. This demonstrates the promise of the proposed framework for enhancing deep learning-based localization systems.","PeriodicalId":340759,"journal":{"name":"Proceedings of the 29th International Conference on Advances in Geographic Information Systems","volume":"87 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-11-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124997889","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}
{"title":"Ovid: A Machine Learning Approach for Automated Vandalism Detection in OpenStreetMap","authors":"Nicolas Tempelmeier, Elena Demidova","doi":"10.1145/3474717.3484204","DOIUrl":"https://doi.org/10.1145/3474717.3484204","url":null,"abstract":"OpenStreetMap is a unique source of openly available worldwide map data, increasingly adopted in real-world applications. Vandalism detection in OpenStreetMap is critical and remarkably challenging due to the large scale of the dataset, the sheer number of contributors, various vandalism forms, and the lack of annotated data to train machine learning algorithms. This paper presents Ovid - a novel machine learning method for vandalism detection in OpenStreetMap. Ovid relies on a neural network architecture that adopts a multi-head attention mechanism to effectively summarize information indicating vandalism from OpenStreetMap changesets. To facilitate automated vandalism detection, we introduce a set of original features that capture changeset, user, and edit information. Our evaluation results on real-world vandalism data demonstrate that the proposed Ovid method outperforms the baselines by 4.7 percentage points in accuracy.","PeriodicalId":340759,"journal":{"name":"Proceedings of the 29th International Conference on Advances in Geographic Information Systems","volume":"812 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-11-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117054569","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}