Abstract
A novel stereo matching algorithm is proposed that utilizes color segmentation on the reference image and a self-adapting matching score that maximizes the number of reliable correspondences. The scene structure is modeled by a set of planar surface patches which are estimated using a new technique that is more robust to outliers. Instead of assigning a disparity value to each pixel, a disparity plane is assigned to each segment. The optimal disparity plane labeling is approximated by applying belief propagation. Experimental results using the Middlebury stereo test bed demonstrate the superior performance of the proposed method. © 2006 IEEE.
Cite
CITATION STYLE
Klaus, A., Sormann, M., & Karner, K. (2006). Segment-based stereo matching using belief propagation and a self-adapting dissimilarity measure. In Proceedings - International Conference on Pattern Recognition (Vol. 3, pp. 15–18). https://doi.org/10.1109/ICPR.2006.1033
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.