Fast obstacle detection using U-disparity maps with stereo vision

F. Oniga, Ervin Sarkozi, S. Nedevschi
{"title":"Fast obstacle detection using U-disparity maps with stereo vision","authors":"F. Oniga, Ervin Sarkozi, S. Nedevschi","doi":"10.1109/ICCP.2015.7312630","DOIUrl":null,"url":null,"abstract":"This paper introduces a computationally efficient, approach for obstacle detection in driving assistance applications, based on stereovision. The proposed approach involves three different steps aiming an increased quality of the results. The first step relies on the basics: obstacles correspond to peak regions in the u-disparity map. By applying the model of the stereo system, the peaks are detected with an adaptive threshold. The adaptive thresholding will calculate the accumulation of points required for an obstacle based on its distance (disparity) and will be related to the characteristics of the stereovision system. The second and third steps consist of refining the result of the previous, vertically respectively horizontally. This is necessary in order to fill out unmarked pixel regions which are classified as belonging to obstacles. The second step iterates vertically and propagates the obstacle label to neighbor pixels. The third step improves obstacle regions horizontally, with points that do not belong to the road. The solution is fast and reliable, on various scenarios, as every step is an improvement of the standard U-disparity approach for obstacle detection.","PeriodicalId":158453,"journal":{"name":"2015 IEEE International Conference on Intelligent Computer Communication and Processing (ICCP)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-11-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 IEEE International Conference on Intelligent Computer Communication and Processing (ICCP)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCP.2015.7312630","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

This paper introduces a computationally efficient, approach for obstacle detection in driving assistance applications, based on stereovision. The proposed approach involves three different steps aiming an increased quality of the results. The first step relies on the basics: obstacles correspond to peak regions in the u-disparity map. By applying the model of the stereo system, the peaks are detected with an adaptive threshold. The adaptive thresholding will calculate the accumulation of points required for an obstacle based on its distance (disparity) and will be related to the characteristics of the stereovision system. The second and third steps consist of refining the result of the previous, vertically respectively horizontally. This is necessary in order to fill out unmarked pixel regions which are classified as belonging to obstacles. The second step iterates vertically and propagates the obstacle label to neighbor pixels. The third step improves obstacle regions horizontally, with points that do not belong to the road. The solution is fast and reliable, on various scenarios, as every step is an improvement of the standard U-disparity approach for obstacle detection.
快速障碍物检测使用u -视差地图与立体视觉
本文介绍了一种基于立体视觉的辅助驾驶障碍检测方法。提议的方法包括三个不同的步骤,旨在提高结果的质量。第一步依赖于基本原理:障碍物对应于u-视差图中的峰值区域。通过应用立体系统模型,采用自适应阈值检测峰值。自适应阈值将根据障碍物的距离(视差)计算障碍物所需的点数积累,并将与立体视觉系统的特性相关。第二步和第三步分别在垂直方向和水平方向对前一步的结果进行细化。这是必要的,以便填充归类为属于障碍物的未标记像素区域。第二步垂直迭代并将障碍物标签传播到相邻像素。第三步,用不属于道路的点水平地改善障碍区域。该解决方案在各种场景下都是快速可靠的,因为每一步都是对标准u -视差方法的改进。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信