You have requested a machine translation of selected content from our databases. This functionality is provided solely for your convenience and is in no way intended to replace human translation. Neither SPIE nor the owners and publishers of the content make, and they explicitly disclaim, any express or implied representations or warranties of any kind, including, without limitation, representations and warranties as to the functionality of the translation feature or the accuracy or completeness of the translations.
Translations are not retained in our system. Your use of this feature and the translations is subject to all use restrictions contained in the Terms and Conditions of Use of the SPIE website.
18 July 1988Image Processing On Hypercube Multiprocessors
This research is concerned with developing efficient algorithms and paradigms to solve geometric problems for digitized pictures on hypercube multiprocessors. At present, it appears that commercially available medium-grained hypercube multiprocessors are not well suited to low level vision tasks, such as convolution and Hough transform. Therefore, our research has focused on medium level vision problems involving connectivity, proximity, and convexity. In this paper, data reduction techniques are developed for medium level vision tasks. These techniques are used to present efficient hypercube algorithms for solving the convex hull problem. Results are given for implementing a variety of convex hull algorithms on an Intel iPSC1 hypercube. Implementation issues and algorithm paradigms are discussed in their relationship to the running times of the algorithms on this machine.
The alert did not successfully save. Please try again later.
Russ Miller, Susan E. Miller, "Image Processing On Hypercube Multiprocessors," Proc. SPIE 0939, Hybrid Image and Signal Processing, (18 July 1988); https://doi.org/10.1117/12.947060