{"title":"道路应用的时间一致立体匹配方法","authors":"L. Koutti, Ilyas El Jaafari, Mohamed El Ansari","doi":"10.1109/AICCSA.2016.7945780","DOIUrl":null,"url":null,"abstract":"In this paper, we present a fast approach for matching stereo images acquired by a stereo sensor embedded in a moving vehicle. The proposed approach exploits the disparity map already computed at the preceding frame to improve the matching results at the current one. An edge association method is used to track the edge curves over time. Local disparity constraints are computed for all the edge points that belong to the tracked edge curves. For the rest of edge points, we use a global disparity constraint, which is computed for each image line based on the preceding v-disparity. We integrate these constraints in the dynamic programming algorithm, which increases the matching results and speeds up the matching process.","PeriodicalId":448329,"journal":{"name":"2016 IEEE/ACS 13th International Conference of Computer Systems and Applications (AICCSA)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"Temporal consistent stereo matching approach for road applications\",\"authors\":\"L. Koutti, Ilyas El Jaafari, Mohamed El Ansari\",\"doi\":\"10.1109/AICCSA.2016.7945780\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we present a fast approach for matching stereo images acquired by a stereo sensor embedded in a moving vehicle. The proposed approach exploits the disparity map already computed at the preceding frame to improve the matching results at the current one. An edge association method is used to track the edge curves over time. Local disparity constraints are computed for all the edge points that belong to the tracked edge curves. For the rest of edge points, we use a global disparity constraint, which is computed for each image line based on the preceding v-disparity. We integrate these constraints in the dynamic programming algorithm, which increases the matching results and speeds up the matching process.\",\"PeriodicalId\":448329,\"journal\":{\"name\":\"2016 IEEE/ACS 13th International Conference of Computer Systems and Applications (AICCSA)\",\"volume\":\"10 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2016-11-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2016 IEEE/ACS 13th International Conference of Computer Systems and Applications (AICCSA)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/AICCSA.2016.7945780\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 IEEE/ACS 13th International Conference of Computer Systems and Applications (AICCSA)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/AICCSA.2016.7945780","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Temporal consistent stereo matching approach for road applications
In this paper, we present a fast approach for matching stereo images acquired by a stereo sensor embedded in a moving vehicle. The proposed approach exploits the disparity map already computed at the preceding frame to improve the matching results at the current one. An edge association method is used to track the edge curves over time. Local disparity constraints are computed for all the edge points that belong to the tracked edge curves. For the rest of edge points, we use a global disparity constraint, which is computed for each image line based on the preceding v-disparity. We integrate these constraints in the dynamic programming algorithm, which increases the matching results and speeds up the matching process.