Return to search

Range Segmentation Using Visibility Constraints

Visibility constraints can aid the segmentation of foreground objects observed with multiple range images. In our approach, points are defined as foreground if they can be determined to occlude some {em empty space} in the scene. We present an efficient algorithm to estimate foreground points in each range view using explicit epipolar search. In cases where the background pattern is stationary, we show how visibility constraints from other views can generate virtual background values at points with no valid depth in the primary view. We demonstrate the performance of both algorithms for detecting people in indoor office environments.

Identiferoai:union.ndltd.org:MIT/oai:dspace.mit.edu:1721.1/6658
Date01 September 2001
CreatorsTaycher, Leonid, Darrell, Trevor
Source SetsM.I.T. Theses and Dissertation
Languageen_US
Detected LanguageEnglish
Format10 p., 15686301 bytes, 1574798 bytes, application/postscript, application/pdf
RelationAIM-2001-024

Page generated in 0.0023 seconds