| dc.date.accessioned | 2008-04-22T08:33:34Z | |
| dc.date.accessioned | 2018-11-26T22:25:14Z | |
| dc.date.available | 2008-04-22T08:33:34Z | |
| dc.date.available | 2018-11-26T22:25:14Z | |
| dc.date.issued | 1972-06 | |
| dc.identifier.uri | http://hdl.handle.net/1721.1/41204 | |
| dc.identifier.uri | http://repository.aust.edu.ng/xmlui/handle/1721.1/41204 | |
| dc.description | Work reported herein was conducted at the Artificial Intelligence Laboratory, a Massachusetts Institute of Technology research program supported in part by the Advanced Research Projects Agency of the Department of Defense and monitored by the Office of Naval Research under Contract Number N00014-70-A-0362-0003.
Reproduction of this document, in whole or in part, is permitted for any purpose of the United States Government. | en |
| dc.description.abstract | 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. | en |
| dc.language.iso | en_US | en |
| dc.publisher | MIT Artificial Intelligence Laboratory | en |
| dc.title | A Heterarchical Program for Recognition of Polyhedra | en |
| dc.type | Working Paper | en |
