| dc.contributor.author |
Taycher, Leonid |
en_US |
| dc.contributor.author |
Darrell, Trevor |
en_US |
| dc.date.accessioned |
2004-10-08T20:36:35Z |
|
| dc.date.available |
2004-10-08T20:36:35Z |
|
| dc.date.issued |
2001-09-01 |
en_US |
| dc.identifier.other |
AIM-2001-024 |
en_US |
| dc.identifier.uri |
http://hdl.handle.net/1721.1/6658 |
|
| dc.description.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. |
en_US |
| dc.description.provenance |
Made available in DSpace on 2004-10-08T20:36:35Z (GMT). No. of bitstreams: 2
AIM-2001-024.ps: 15686301 bytes, checksum: da1c6d4164ee77b81bb1da53f37a6efc (MD5)
AIM-2001-024.pdf: 1574798 bytes, checksum: 598af8bc86690c904ac2d89a27223805 (MD5)
Previous issue date: 2001-09-01 |
en |
| dc.format.extent |
10 p. |
en_US |
| dc.format.extent |
15686301 bytes |
|
| dc.format.extent |
1574798 bytes |
|
| dc.format.mimetype |
application/postscript |
|
| dc.format.mimetype |
application/pdf |
|
| dc.language.iso |
en_US |
|
| dc.relation.ispartofseries |
AIM-2001-024 |
en_US |
| dc.subject |
AI |
en_US |
| dc.title |
Range Segmentation Using Visibility Constraints |
en_US |
