Stereoscopic Segmentation

  • Authors:

  • Anthony Yezzi;Stefano Soatto

  • Affiliations:

  • School of Electrical and Computer Engineering, Georgia Institute of Technology, Atlanta, GA 30332. ayezzi@ece.gatech.edu;Department of Computer Science, University of California, Los Angeles, CA 90095. soatto@ucla.edu

  • Venue:
  • International Journal of Computer Vision
  • Year:
  • 2003

Quantified Score

Hi-index 0.00

Visualization

Abstract

We cast the problem of multiframe stereo reconstruction of a smooth surface 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 of the scene results in piecewise homogeneous image statistics. This simplifying assumption covers Lambertian scenes with 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 find the optimal solution numerically. Our algorithm does not work in the presence of strong photometric features, where traditional reconstruction algorithms do. It enjoys significant robustness to noise under the assumptiong it is designed for.