{"title":"Fusion of stereo and structure from motion for enhancing PatchMatch stereo","authors":"Claudiu Decean, S. Nedevschi","doi":"10.1109/ICCP.2015.7312627","DOIUrl":null,"url":null,"abstract":"The main issues with classic disparity estimation methods are the limitations of cost fitting for estimating subpixel disparity values and the frequent violations of the fronto-parallel assumption during support window matching. Modern stereo correspondence algorithms model the scene as a collection of 3D planes and estimate the real-valued parameters of each plane in order to obtain a more accurate disparity map. Such an algorithm is PatchMatch stereo that overcomes the problem of searching in an infinite, high dimensional solution space by efficiently traversing the space based on the assumption that planes are similar in a neighborhood region. This work presents a method that integrates structure from motion information with stereo for increasing the robustness of the original PatchMatch stereo method on difficult scenarios. Evaluations of our method on the HCI and Kitti datasets show that our method returns an accurate, denser disparity map.","PeriodicalId":158453,"journal":{"name":"2015 IEEE International Conference on Intelligent Computer Communication and Processing (ICCP)","volume":"55 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-11-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","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.7312627","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1
Abstract
The main issues with classic disparity estimation methods are the limitations of cost fitting for estimating subpixel disparity values and the frequent violations of the fronto-parallel assumption during support window matching. Modern stereo correspondence algorithms model the scene as a collection of 3D planes and estimate the real-valued parameters of each plane in order to obtain a more accurate disparity map. Such an algorithm is PatchMatch stereo that overcomes the problem of searching in an infinite, high dimensional solution space by efficiently traversing the space based on the assumption that planes are similar in a neighborhood region. This work presents a method that integrates structure from motion information with stereo for increasing the robustness of the original PatchMatch stereo method on difficult scenarios. Evaluations of our method on the HCI and Kitti datasets show that our method returns an accurate, denser disparity map.