Show simple item record

Parallel Algorithms for Computer Vision on the Connection Machine

dc.date.accessioned2004-10-01T20:10:31Z
dc.date.accessioned2018-11-24T10:09:41Z
dc.date.available2004-10-01T20:10:31Z
dc.date.available2018-11-24T10:09:41Z
dc.date.issued1986-11-01en_US
dc.identifier.urihttp://hdl.handle.net/1721.1/5597
dc.identifier.urihttp://repository.aust.edu.ng/xmlui/handle/1721.1/5597
dc.description.abstractThe Connection Machine is a fine-grained parallel computer having up to 64K processors. It supports both local communication among the processors, which are situated in a two-dimensional mesh, and high-bandwidth communication among processors at arbitrary locations, using a message-passing network. We present solutions to a set of Image Understanding problems for the Connection Machine. These problems were proposed by DARPA to evaluate architectures for Image Understanding systems, and are intended to comprise a representative sample of fundamental procedures to be used in Image Understanding. The solutions on the Connection Machine embody general methods for filtering images, determining connectivity among image elements, determining spatial relations of image elements, and computing graph properties, such as matchings and shortest paths.en_US
dc.format.extent31 p.en_US
dc.format.extent4037682 bytes
dc.format.extent1518931 bytes
dc.language.isoen_US
dc.titleParallel Algorithms for Computer Vision on the Connection Machineen_US


Files in this item

FilesSizeFormatView
AIM-928.pdf1.518Mbapplication/pdfView/Open
AIM-928.ps4.037Mbapplication/postscriptView/Open

This item appears in the following Collection(s)

Show simple item record