Depth Discontinuities by Pixel-to-Pixel Stereo
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 1.5 microseconds per pixel per disparity on a workstation. Approximate disparity maps and precise depth discontinuities (along both horizontal and vertical boundaries) are shown for five stereo images containing textured, untextured, fronto-parallel, and slanted objects.
Cite
Text
Birchfield and Tomasi. "Depth Discontinuities by Pixel-to-Pixel Stereo." IEEE/CVF International Conference on Computer Vision, 1998. doi:10.1109/ICCV.1998.710850Markdown
[Birchfield and Tomasi. "Depth Discontinuities by Pixel-to-Pixel Stereo." IEEE/CVF International Conference on Computer Vision, 1998.](https://mlanthology.org/iccv/1998/birchfield1998iccv-depth/) doi:10.1109/ICCV.1998.710850BibTeX
@inproceedings{birchfield1998iccv-depth,
title = {{Depth Discontinuities by Pixel-to-Pixel Stereo}},
author = {Birchfield, Stan and Tomasi, Carlo},
booktitle = {IEEE/CVF International Conference on Computer Vision},
year = {1998},
pages = {1073-1080},
doi = {10.1109/ICCV.1998.710850},
url = {https://mlanthology.org/iccv/1998/birchfield1998iccv-depth/}
}