Skip to main content
Log in

A Simple Stereo Algorithm to Recover Precise Object Boundaries and Smooth Surfaces

  • Published:
International Journal of Computer Vision Aims and scope Submit manuscript

Abstract

For recovering precise object boundaries in area-based stereo matching, there are two problems. One is the so-called “occlusion problem”. This can be avoided if we can select only “visible” cameras among many cameras used. Another one is the problem called “boundary overreach”, i.e. the recovered object boundary turns out to be wrongly located away from the real one due to the window's coverage beyond a boundary. This is especially harmful to segmenting objects using depth information. A few approaches have been proposed to solve this problem. However, these techniques tend to degrade on smooth surfaces. That is, there seems to be a trade-off problem between recovering precise object edges and obtaining smooth surfaces.

In this paper, we propose a new simple method to solve these problems. Using multiple stereo pairs and multiple windowing, our method detects the region where the boundary overreach is likely to occur (let us call it “BO region”) and adopts appropriate methods for the BO and non-BO regions. Although the proposed method is quite simple, the experimental results have shown that it is very effective at recovering both sharp object edges at their correct locations and smooth object surfaces. We also present a sound analysis of the boundary overreach which has not been clearly explained in the past.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  • Cochran, S.D. and Medioni, G. 1992. 3-D surface description from binocular stereo. IEEE Trans. PAMI, 14(10):981–994.

    Google Scholar 

  • Fusiello, A., Roberto, V., and Trucco, E. 1997. Efficient stereo with multiple windowing. In Proc. CVPR, pp. 858–863.

  • Kanade, T. and Okutomi, M. 1994. Astereo matching algorithm with an adaptive window: Theory and experiment. IEEE Trans. PAMI, 16(9):920–932. Also appeared in Proc. ICRA, pp. 1088–1095, 1991.

    Google Scholar 

  • Kanade, T., Yoshida, A., Oda, K., Kano, H., and Tanaka, M. 1996. A stereo machine for video-rate dense depth mapping and its new applications. In Proc. CVPR, pp. 196–202.

  • Nakamura, Y., Matsuura, T., Satoh, K., and Ohta, Y. 1996. Occlusion detectable stereo—occlusion patterns in camera matrix. In Proc. CVPR, pp. 371–378.

  • Oda, K., Kano, H., and Kanade, T. 1997. Generalized disparity and its application for multi-stereo camera calibration. In Optical 3-D Measurement Techniques IV, pp. 109–116.

  • Okutomi, M. and Kanade, T. 1992. Alocally adaptive windowfor signal matching. International Journal of Computer Vision, 7(2):143–162. Also appeared in Proc. ICCV, pp. 190–199, 1990.

    Google Scholar 

  • Okutomi, M. and Kanade, T. 1993. A multiple-baseline stereo. IEEE Trans. PAMI, 15(4):353–363. Also appeared in Proc. CVPR, pp. 63–69, 1991.

    Google Scholar 

  • Park, J.-I. and Inoue, S. 1998. Acquisition of sharp depth map from multiple cameras. Signal Processing: Image Communication, 14:7–19.

    Google Scholar 

  • Sara, R. and Bajcsy, R. 1997. On occluding contour artifacts in stereo vision. In Proc. CVPR, pp. 852–857.

Download references

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Okutomi, M., Katayama, Y. & Oka, S. A Simple Stereo Algorithm to Recover Precise Object Boundaries and Smooth Surfaces. International Journal of Computer Vision 47, 261–273 (2002). https://doi.org/10.1023/A:1014510328154

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1014510328154

Navigation