Repository logo
Log in(current)
Repository logoMIT Open ScholarshipDSpace@MIT
  1. Home
  2. Computer Science and Artificial Intelligence Lab (CSAIL)
  3. Artificial Intelligence Lab Publications
  4. AI Memos (1959 - 2004)
  5. Range Segmentation Using Visibility Constraints

Range Segmentation Using Visibility Constraints

Thumbnail Image
Download
Name

AIM-2001-024.pdf

Size

1.5 MB

Format

Adobe PDF

Checksum (MD5)

598af8bc86690c904ac2d89a27223805

Thumbnail Image
Download
Name

AIM-2001-024.ps

Size

14.96 MB

Format

PostScript

Checksum (MD5)

da1c6d4164ee77b81bb1da53f37a6efc

Author(s)
Taycher, Leonid
•
Darrell, Trevor
Date Issued
September 1, 2001
Series/Report no.
AIM-2001-024
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.
Subjects
AI
Persistent DSpace Link
http://hdl.handle.net/1721.1/6658
Repository logo
PrivacyPermissionsAccessibilityContact us
Repository logo
Notify us about copyright concerns.