Depth Discontinuities by Pixel-to-Pixel Stereo (1996)
Cached
Download Links
| Venue: | International Journal of Computer Vision |
| Citations: | 114 - 4 self |
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
 |
 |
 |
 |
 |
 |
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...
