Range Segmentation Using Visibility Constraints

Please use this identifier to cite or link to this item: http://dspace.mediu.edu.my:8181/xmlui/handle/1721.1/6658

Full metadata record

DC Field	Value	Language
dc.creator	Taycher, Leonid	-
dc.creator	Darrell, Trevor	-
dc.date	2004-10-08T20:36:35Z	-
dc.date	2004-10-08T20:36:35Z	-
dc.date	2001-09-01	-
dc.date.accessioned	2013-10-09T02:46:23Z	-
dc.date.available	2013-10-09T02:46:23Z	-
dc.date.issued	2013-10-09	-
dc.identifier	AIM-2001-024	-
dc.identifier	http://hdl.handle.net/1721.1/6658	-
dc.identifier.uri	http://koha.mediu.edu.my:8181/xmlui/handle/1721	-
dc.description	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.	-
dc.format	10 p.	-
dc.format	15686301 bytes	-
dc.format	1574798 bytes	-
dc.format	application/postscript	-
dc.format	application/pdf	-
dc.language	en_US	-
dc.relation	AIM-2001-024	-
dc.subject	AI	-
dc.title	Range Segmentation Using Visibility Constraints	-
Appears in Collections:	MIT Items

Files in This Item:

There are no files associated with this item.

DSpace JSPUI