dc.contributor.author | Guerra-Filho, Gutemberg | |
dc.contributor.author | Aloimonos, Yiannis | |
dc.date.accessioned | 2006-12-12T20:05:50Z | |
dc.date.available | 2006-12-12T20:05:50Z | |
dc.date.issued | 2003-10-06 | |
dc.identifier.uri | http://hdl.handle.net/1903/4014 | |
dc.description.abstract | An 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.extent | 362479 bytes | |
dc.format.mimetype | application/pdf | |
dc.language.iso | en_US | en |
dc.relation.ispartofseries | UM Computer Science Department | en |
dc.relation.ispartofseries | CS-TR-4839 | en |
dc.title | An Optimal Time-Space Algorithm for Dense Stereo Matching | en |
dc.type | Technical Report | en |