Online map-matching assisted by object-based classification of driving scenario

IF 4.3 1区 地球科学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS International Journal of Geographical Information Science Pub Date : 2023-05-08 DOI:10.1080/13658816.2023.2206877
Hangbin Wu, Sheng-Min Huang, Chen Fu, Sha Xu, Junhua Wang, Weizhou Huang, Chongxing Liu
{"title":"Online map-matching assisted by object-based classification of driving scenario","authors":"Hangbin Wu, Sheng-Min Huang, Chen Fu, Sha Xu, Junhua Wang, Weizhou Huang, Chongxing Liu","doi":"10.1080/13658816.2023.2206877","DOIUrl":null,"url":null,"abstract":"Abstract Different types of roads in complex road networks may run side-by-side or across in 2D or 3D spaces, which causes mismatched segments using existing online map-matching algorithms. A driving scenario that represents the driving environment can inform map-matching algorithms. Images from vehicle cameras contain extensive information about driving scenarios, such as surrounding key objects. This research utilized vehicle images and developed an object-based method to classify driving scenarios (Object-Based Driving-Scenario Classification: OBDSC) to calculate the probabilities of the current image in predefined types of driving scenarios. We implemented an online map-matching algorithm with the OBDSC method (OMM-OBDSC) to obtain optimal matching segments. The algorithm was tested on nine trajectories and OpenStreetMap data in Shanghai and compared with five benchmark algorithms in terms of the match rate, recall and accuracy. The OBDSC method is also applied to the benchmark algorithms to verify the effectiveness of map matching. The results show that our algorithm outperforms the benchmark algorithms with both the original interval and downsampled intervals (96.6%, 96.5%, 93.7% on average with 1–20 s intervals for the three metrics, respectively). The average match rate has improved by 8.9% for all benchmark algorithms after the addition of the OBDSC method.","PeriodicalId":14162,"journal":{"name":"International Journal of Geographical Information Science","volume":"37 1","pages":"1872 - 1907"},"PeriodicalIF":4.3000,"publicationDate":"2023-05-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Journal of Geographical Information Science","FirstCategoryId":"89","ListUrlMain":"https://doi.org/10.1080/13658816.2023.2206877","RegionNum":1,"RegionCategory":"地球科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0

Abstract

Abstract Different types of roads in complex road networks may run side-by-side or across in 2D or 3D spaces, which causes mismatched segments using existing online map-matching algorithms. A driving scenario that represents the driving environment can inform map-matching algorithms. Images from vehicle cameras contain extensive information about driving scenarios, such as surrounding key objects. This research utilized vehicle images and developed an object-based method to classify driving scenarios (Object-Based Driving-Scenario Classification: OBDSC) to calculate the probabilities of the current image in predefined types of driving scenarios. We implemented an online map-matching algorithm with the OBDSC method (OMM-OBDSC) to obtain optimal matching segments. The algorithm was tested on nine trajectories and OpenStreetMap data in Shanghai and compared with five benchmark algorithms in terms of the match rate, recall and accuracy. The OBDSC method is also applied to the benchmark algorithms to verify the effectiveness of map matching. The results show that our algorithm outperforms the benchmark algorithms with both the original interval and downsampled intervals (96.6%, 96.5%, 93.7% on average with 1–20 s intervals for the three metrics, respectively). The average match rate has improved by 8.9% for all benchmark algorithms after the addition of the OBDSC method.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于对象的驾驶场景分类辅助在线地图匹配
摘要复杂道路网络中不同类型的道路可能在二维或三维空间中并排或交叉行驶,这会导致使用现有在线地图匹配算法的路段不匹配。表示驾驶环境的驾驶场景可以通知地图匹配算法。来自车辆摄像头的图像包含有关驾驶场景的大量信息,例如周围的关键物体。本研究利用车辆图像,开发了一种基于对象的驾驶场景分类方法(object-based driving Scenario Classification:OBDSC),以计算当前图像在预定义类型的驾驶场景中的概率。我们使用OBDSC方法实现了一种在线地图匹配算法(OMM-OBDSC),以获得最佳匹配片段。该算法在上海的9个轨迹和OpenStreetMap数据上进行了测试,并与5个基准算法在匹配率、召回率和准确性方面进行了比较。OBDSC方法也被应用到基准算法中,以验证地图匹配的有效性。结果表明,我们的算法在原始区间和下采样区间方面都优于基准算法(1–20时平均为96.6%、96.5%、93.7% s间隔)。添加OBDSC方法后,所有基准算法的平均匹配率提高了8.9%。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
CiteScore
11.00
自引率
7.00%
发文量
81
审稿时长
9 months
期刊介绍: International Journal of Geographical Information Science provides a forum for the exchange of original ideas, approaches, methods and experiences in the rapidly growing field of geographical information science (GIScience). It is intended to interest those who research fundamental and computational issues of geographic information, as well as issues related to the design, implementation and use of geographical information for monitoring, prediction and decision making. Published research covers innovations in GIScience and novel applications of GIScience in natural resources, social systems and the built environment, as well as relevant developments in computer science, cartography, surveying, geography and engineering in both developed and developing countries.
期刊最新文献
GPU-accelerated parallel all-pair shortest path routing within stochastic road networks Collective flow-evolutionary patterns reveal the mesoscopic structure between snapshots of spatial network Geospatial foundation models for image analysis: evaluating and enhancing NASA-IBM Prithvi’s domain adaptability Translating street view imagery to correct perspectives to enhance bikeability and walkability studies A multi-view ensemble machine learning approach for 3D modeling using geological and geophysical data
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1