{"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.