Significant achievements have been attained in the field of dense stereo correspondence by local algorithms based on an adaptive support. Given the problem of matching two correspondent pixels within a local stereo process, the basic idea is to consider as support for each pixel only those points which lay on the same disparity plane, rather than those belonging to a fixed support. This paper proposes a novel support aggregation strategy which includes information obtained from a segmentation process. Experimental results on the Middlebury dataset demonstrate that our approach is effective in improving the state of the art. © Springer-Verlag Berlin Heidelberg 2007.
CITATION STYLE
Tombari, F., Mattoccia, S., & Stefano, L. D. (2007). Segmentation-based adaptive support for accurate stereo correspondence. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4872 LNCS, pp. 427–438). Springer Verlag. https://doi.org/10.1007/978-3-540-77129-6_38
Mendeley helps you to discover research relevant for your work.