An iterative framework with active learning to match segments in road networks

IF 2.6 3区 地球科学 Q1 GEOGRAPHY Cartography and Geographic Information Science Pub Date : 2023-04-11 DOI:10.1080/15230406.2023.2190935
Wenhao Yu, Mengqi Liu
{"title":"An iterative framework with active learning to match segments in road networks","authors":"Wenhao Yu, Mengqi Liu","doi":"10.1080/15230406.2023.2190935","DOIUrl":null,"url":null,"abstract":"ABSTRACT Road network matching that detects arc-to-arc relations is a crucial prerequisite for the update of road data. The increasing complexity of multi-source and multi-scale road network data challenges the existing methods on accuracy and efficiency. This paper focuses on the interactive-based probabilistic relaxation approach. It is difficult to obtain satisfactory results by using completely automatic matching algorithm in some complicated road networks such as multi-lane carriageways. We try to improve the matching accuracy by combining optimization matching model with manual interaction. The method uses the module of active learning to construct unlabeled sample pool from preliminary matching of probabilistic relaxation, and then selects the arcs with the highest uncertainty by query function. The selected road is then handed over to humans to determine its arc-to-arc relations in the other road network. Finally, the matching parameters are automatically adjusted according to the user’s feedback information, so as to realize the dynamic optimization of the model. Our interaction method is efficient as it only needs to specify few arc-to-arc mappings and others can be amended automatically. Our experimental results reveal that active learning can substantially improve the performance of standard probabilistic relaxation algorithms in road network matching.","PeriodicalId":47562,"journal":{"name":"Cartography and Geographic Information Science","volume":"50 1","pages":"333 - 350"},"PeriodicalIF":2.6000,"publicationDate":"2023-04-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Cartography and Geographic Information Science","FirstCategoryId":"89","ListUrlMain":"https://doi.org/10.1080/15230406.2023.2190935","RegionNum":3,"RegionCategory":"地球科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"GEOGRAPHY","Score":null,"Total":0}
引用次数: 0

Abstract

ABSTRACT Road network matching that detects arc-to-arc relations is a crucial prerequisite for the update of road data. The increasing complexity of multi-source and multi-scale road network data challenges the existing methods on accuracy and efficiency. This paper focuses on the interactive-based probabilistic relaxation approach. It is difficult to obtain satisfactory results by using completely automatic matching algorithm in some complicated road networks such as multi-lane carriageways. We try to improve the matching accuracy by combining optimization matching model with manual interaction. The method uses the module of active learning to construct unlabeled sample pool from preliminary matching of probabilistic relaxation, and then selects the arcs with the highest uncertainty by query function. The selected road is then handed over to humans to determine its arc-to-arc relations in the other road network. Finally, the matching parameters are automatically adjusted according to the user’s feedback information, so as to realize the dynamic optimization of the model. Our interaction method is efficient as it only needs to specify few arc-to-arc mappings and others can be amended automatically. Our experimental results reveal that active learning can substantially improve the performance of standard probabilistic relaxation algorithms in road network matching.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于主动学习的道路网络分段匹配迭代框架
检测圆弧间关系的道路网络匹配是道路数据更新的关键前提。多源多尺度路网数据日益复杂,对现有方法的准确性和效率提出了挑战。本文主要研究基于交互的概率松弛方法。在多车道等复杂的道路网络中,采用完全自动匹配算法很难获得满意的结果。我们试图通过将优化匹配模型与人工交互相结合来提高匹配精度。该方法利用主动学习模块从概率松弛的初步匹配中构建未标记样本库,然后通过查询函数选择不确定性最高的弧。然后将选定的道路移交给人类,以确定其在另一道路网络中的弧对弧关系。最后,根据用户的反馈信息自动调整匹配参数,实现模型的动态优化。我们的交互方法是有效的,因为它只需要指定几个弧到弧的映射,其他映射可以自动修改。我们的实验结果表明,主动学习可以显著提高标准概率松弛算法在道路网络匹配中的性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
CiteScore
5.20
自引率
20.00%
发文量
23
期刊介绍: Cartography and Geographic Information Science (CaGIS) is the official publication of the Cartography and Geographic Information Society (CaGIS), a member organization of the American Congress on Surveying and Mapping (ACSM). The Cartography and Geographic Information Society supports research, education, and practices that improve the understanding, creation, analysis, and use of maps and geographic information. The society serves as a forum for the exchange of original concepts, techniques, approaches, and experiences by those who design, implement, and use geospatial technologies through the publication of authoritative articles and international papers.
期刊最新文献
Dimensions of Uncertainty: A spatiotemporal review of five COVID-19 datasets. Algorithmic uncertainties in geolocating social media data for disaster management A study on the aptitude of color hue, value, and transparency for geographic relevance encoding in mobile maps Trust in maps: what we know and what we need to know Using machine learning and data enrichment in the selection of roads for small-scale maps
×
引用
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