A robust road segmentation method based on graph cut with learnable neighboring link weights | |
Jun Yuan1; Shuming Tang2; Fei Wang3; H. Zhang | |
2014 | |
会议名称 | 17th International IEEE Conference on Intelligent Transportation Systems |
会议日期 | 2014 |
会议地点 | Qingdao, China |
摘要 | Road region detection is a crucial functionality for road following in advanced driver assistance systems (ADAS). To address the problem of environment interference in road segmentation through a monocular vision approach, a novel graph-cut based method is proposed in this paper. The novelty of this proposal is that weights of neighboring links (n-links) in a s-t graph are estimated by Multilayer Perceptrons (MLPs) rather than calculating by the neighboring contrast simply in previous graph-cut based methods. Estimating n-link weights by MLPs reinforces the ability of graph-cut based road segmentation algorithms to tolerate the complex and changeable appearance of road surfaces. Additionally, the Gentle AdaBoost algorithm is integrated into the graph-cut framework to estimate the terminal link (t-link) weights in the s-t graph. Experiments are conducted to show the robustness and efficiency of the proposed method. |
关键词 | Road Segmentation, learnable neighboring link weights, advanced driver assistance systems, monocular vision |
收录类别 | EI |
语种 | 英语 |
文献类型 | 会议论文 |
条目标识符 | http://ir.ia.ac.cn/handle/173211/41450 |
专题 | 智能制造技术与系统研究中心 |
作者单位 | 1.State Key Laboratory of Management and Control for Complex Systems, Chinese Academy of Sciences, Beijing, China 2.High-Tech Innovation Engineering Center, Chinese Academy of Sciences, Beijing, China 3.School of Information Engineering, Minzu University of China, Beijing, China |
推荐引用方式 GB/T 7714 | Jun Yuan,Shuming Tang,Fei Wang,et al. A robust road segmentation method based on graph cut with learnable neighboring link weights[C],2014. |
条目包含的文件 | 下载所有文件 | |||||
文件名称/大小 | 文献类型 | 版本类型 | 开放类型 | 使用许可 | ||
06957929.pdf(1789KB) | 会议论文 | 开放获取 | CC BY-NC-SA | 浏览 下载 |
除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。
修改评论