This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Efficient Parallel Processing of Image Contours
January 1993 (vol. 15 no. 1)
pp. 69-81

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.

[1] A. Agrawal, L. Nekludova, and W. Lim, "A parallelO(logN) algorithm for finding connected components in planar images," inProc. Int. Conf. Parallel Processing, Aug. 1987, pp. 783-786.
[2] R. J. Anderson and G. L. Miller, "Deterministic parallel list ranking," inLecture Notes in Computer Science 319, VLSI Algorithms and Architectures, J. Reif, Ed., 3rd Aegean Workshop on Computing, 81-90, June-July, 1988.
[3] L. T. Chen and L. S. Davis, "A parallel algorithm for list ranking image curves inO(logN) time," Tech. Rep. CAR-TR-501/CS-TR-2458, Cent. for Automat. Res., Apr. 1990.
[4] L. T. Chen and L. S. Davis, "A parallel algorithm for list ranking image curves inO(logN)time," inProc. DARPA Image Understanding Workshop, Sept. 1990, pp. 805-815.
[5] L. T. Chen and C. P. Kruskal, "An EREW parallel algorithm for list ranking image curves inO(logN) time," Tech. Rep. CAR-TR-541/CS-TR-2629, Cent. for Automat. Res., Mar. 1991.
[6] R. Cole and U. Vishkin, "Approximate parallel scheduling, Part I: The basic technique with applications to optimal parallel list ranking in logarithmic time,"SIAM J. Comput., vol. 17, no. 1, pp. 128-142, Feb. 1988.
[7] W. D. Hillis,The Connection Machine. Cambridge, MA: MIT Press, 1985.
[8] Y. Hung, "Parallel processing of geometric representations on SIMD computers," Ph.D. thesis, Univ. of Maryland, College Park, 1988.
[9] R. Tarjan and U. Vishkin, "An efficient parallel biconnectivity algorithm,"SIAM J. Comput., vol. 14, pp. 862-874, 1985.
[10] C. C. Weems, S. P. Levitan, A. R. Hanson, and E. M. Riseman, "The image understanding architecture,"Int. J. Comput. Vision, vol. 2, no. 3, pp. 251-282, Jan. 1989.
[11] A. Y. Wu, S. K. Bhaskar, and A. Rosenfeld, "Parallel processing of region boundaries,"Patt. Recogn., vol. 22, pp. 165-172, 1989.
[12] J. C. Wyllie, "The complexity of parallel computations," Ph.D. dissertation, Dep. Comput. Sci., Cornell Univ., Ithaca, NY, 1979.

Index Terms:
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
Citation:
L.T. Chen, L.S. Davis, C.P. Kruskal, "Efficient Parallel Processing of Image Contours," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 15, no. 1, pp. 69-81, Jan. 1993, doi:10.1109/34.184775
Usage of this product signifies your acceptance of the Terms of Use.