The Combinatorics of Object Recognition in Cluttered Environments Using Constrained Search

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

Full metadata record

DC Field	Value	Language
dc.creator	Grimson, W. Eric L.	-
dc.date	2004-10-04T14:57:54Z	-
dc.date	2004-10-04T14:57:54Z	-
dc.date	1988-02-01	-
dc.date.accessioned	2013-10-09T02:45:38Z	-
dc.date.available	2013-10-09T02:45:38Z	-
dc.date.issued	2013-10-09	-
dc.identifier	AIM-1019	-
dc.identifier	http://hdl.handle.net/1721.1/6485	-
dc.identifier.uri	http://koha.mediu.edu.my:8181/xmlui/handle/1721	-
dc.description	When clustering techniques such as the Hough transform are used to isolate likely subspaces of the search space, empirical performance in cluttered scenes improves considerably. In this paper we establish formal bounds on the combinatorics of this approach. Under some simple assumptions, we show that the expected complexity of recognizing isolated objects is quadratic in the number of model and sensory fragments, but that the expected complexity of recognizing objects in cluttered environments is exponential in the size of the correct interpretation. We also provide formal bounds on the efficacy of using the Hough transform to preselect likely subspaces, showing that the problem remains exponential, but that in practical terms, the size of the problem is significantly decreased.	-
dc.format	5063882 bytes	-
dc.format	1983909 bytes	-
dc.format	application/postscript	-
dc.format	application/pdf	-
dc.language	en_US	-
dc.relation	AIM-1019	-
dc.title	The Combinatorics of Object Recognition in Cluttered Environments Using Constrained Search	-
Appears in Collections:	MIT Items

Files in This Item:

There are no files associated with this item.

DSpace JSPUI