Abstract
This paper presents a novel confidence-based surface prior for energy minimization formulations of dense stereo matching. Given a dense disparity estimation we fit planes, in disparity space, to regions of the image. For each pixel, the probability of its depth lying on an object plane is modeled as a Gaussian distribution, whose variance is determined using the confidence from a previous matching. We then recalculate a new disparity estimation with the addition of our novel confidence-based surface prior. The process is then repeated. Unlike many region-based methods, our method defines an energy formulation over pixels, instead of regions in a segmentation; this results in a decreased sensitivity to the quality of the initial segmentation. Our confidence-based surface prior differs from existing surface constraints in that it varies the per-pixel strength of the constraint to be proportional to the confidence in our given disparity estimation. The addition of our surface prior has three main benefits: sharp object-boundary edges in areas of depth discontinuity; accurate disparity in surface regions; and low sensitivity to segmentation. We evaluate our method using Middlebury stereo sets and more challenging remote sensing data. Our experimental results demonstrate that our approach has superior performance on these data sets.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bleyer, M., Rother, C., Kohli, P.: Surface stereo with soft segmentation. In: CVPR, pp. 1570–1577 (2010)
Bleyer, M., Rother, C., Kohli, P., Scharstein, D., Sinha, S.: Object stereo — joint stereo matching and object segmentation. In: CVPR, pp. 3081–3088 (2011)
Boykov, Y., Kolmogorov, V.: An experimental comparison of min-cut/max-flow algorithms for energy minimization in vision. PAMI 26(9), 1124–1137 (2004)
Comaniciu, D., Meer, P.: Mean shift: A robust approach toward feature space analysis. PAMI 24(5), 603–619 (2002)
Hirschmüller, H.: Stereo processing by semiglobal matching and mutual information. PAMI 30(2), 328–341 (2008)
Klaus, A., Sormann, M., Karner, K.: Segment-based stereo matching using belief propagation and a self-adapting dissimilarity measure. In: ICPR, vol. 3, pp. 15–18 (2006)
Kurz, F., Türmer, S., Meynberg, O., Rosenbaum, D., Runge, H., Reinartz, P., Leitloff, J.: Low-cost optical camera systems for real-time mapping applications. PFG 2, 159–176 (2012)
Scharstein, D., Szeliski, R.: A taxonomy and evaluation of dense two-frame stereo correspondence algorithms. IJCV 47(1-3), 7–42 (2002), http://vision.middlebury.edu/stereo/
Sun, J., Li, Y., Kang, S.B., Shum, H.Y.: Symmetric stereo matching for occlusion handling. In: CVPR, vol. 2, pp. 399–406 (2005)
Sun, J., Zheng, N.N., Shum, H.Y.: Stereo matching using belief propagation. PAMI 25(7), 787–800 (2003)
Taguchi, Y., Wilburn, B., Zitnick, L.: Stereo reconstruction with mixed pixels using adaptive over-segmentation. In: CVPR (2008)
Wang, Z.F., Zheng, Z.G.: A region based stereo matching algorithm using cooperative optimization. In: CVPR (2008)
Woodford, O.J., Torr, P.H.S., Reid, I.D., Fitzgibbon, A.W.: Global stereo reconstruction under second-order smoothness priors. PAMI 31-12, 2115–2128 (2009)
Zabih, R., Woodfill, J.: Non-parametric local transforms for computing visual correspondence. In: Sandini, G. (ed.) ECCV 1992. LNCS, vol. 588, Springer, Heidelberg (1992)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Zhu, K., Neilson, D., d’Angelo, P. (2013). Confidence-Based Surface Prior for Energy-Minimization Stereo Matching. In: Weickert, J., Hein, M., Schiele, B. (eds) Pattern Recognition. GCPR 2013. Lecture Notes in Computer Science, vol 8142. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-40602-7_10
Download citation
DOI: https://doi.org/10.1007/978-3-642-40602-7_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-40601-0
Online ISBN: 978-3-642-40602-7
eBook Packages: Computer ScienceComputer Science (R0)