RoadRouter: Multi-Task Learning of Road Network Extraction with Graph Representation

Shicheng Zu, LinTao Wan, Dong Li, Zhongfeng Qiu
{"title":"RoadRouter: Multi-Task Learning of Road Network Extraction with Graph Representation","authors":"Shicheng Zu, LinTao Wan, Dong Li, Zhongfeng Qiu","doi":"10.1109/CTISC49998.2020.00031","DOIUrl":null,"url":null,"abstract":"Since most state-of-the-art road mappers pose the road network extraction as a binary segmentation trained on the RGB dataset, our proposed ‘RoadRouter’ system pushes the frontier by classifying the roads into seven categories based on the SpaceNet annotations. Our system is built with the Red/Near-Infrared dataset, making use of the asphalt’s spectral signature to differentiate roads from other influential noises. For addressing the disconnected road gaps problem, we propose the stacked hourglass network with dual supervision. Inspired by the human behavior of tracing the road networks via a constant orientation, incorporating the orientation learning as auxiliary loss leads to more robust and synergistic representations favorable for road connectivity refinement. The intermediate supervision provided by stacking the hourglass modules successively also serves as a connectivity refinement mechanism. In the case of modeling the long-range interaction among the per-pixel predictions, the traditional color-based appearance kernel is not useful in CRF post-processing. We propose the pixel-wise orientation CRF specific for bridging the fragmented road segments. We also formalize an image transformation protocol to parse the topology from the road segmentation. The undirected closed graphs can thereby be constructed from probabilistic inferences. Various graph-based algorithms, e.g., the shortest path searching, can be implemented on the road graph representations.","PeriodicalId":266384,"journal":{"name":"2020 2nd International Conference on Advances in Computer Technology, Information Science and Communications (CTISC)","volume":"62 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2020 2nd International Conference on Advances in Computer Technology, Information Science and Communications (CTISC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CTISC49998.2020.00031","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

Abstract

Since most state-of-the-art road mappers pose the road network extraction as a binary segmentation trained on the RGB dataset, our proposed ‘RoadRouter’ system pushes the frontier by classifying the roads into seven categories based on the SpaceNet annotations. Our system is built with the Red/Near-Infrared dataset, making use of the asphalt’s spectral signature to differentiate roads from other influential noises. For addressing the disconnected road gaps problem, we propose the stacked hourglass network with dual supervision. Inspired by the human behavior of tracing the road networks via a constant orientation, incorporating the orientation learning as auxiliary loss leads to more robust and synergistic representations favorable for road connectivity refinement. The intermediate supervision provided by stacking the hourglass modules successively also serves as a connectivity refinement mechanism. In the case of modeling the long-range interaction among the per-pixel predictions, the traditional color-based appearance kernel is not useful in CRF post-processing. We propose the pixel-wise orientation CRF specific for bridging the fragmented road segments. We also formalize an image transformation protocol to parse the topology from the road segmentation. The undirected closed graphs can thereby be constructed from probabilistic inferences. Various graph-based algorithms, e.g., the shortest path searching, can be implemented on the road graph representations.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
RoadRouter:基于图表示的道路网络提取的多任务学习
由于大多数最先进的道路绘制器将道路网络提取作为在RGB数据集上训练的二值分割,我们提出的“RoadRouter”系统通过基于SpaceNet注释将道路分为七类来推动前沿。我们的系统是基于红/近红外数据集构建的,利用沥青的光谱特征来区分道路和其他有影响的噪音。为了解决道路缝隙不连通的问题,我们提出了具有双重监督的叠加沙漏网络。受人类通过恒定方向跟踪道路网络的行为的启发,将方向学习作为辅助损失结合起来,可以产生更稳健和协同的表征,有利于道路连通性的改进。通过将沙漏模块依次堆叠提供的中间监督也可作为连通性优化机制。在对每像素预测之间的远程交互建模的情况下,传统的基于颜色的外观核在CRF后处理中是无用的。我们提出了像素方向的CRF,专门用于桥接破碎的道路段。我们还形式化了一种图像转换协议来解析道路分割的拓扑结构。因此,无向闭图可以由概率推断构造。各种基于图的算法,例如最短路径搜索,可以在道路图表示上实现。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Neurons identification of single-photon wide-field calcium fluorescent imaging data CTISC 2020 List Reviewer Page CTISC 2020 Commentary Image data augmentation method based on maximum activation point guided erasure Sponsors and Supporters: CTISC 2020
×
引用
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