A Heterarchical Program for Recognition of Polyhedra

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

Full metadata record

DC Field	Value	Language
dc.creator	Shirai, Yoshiaki	-
dc.date	2004-10-04T14:45:55Z	-
dc.date	2004-10-04T14:45:55Z	-
dc.date	1972-06-01	-
dc.date.accessioned	2013-10-09T02:44:07Z	-
dc.date.available	2013-10-09T02:44:07Z	-
dc.date.issued	2013-10-09	-
dc.identifier	AIM-263	-
dc.identifier	http://hdl.handle.net/1721.1/6208	-
dc.identifier.uri	http://koha.mediu.edu.my:8181/xmlui/handle/1721	-
dc.description	Recognition of polyhedra by a heterarchical program is presented. The program is based on the strategy of recognizing objects step by step, at each time making use of the previous results. At each stage, the most obvious and simple assumption is made and the assumption is tested. To find a line segment, a range of search is proposed. Once a line segment is found, more of the line is determined by tracking along it. Whenever a new fact is found, the program tries to reinterpret the scene taking the obtained information into consideration. Results of the experiment using an image dissector are satisfactory for scenes containing a few blocks and wedges. Some limitations of the present program and proposals for future development are described.	-
dc.format	16938073 bytes	-
dc.format	1074771 bytes	-
dc.format	application/postscript	-
dc.format	application/pdf	-
dc.language	en_US	-
dc.relation	AIM-263	-
dc.title	A Heterarchical Program for Recognition of Polyhedra	-
Appears in Collections:	MIT Items

Files in This Item:

There are no files associated with this item.

DSpace JSPUI