Depth discontinuities by pixel-to-pixel stereo

Depth discontinuities by pixel-to-pixel stereo
复制标题

DOI:
10.1023/a:1008160311296
复制
发表时间:
1999-12-01
影响因子:
19.5
通讯作者:
Tomasi, C
Tomasi, C
中科院分区:
计算机科学2区
文献类型:
--
作者:
Birchfield, S;Tomasi, C

文献摘要

被引文献

相似文献

提出了一种从立体图像对中检测深度不连续性的算法。该算法匹配相应扫描线对中的单个像素,同时允许遮挡的像素保持不匹配,然后通过快速后处理器在扫描线之间传播信息。该算法处理大型未纹理区域,使用对图像采样不敏感的像素不相似性度量,并修剪不良搜索节点以提高动态规划的速度。计算速度相对较快,在个人计算机上每像素每视差大约需要600纳秒。近似的视差图和精确的深度不连续(沿水平和垂直边界)显示了室内和室外场景中包含纹理、非纹理、正面平行和倾斜物体的几个立体图像对。
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.