John Congote, Javier Barandiarán, I. Barandiaran, O. Ruiz
{"title":"基于CUDA动态规划的实时密集立体匹配","authors":"John Congote, Javier Barandiarán, I. Barandiaran, O. Ruiz","doi":"10.2312/LocalChapterEvents/CEIG/CEIG09/231-234","DOIUrl":null,"url":null,"abstract":"Real-time depth extraction from stereo images is an important process in computer vision. This paper proposes a new implementation of the dynamic programming algorithm to calculate dense depth maps using the CUDA architecture achieving real-time performance with consumer graphics cards. We compare the running time of the algorithm against CPU implementation and demonstrate the scalability property of the algorithm by testing it on different graphics cards.","PeriodicalId":385751,"journal":{"name":"Spanish Computer Graphics Conference","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"27","resultStr":"{\"title\":\"Realtime Dense Stereo Matching with Dynamic Programming in CUDA\",\"authors\":\"John Congote, Javier Barandiarán, I. Barandiaran, O. Ruiz\",\"doi\":\"10.2312/LocalChapterEvents/CEIG/CEIG09/231-234\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Real-time depth extraction from stereo images is an important process in computer vision. This paper proposes a new implementation of the dynamic programming algorithm to calculate dense depth maps using the CUDA architecture achieving real-time performance with consumer graphics cards. We compare the running time of the algorithm against CPU implementation and demonstrate the scalability property of the algorithm by testing it on different graphics cards.\",\"PeriodicalId\":385751,\"journal\":{\"name\":\"Spanish Computer Graphics Conference\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1900-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"27\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Spanish Computer Graphics Conference\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.2312/LocalChapterEvents/CEIG/CEIG09/231-234\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Spanish Computer Graphics Conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.2312/LocalChapterEvents/CEIG/CEIG09/231-234","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Realtime Dense Stereo Matching with Dynamic Programming in CUDA
Real-time depth extraction from stereo images is an important process in computer vision. This paper proposes a new implementation of the dynamic programming algorithm to calculate dense depth maps using the CUDA architecture achieving real-time performance with consumer graphics cards. We compare the running time of the algorithm against CPU implementation and demonstrate the scalability property of the algorithm by testing it on different graphics cards.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
