Abstract
In this paper we present a new stereo matching algorithm that produces accurate dense disparity maps and explicitly detects occluded areas. This algorithm extends the original cooperative algorithms in two ways. First, we design a method of adjusting the initial matching score volume to guarantee that correct matches have high matching scores. This method propagates “good” disparity information within or among image segments based on certain disparity confidence measurement criterion, thus improving the robustness of the algorithm. Second, we develop a scheme of choosing local support areas by enforcing the image segmentation information. This scheme sees that the depth discontinuities coincide with the color or intensity boundaries. As a result, the foreground fattening errors are drastically reduced. Extensive experimental results demonstrate the effectiveness of our algorithm, both quantitatively and qualitatively. Comparison between our algorithm and some other representative algorithms is also reported.
Chapter PDF
Similar content being viewed by others
References
E.H. Adelson and P. Anandan. Perceptual organization and the judgment of brightness. Science, 262:2042–2044, 1993.
P.N. Belhumeur. A bayesian-approach to binocular stereopsis. International Journal of Computer Vision, 19(3):237–260, August 1996.
P.N. Belhumeur and D. Mumford. A bayesian treatment of the stereo correspondence problem using half-occluded regions. In Proceedings of IEEE conference on Computer Vision and Pattern Recognition, pages 506–512, 1992.
M.J. Black and A.D. Jepson. Estimating optical-flow in segmented images using variable-order parametric models with local deformations. IEEE Transactions on Pattern Analysis and Machine Intelligence, 18(10):972–986, October 1996.
A.F. Bobick and S.S. Intille. Large occlusion stereo. International Journal of Computer Vision, 33(3):1–20, September 1999.
Y. Boykov, O. Veksler, and R. Zabih. Markov random fields with efficient approximations. In Proceedings of IEEE conference on Computer Vision and Pattern Recognition, pages 648–655, 1998.
Y. Boykov, O. Veksler, and R. Zabih. Fast approximate energy minimization via graph cuts. In Proceedings of IEEE Computer Society International Conference on Computer Vision, pages 377–384, 1999.
D. Comaniciu and P. Meer. Robust analysis of feature spaces: Color image segmentation. In Proceedings of IEEE conference on Computer Vision and Pattern Recognition, pages 750–755, 1997.
M. Drumheller and T.A. Poggio. On parallel stereo. In Proceedings of IEEE International Conference on Robotics and Automation, pages 1439–1448, 1986.
P. Fua. A parallel stereo algorithm that produces dense depth maps and preserves image features. Machine Vision and Applications, 6(1):35–49, 1993.
P.V. Fua. Combining stereo and monocular information to compute dense depth maps that preserve depth discontinuities. In Proceedings of International Joint Conference on Artificial Intelligence, pages 1292–1298, 1991.
P.V. Fua. Combining stereo and monocular information to compute dense depth maps that preserve depth discontinuities. In Proceedings of International Joint Conference on Artificial Intelligence, pages 1292–1298, 1991.
E.B. Gamble and T. Poggio. Visual integration and detection of discontinuities: The key role of intensity edges. In MITAI Memo, 1987.
D. Geiger, B. Ladendorf, and A. Yuille. Occlusions and binocular stereo. In Proceedings of European Conference on Computer Vision, pages 425–433, 1992.
H. Ishikawa and D. Geiger. Occlusions, discontinuities, and epipolar lines in stereo. In Proceedings of European Conference on Computer Vision, pages xx–yy, 1998.
T. Kanade and M. Okutomi. A stereo matching algorithm with an adaptive window: Theory and experiment. IEEE Transactions on Pattern Analysis and Machine Intelligence, 16(9):920–932, September 1994.
S.B. Kang, J. Webb, C.L. Zitnick, and T. Kanade. A multibaseline stereo system with active illumination and real-time image acquisition. In Proceedings of IEEE Computer Society International Conference on Computer Vision, pages 88–93, 1995.
D. Marr and T.A. Poggio. Cooperative computation of stereo disparity. Science, 194(4262):283–287, October 15 1976.
Y. Nakamura, T. Matsura, K. Satoh, and Y. Ohta. Occlusion detectable stereo — occlusion patterns in camera matrix. In Proceedings of IEEE conference on Computer Vision and Pattern Recognition, pages 371–378, 1996.
M. Okutomi and T. Kanade. A multiple-baseline stereo. IEEE Transactions on Pattern Analysis and Machine Intelligence, 15(4):353–363, April 1993.
S.B. Pollard, J.E.W. Mayhew, and J.P. Frisby. Pmf: A stereo correspondence algorithm using a disparity gradient limit. Perception, 14:449–470, 1985.
K. Prazdny. Detection of binocular disparities. BioCyber, 52:93–99, 1985.
S. Roy and I.J. Cox. A maximum-flow formulation of the n-camera stereo correspondence problem. In Proceedings of IEEE Computer Society International Conference on Computer Vision, pages 492–499, 1998.
D. Scharstein and R. Szeliski. Stereo matching with nonlinear diffusion. International Journal of Computer Vision, 28(2):155–174, 1998.
D. Scharstein, R. Szeliski, and R. Zabih. A taxonomy and evaluation of dense two-frame stereo methods. In Proceedings of IEEE Workshop on Stereo and Multi-Baseline Vision, pages 131–140, 2001.
R. Szeliski and P. Golland. Stereo matching with transparency and matting. International Journal of Computer Vision, 32(1):45–61, August 1999.
H. Tao, H.S. Sawhney, and R. Kumar. A global matching framework for stereo computation. In Proceedings of IEEE Computer Society International Conference on Computer Vision, pages I: 532–539, 2001.
C.L. Zitnick and T. Kanade. A cooperative algorithm for stereo matching and occlusion detection. IEEE Transactions on Pattern Analysis and Machine Intelligence, 22(7):675–684, July 2000.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Zhang, Y., Kambhamettu, C. (2002). Stereo Matching with Segmentation-Based Cooperation. In: Heyden, A., Sparr, G., Nielsen, M., Johansen, P. (eds) Computer Vision — ECCV 2002. ECCV 2002. Lecture Notes in Computer Science, vol 2351. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-47967-8_37
Download citation
DOI: https://doi.org/10.1007/3-540-47967-8_37
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43744-4
Online ISBN: 978-3-540-47967-3
eBook Packages: Springer Book Archive