Issue No. 01 - January (1993 vol. 15)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/34.184775
<p>Describes two parallel algorithms for ranking the pixels on a curve in O (log N) time using either an EREW or CREW PRAM model. The algorithms accomplish this with N processors for a square root N* square root N image. After applying such an algorithm to an image, it is possible to move the pixels from a curve into processors having consecutive addresses. This is important because one can subsequently apply many algorithms to the curve (such as piecewise linear approximation algorithms or point in polygon tests) using segmented scan operations (i.e. parallel prefix operations). Scan operations can be executed in logarithmic time on many interconnection networks, such as hypercube, tree, butterfly, and shuffle exchange machines as well as on the EREW PRAM. The algorithms were implemented on the hypercube structured Connection Machine, and various performance tests were conducted.</p>
EREW model; computer vision; parallel processing; image contours; parallel algorithms; CREW PRAM model; segmented scan operations; hypercube; Connection Machine; computational complexity; computer vision; hypercube networks; image processing; parallel algorithms; parallel processing
L. Chen, C. Kruskal and L. Davis, "Efficient Parallel Processing of Image Contours," in IEEE Transactions on Pattern Analysis & Machine Intelligence, vol. 15, no. , pp. 69-81, 1993.