An Optimal Time-Space Algorithm for Dense Stereo Matching

Simple item page
dc.contributor.authorGuerra-Filho, Gutemberg
dc.contributor.authorAloimonos, Yiannis
dc.date.accessioned2006-12-12T20:05:50Z
dc.date.available2006-12-12T20:05:50Z
dc.date.issued2003-10-06
dc.description.abstractAn original survey addressing time-space complexity covers several stereo matching algorithms and running time experiments are reported. Taking the point of view that good reconstruction needs to be solved in feedback loops, we then present a new dense stereo matching based on a path computation in disparity space. A procedure which improves disparity maps is also introduced as a post-processing step for any technique solving a dense stereo matching problem. Compared to other algorithms, our algorithm has optimal time-space complexity. The algorithm is faster than "real-time" techniques while producing comparable results. The correctness of our algorithm is demonstrated by experiments in real and synthetic benchmark data.en
dc.format.extent362479 bytes
dc.format.mimetypeapplication/pdf
dc.identifier.urihttp://hdl.handle.net/1903/4014
dc.language.isoen_USen
dc.relation.ispartofseriesUM Computer Science Departmenten
dc.relation.ispartofseriesCS-TR-4839en
dc.titleAn Optimal Time-Space Algorithm for Dense Stereo Matchingen
dc.typeTechnical Reporten

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
Guerra-FilhoCS-TR-4839-2006optimal.pdf
Size:
353.98 KB
Format:
Adobe Portable Document Format
Download
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.81 KB
Format:
Item-specific license agreed upon to submission
Description:
Download

Collections

Technical Reports of the Computer Science Department