Realtime Dense Stereo Matching with Dynamic Programming in CUDA

Simple item page
dc.contributor.authorCongote, Johnen_US
dc.contributor.authorBarandiaran, Javieren_US
dc.contributor.authorBarandiaran, IƱigoen_US
dc.contributor.authorRuiz, Oscaren_US
dc.contributor.editorCarlos Andujar and Javier Lluchen_US
dc.date.accessioned2014-01-27T08:16:24Z
dc.date.available2014-01-27T08:16:24Z
dc.date.issued2009en_US
dc.description.abstractReal-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.en_US
dc.description.seriesinformationCEIG 09 - Congreso Espanol de Informatica Graficaen_US
dc.identifier.isbn978-3-905673-72-2en_US
dc.identifier.urihttps://doi.org/10.2312/LocalChapterEvents/CEIG/CEIG09/231-234en_US
dc.publisherThe Eurographics Associationen_US
dc.subjectCategories and Subject Descriptors (according to ACM CCS): ARTIFICIAL INTELLIGENCE [Computing Methodologies]: I.2.10 Vision and Scene Understanding3D/stereo scene analysisen_US
dc.titleRealtime Dense Stereo Matching with Dynamic Programming in CUDAen_US
Files
Original bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
231-234.pdf
Size:
654.14 KB
Format:
Adobe Portable Document Format
Download
Collections
CEIG09