Stereoscopic Segmentation

We cast the problem of multiframe stereo reconstruction of a smooth shape as the global region segmentation of a collection of images of the scene. Dually, the problem of segmenting multiple calibrated images of an object becomes that of estimating the solid shape that gives rise to such images. We assume that the radiance has smooth statistics. This assumption covers Lambertian scenes with smooth or constant albedo as well as fine homogeneous textures, which are known challenges to stereo algorithms based on local correspondence. We pose the segmentation problem within a variational framework, and use fast level set methods to approximate the optimal solution numerically. Our algorithm does not work in the presence of strong textures, where traditional reconstruction algorithms do. It enjoys significant robustness to noise under the assumptions it is designed for.

• Type: Conference
• Year: 2001
• Where: ICCV
• Authors: Anthony J. Yezzi, Stefano Soatto
• Keywords: Computer Vision, Fine Homogeneous Textures, ICCV 2001, Multiframe Stereo Reconstruction, Segmentation Problem, Smooth Shape, Traditional Reconstruction Algorithms