Show simple item record

Range Segmentation Using Visibility Constraints

dc.date.accessioned2004-10-08T20:36:35Z
dc.date.accessioned2018-11-24T10:21:25Z
dc.date.available2004-10-08T20:36:35Z
dc.date.available2018-11-24T10:21:25Z
dc.date.issued2001-09-01en_US
dc.identifier.urihttp://hdl.handle.net/1721.1/6658
dc.identifier.urihttp://repository.aust.edu.ng/xmlui/handle/1721.1/6658
dc.description.abstractVisibility 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.format.extent10 p.en_US
dc.format.extent15686301 bytes
dc.format.extent1574798 bytes
dc.language.isoen_US
dc.subjectAIen_US
dc.titleRange Segmentation Using Visibility Constraintsen_US


Files in this item

FilesSizeFormatView
AIM-2001-024.pdf1.574Mbapplication/pdfView/Open
AIM-2001-024.ps15.68Mbapplication/postscriptView/Open

This item appears in the following Collection(s)

Show simple item record