Login

Range Segmentation Using Visibility Constraints

Show full item record




Title: Range Segmentation Using Visibility Constraints
Author: Taycher, Leonid; Darrell, Trevor
Issue Date: 2001-09-01
Abstract: 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.
URI: http://hdl.handle.net/1721.1/6658
Other Identifiers: AIM-2001-024
Series/Report no.: AIM-2001-024
Keywords: AI

Files in this item

Files Size Format
AIM-2001-024.pdf 1.574Mb application/pdf
AIM-2001-024.ps 15.68Mb application/postscript

This item appears in the following Collection(s)

Show full item record

Search DSpace@MIT


Advanced Search

Browse

My Account

Links