Skip to main content
Log in

Depth Discontinuities by Pixel-to-Pixel Stereo

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

Abstract

An algorithm to detect depth discontinuities from a stereo pair of images is presented. The algorithm matches individual pixels in corresponding scanline pairs, while allowing occluded pixels to remain unmatched, then propagates the information between scanlines by means of a fast postprocessor. The algorithm handles large untextured regions, uses a measure of pixel dissimilarity that is insensitive to image sampling, and prunes bad search nodes to increase the speed of dynamic programming. The computation is relatively fast, taking about 600 nanoseconds per pixel per disparity on a personal computer. Approximate disparity maps and precise depth discontinuities (along both horizontal and vertical boundaries) are shown for several stereo image pairs containing textured, untextured, fronto-parallel, and slanted objects in indoor and outdoor scenes.

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

  • Attneave, F. 1954. Some informational aspects of visual perception. Psychological Review, 61(3):183–193.

    Google Scholar 

  • Baker, H.H. and Binford, T.O. 1981. Depth from edge and intensity based stereo. In Proceedings of the 7th International Joint Conference on Artificial Intelligence, pp. 631–636.

  • Belhumeur, P.N. 1993. A binocular stereo algorithm for reconstructing sloping, creased, and broken surfaces in the presence of halfocclusion. In Proceedings of the 4th International Conference on Computer Vision, pp. 431–438.

  • Belhumeur, P.N. and Mumford, D. 1992. A Bayesian treatment of the stereo correspondence problem using half-occluded regions. In Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, pp. 506–512.

  • Birchfield, S. and Tomasi, C. 1996. Depth discontinuities by pixel-topixel stereo. Technical Report STAN-CS-TR-96-1573, Stanford University.

  • Birchfield, S. and Tomasi, C. 1998a. Depth discontinuities by pixelto-pixel stereo. In Proceedings of the 6th International Conference on Computer Vision, pp. 1073–1080.

  • Birchfield, S. and Tomasi, C. 1998b. A pixel dissimilarity measure that is insensitive to image sampling. IEEE Transactions on Pattern Analysis and Machine Intelligence.

  • Black, M.J. and Anandan, P. 1990. Constraints for the early detection of discontinuity from motion. In Proceedings of the 8th National Conference on Artificial Intelligence (AAAI-90), Vol. 2, pp. 1060–1066.

    Google Scholar 

  • Bolles, R.C., Baker, H.H., and Hannah, M.J. 1993. The JISCT stereo evaluation. In ARPA Image Understanding Workshop, pp. 263–274.

  • Boykov, Y., Veksler, O., and Zabih, R. 1998. Markov random fields with efficient approximations. In Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, pp. 648–655.

  • Chen, L.-H. and Lin, W.-C. 1997. Visual surface segmentation from stereo. Image and Vision Computing, 15:95–106.

    Google Scholar 

  • Cochran, S.D. and Medioni, G. 1992. 3-D surface description from binocular stereo. IEEE Transactions on Pattern Analysis and Machine Intelligence, 14(10):981–994.

    Google Scholar 

  • Cox, I.J., Hingorani, S.L., Rao, S.B., and Maggs, B.M. 1996. A maximum likelihood stereo algorithm. Computer Vision and Image Understanding, 63(3):542–567.

    Google Scholar 

  • Faugeras, O. 1993. Three-Dimensional Computer Vision. MIT Press: Cambridge, MA.

    Google Scholar 

  • Fua, P. 1991. Combining stereo and monocular information to compute dense depth maps that preserve depth discontinuities. In Proceedings of the 12th International Joint Conference on Artificial Intelligence, pp. 1292–1298.

  • Gamble, E.B., Geiger, D., Poggio, T., and Weinshall, D. 1989. Integration of vision modules and labeling of surface discontinuities. IEEE Transactions on Pattern Analysis and Machine Intelligence, 19(6):1576–1581.

    Google Scholar 

  • Gamble, E.B. and Poggio, T. 1987. Visual integration and detection of discontinuities: The key role of intensity edges. A.I. Memo No. 970, MIT-AI.

  • Geiger, D., Ladendorf, B., and Yuille, A. 1995. Occlusions and binocular stereo. International Journal of Computer Vision, 14(3):211–226.

    Google Scholar 

  • Grimson, W.E.L. 1985. Computational experiments with a feature based stereo algorithm. IEEE Transactions on Pattern Analysis and Machine Intelligence, PAMI-7(1):17–34.

    Google Scholar 

  • Intille, S.S. and Bobick, A.F. 1994. Disparity-space images and large occlusion stereo. In Proceedings of the 3rd European Conference on Computer Vision, pp. 179–186.

  • Jones, D.G. and Malik, J. 1992. Computational framework for determining stereo correspondence from a set of linear spatial filters. Image and Vision Computing, 10(10):699–708.

    Google Scholar 

  • Kanade, T. and Okutomi, M. 1994. A stereo matching algorithm with an adaptive window: Theory and experiment. IEEE Transactions on Pattern Analysis and Machine Intelligence, 16(9):920–932.

    Google Scholar 

  • Little, J.J. and Gillett, W.E. 1990. Direct evidence for occlusion in stereo and motion. Image and Vision Computing, 8(4):328–340.

    Google Scholar 

  • Luo, A. and Burkhardt, H. 1995. An intensity-based cooperative bidirectional stereo matching with simultaneous detection of discontinuities and occlusions. International Journal of Computer Vision, 15(3):171–188.

    Google Scholar 

  • Malik, J. and Perona, P. 1990. Finding boundaries in images. In Proceedings of the 24th Asilomar Conference on Signals, Systems and Computers, pp. 800–804.

  • Marr, D. and Poggio, T. 1976. Cooperative computation of stereo disparity. Science, 194:283–287.

    Google Scholar 

  • Marr, D. and Poggio, T. 1979. A computational theory of human stereo vision. Proceedings of the Royal Society of London, Series B, 204:301–328.

    Google Scholar 

  • Nalwa, V.S. 1993. A Guided Tour of Computer Vision. Addison-Wesley: Reading, MA.

    Google Scholar 

  • Ohta, Y. and Kanade, T. 1985. Stereo by intra-and interscanline search using dynamic programming. IEEE Transactions on Pattern Analysis and Machine Intelligence, 7(2):139–154.

    Google Scholar 

  • Poggio, T., Gamble, E., and Little, J.J. 1988. Parallel integration of vision modules. Science, 242(4877):436–440.

    Google Scholar 

  • Pollard, S.B., Mayhew, J.E.W., and Frisby, J.P. 1985. A stereo correspondence algorithm using a disparity gradient constraint. Perception, 14:449–470.

    Google Scholar 

  • Spoerri, A. and Ullman, S. 1987. The early detection of motion boundaries. In Proceedings of the 1st International Conference on Computer Vision, pp. 209–218.

  • Toh, P.-S. and Forrest, A.K. 1990. Occlusion detection in early vision. In Proceedings of the 3rd International Conference on Computer Vision, Osaka, Japan, pp. 126–132.

  • Wang, J.Y.A. and Adelson, E.H. 1994. Representing moving images with layers. IEEE Transactions on Image Processing, 3(5):625–638.

    Google Scholar 

  • Wixson, L.E. 1993. Detecting occluding edges without computing dense correspondence. In Proceedings of the DARPA Image Understanding Workshop.

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Birchfield, S., Tomasi, C. Depth Discontinuities by Pixel-to-Pixel Stereo. International Journal of Computer Vision 35, 269–293 (1999). https://doi.org/10.1023/A:1008160311296

Download citation

  • Issue Date:

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

Navigation