A Map-matching Algorithm with Extraction of Multi-group Information for Low-frequency Data

• URL: http://arxiv.org/abs/2209.08500v1
• Date: Sun, 18 Sep 2022 08:09:17 GMT
• Title: A Map-matching Algorithm with Extraction of Multi-group Information for Low-frequency Data
• Authors: Jie Fang, Xiongwei Wu, Dianchao Lin, Mengyun Xu, Huahua Wu, Xuesong Wu and Ting Bi
• Abstract summary: This paper designs a new map-matching method to make full use of "Big data" We sort all data into four groups according to their spatial and temporal distance from the present matching probe. We use a modified top-K shortest-path method to search the candidate paths within an ellipse region and then use the fused score to infer the path.
• Score: 9.476212160807549
• License: http://creativecommons.org/licenses/by-nc-nd/4.0/
• Abstract: The growing use of probe vehicles generates a huge number of GNSS data. Limited by the satellite positioning technology, further improving the accuracy of map-matching is challenging work, especially for low-frequency trajectories. When matching a trajectory, the ego vehicle's spatial-temporal information of the present trip is the most useful with the least amount of data. In addition, there are a large amount of other data, e.g., other vehicles' state and past prediction results, but it is hard to extract useful information for matching maps and inferring paths. Most map-matching studies only used the ego vehicle's data and ignored other vehicles' data. Based on it, this paper designs a new map-matching method to make full use of "Big data". We first sort all data into four groups according to their spatial and temporal distance from the present matching probe which allows us to sort for their usefulness. Then we design three different methods to extract valuable information (scores) from them: a score for speed and bearing, a score for historical usage, and a score for traffic state using the spectral graph Markov neutral network. Finally, we use a modified top-K shortest-path method to search the candidate paths within an ellipse region and then use the fused score to infer the path (projected location). We test the proposed method against baseline algorithms using a real-world dataset in China. The results show that all scoring methods can enhance map-matching accuracy. Furthermore, our method outperforms the others, especially when GNSS probing frequency is less than 0.01 Hz.

Related papers

• Inferring Neural Signed Distance Functions by Overfitting on Single Noisy Point Clouds through Finetuning Data-Driven based Priors [53.6277160912059]
  We propose a method to promote pros of data-driven based and overfitting-based methods for better generalization, faster inference, and higher accuracy in learning neural SDFs. We introduce a novel statistical reasoning algorithm in local regions which is able to finetune data-driven based priors without signed distance supervision, clean point cloud, or point normals.
  arXiv  Detail & Related papers  (2024-10-25T16:48:44Z)
• Minimally Supervised Learning using Topological Projections in Self-Organizing Maps [55.31182147885694]
  We introduce a semi-supervised learning approach based on topological projections in self-organizing maps (SOMs) Our proposed method first trains SOMs on unlabeled data and then a minimal number of available labeled data points are assigned to key best matching units (BMU) Our results indicate that the proposed minimally supervised model significantly outperforms traditional regression techniques.
  arXiv  Detail & Related papers  (2024-01-12T22:51:48Z)
• Radio Map Estimation -- An Open Dataset with Directive Transmitter Antennas and Initial Experiments [49.61405888107356]
  We release a dataset of simulated path loss radio maps together with realistic city maps from real-world locations and aerial images from open datasources. Initial experiments regarding model architectures, input feature design and estimation of radio maps from aerial images are presented.
  arXiv  Detail & Related papers  (2024-01-12T14:56:45Z)
• Performance Evaluation of GPS Trajectory Rasterization Methods [0.0]
  GPS trajectory is an important data source which is used in traffic density detection, transport mode detection, mapping data. While the data size increases, efficient representation of this type of data is becoming difficult to be used in these methods. In this study, we evaluate GPS data trajectoryization using the spatial join functions of QGIS, PostGIS+QGIS, and our structured grid implementation coded in the Python programming language.
  arXiv  Detail & Related papers  (2024-01-03T11:25:11Z)
• Automated classification of pre-defined movement patterns: A comparison between GNSS and UWB technology [55.41644538483948]
  Real-time location systems (RTLS) allow for collecting data from human movement patterns. The current study aims to design and evaluate an automated framework to classify human movement patterns in small areas.
  arXiv  Detail & Related papers  (2023-03-10T14:46:42Z)
• Improving Fuzzy-Logic based Map-Matching Method with Trajectory Stay-Point Detection [3.093890460224435]
  Most GPS trajectory datasets include stay-points irregularity, which makes map-matching algorithms mismatch trajectories to irrelevant streets. We cluster stay-points in a trajectory dataset with DBSCAN and eliminate redundant data to improve the efficiency of the map-matching algorithm. Our approach yields 27.39% data size reduction and 8.9% processing time reduction with the same accurate results as the previous fuzzy-logic based map-matching approach.
  arXiv  Detail & Related papers  (2022-08-04T20:41:13Z)
• AutoGeoLabel: Automated Label Generation for Geospatial Machine Learning [69.47585818994959]
  We evaluate a big data processing pipeline to auto-generate labels for remote sensing data. We utilize the big geo-data platform IBM PAIRS to dynamically generate such labels in dense urban areas.
  arXiv  Detail & Related papers  (2022-01-31T20:02:22Z)
• Topo-boundary: A Benchmark Dataset on Topological Road-boundary Detection Using Aerial Images for Autonomous Driving [11.576868193291997]
  We propose a new benchmark dataset, named textitTopo-boundary, for off-line topological road-boundary detection. The dataset contains 21,556 $1000times1000$-sized 4-channel aerial images. We implement and evaluate 3 segmentation-based baselines and 5 graph-based baselines using the dataset.
  arXiv  Detail & Related papers  (2021-03-31T14:42:00Z)
• Automatic extraction of road intersection points from USGS historical map series using deep convolutional neural networks [0.0]
  Road intersections data have been used across different geospatial applications and analysis. We employed the standard paradigm of using deep convolutional neural network for object detection task named region-based CNN. Also, compared to the majority of traditional computer vision algorithms RCNN provides more accurate extraction.
  arXiv  Detail & Related papers  (2020-07-14T23:51:15Z)
• Road Network Metric Learning for Estimated Time of Arrival [93.0759529610483]
  In this paper, we propose the Road Network Metric Learning framework for Estimated Time of Arrival (ETA) It consists of two components: (1) a main regression task to predict the travel time, and (2) an auxiliary metric learning task to improve the quality of link embedding vectors. We show that our method outperforms the state-of-the-art model and the promotion concentrates on the cold links with few data.
  arXiv  Detail & Related papers  (2020-06-24T04:45:14Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.