The 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 highbandwidth communication among processors at arbitrary locations, using a message-passing network. We present solutions to a set of Image Understand- ing 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 Ma- chine 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
To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.