• Documents
  • Authors
  • Tables
  • Other Seers ▼
    RefSeer AckSeer CollabSeer SeerSeer
  • Log in
  • Sign up
  • MetaCart

CiteSeerX logo

Advanced Search Include Citations
Advanced Search Include Citations | Disambiguate

Depth Discontinuities by Pixel-to-Pixel Stereo (1996)

Cached

  • Download as a PDF
  •  
  • Download as a PS

Download Links

  • [vision.stanford.edu]
  • [vision.stanford.edu]
  • [robotics.stanford.edu]
  • [www.ces.clemson.edu]
  • [robotics.stanford.edu]
  • [www.ces.clemson.edu]
  • [www.cs.duke.edu]
  • [vision.stanford.edu]
  • [robotics.stanford.edu]
  • [vision.stanford.edu]
  • [www.cs.duke.edu]

  • Other Repositories/Bibliography

  • DBLP
  • Save to List
  • Add to Collection
  • Correct Errors
  • Monitor Changes
by Stan Birchfield , Carlo Tomasi
Venue:International Journal of Computer Vision
Citations:114 - 4 self
  • Summary
  • Active Bibliography
  • Co-citation
  • Clustered Documents
  • Version History

BibTeX

@ARTICLE{Birchfield96depthdiscontinuities,
    author = {Stan Birchfield and Carlo Tomasi},
    title = {Depth Discontinuities by Pixel-to-Pixel Stereo},
    journal = {International Journal of Computer Vision},
    year = {1996},
    volume = {35},
    pages = {1073--1080}
}

Years of Citing Articles

Bookmark

citeulike Connotea Bibsonomy Del.icio.us Digg Reddit

OpenURL

 

Abstract

Proceedings of the 1998IEEE International Conference on Computer Vision, Bombay, India 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 1.5 microseconds per pixel per disparity on a workstation. Approximate disparity mapsand precise depth discontinuities (along both horizontal and vertical boundaries) are shown for five stereo images containing textured, untextured, fronto-parallel, and slanted objects. 1 Introduction Cartoon artists have known the perceptual importance of depth discontinuities for...

Citations

407 Three-Dimensional Computer Vision - Faugeras - 1993
184 Stereo by intra- and inter-scanline search using dynamic programming - Ohta, Kanade - 1985
168 A Maximum Likelihood Stereo Algorithm - Cox, Hingorani, et al. - 1996
108 and T.O.Binford. Depth from edge and intensity based stereo - Baker - 1981
106 Occlusions and binocular stereo - Geiger, Ladendorf, et al. - 1995
104 Acomputational framework for determining stereo correspondence from a set of linear spatial lters - Jones, Malik - 1992
81 Generalization of the Lambertian model and implications for machine vision - Nayar, Oren - 1995
68 Disparity-space images and large occlusion stereo - Intille, Bobick - 1994
65 A Bayesian treatment of the stereo correspondence problem using half-occluded regions - Belhumeur, Mumford - 1992
53 Combining stereo and monocular information to compute dense depth maps that preserve depth discontinuities - Fua - 1991
48 3-D surface description from binocular stereo - Cochran, Medioni
36 A binocular stereo algorithm for reconstructing sloping, creased, and broken surfaces in the presence of halfocclusion - Belhumeur - 1993
24 Stereo in the presence of specular reflection - Bhat, Nayar - 1995
22 Direct evidence for occlusion in stereo and motion - Little, Gillett - 1990
17 An Intensity-Based Cooperative Bidirectional Stereo Matching with Simultaneous Detection of Discontinuities and Occlusions - Luo, Burkhardt - 1995
8 Occlusion Detection in Early Vision - Toh, Forrest - 1990
5 Detecting occluding edges without computing dense correspondence - Wixson - 1993
1 Stereo in the presence of specular re ection - Bhat, Nayar - 1995
The National Science Foundation
  • About CiteSeerX
  • Submit Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2010 The Pennsylvania State University