
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
R. Cypher, J.L.C. Sanz, L. Snyder, "An EREW PRAM Algorithm for Image Component Labeling," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 11, no. 3, pp. 258262, March, 1989.  
BibTex  x  
@article{ 10.1109/34.21794, author = {R. Cypher and J.L.C. Sanz and L. Snyder}, title = {An EREW PRAM Algorithm for Image Component Labeling}, journal ={IEEE Transactions on Pattern Analysis and Machine Intelligence}, volume = {11}, number = {3}, issn = {01628828}, year = {1989}, pages = {258262}, doi = {http://doi.ieeecomputersociety.org/10.1109/34.21794}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Pattern Analysis and Machine Intelligence TI  An EREW PRAM Algorithm for Image Component Labeling IS  3 SN  01628828 SP258 EP262 EPD  258262 A1  R. Cypher, A1  J.L.C. Sanz, A1  L. Snyder, PY  1989 KW  parallel algorithm; parallel processing; EREW PRAM algorithm; image component labeling; computer vision; binary images; synchronous finegrained sharedmemory model; exclusiveread exclusivewrite parallel RAM; meshconnected computers; computational complexity; computer vision; parallel algorithms; randomaccess storage VL  11 JA  IEEE Transactions on Pattern Analysis and Machine Intelligence ER   
An important midlevel task for computer vision is addressed. The problem consists of labeling connected components in N/sup 1/2/*N/sup 2/2/ binary images. This task can be solved with parallel computers by using a simple and novel algorithm. The parallel computing model used is a synchronous finegrained sharedmemory model where only one processor can read from or write to the same memory location at a given time. This model is known as the exclusiveread exclusivewrite parallel RAM (EREW PRAM). Using this model, the algorithm presented has O(log N) complexity. The algorithm can run on parallel machines other than the EREW PRAM. In particular, it offers an optimal image component labeling algorithm for meshconnected computers.
[1] A. Agrawal and A. Kulkarni, "A sequential approach to the extraction of shape features,"CVGIP, vol. 6, pp. 538557, 1977.
[2] A. Agrawal, L. Nekludova, and W. Lim, "A parallelO(logn) algorithm for finding connected components in planar images," inProc. 1987 Int. Conf. Parallel Process., pp. 783786.
[3] M. J. Atallah and S. E. Hambrusch, "Solving tree problems on a meshconnected processor array" (preliminary version), inProc. 26th Annu. Symp. Found. Comput. Sci., 1985, pp. 222231.
[4] M. Atallah and U. Vishkin, "Finding Euler tours in parallel,"J. Syst. Sci., vol. 29, pp. 330337, 1984.
[5] R. Cole and U. Vishkin, "Approximate and exact parallel scheduling with applications to list, tree and graph problems," inProc. 27th Annu. Symp. Found. Comput. Sci., 1986, pp. 478491.
[6] R. Cypher and J. L. C. Sanz, "Parallel algorithms and architectures for image processing and computer vision," in preparation.
[7] R. Cypher, J. L. C. Sanz, and L. Snyder, "Algorithms for image component labeling on SIMD mesh connected computers," presented at Proc. 1987 Int. Conf. Parallel Process.
[8] R. Cypher, J. L. C. Sanz, and L. Snyder, "Hypercube and shuffleexchange algorithms for image component labeling,"J. Algorithms, vol. 10, no. 1, pp. 140150, 1989.
[9] R. Cypher, J. L. C. Sanz, and L. Snyder, "EREW PRAM and mesh connected computer algorithms for image component labeling," presented at 1987 IEEE Comput. Soc. Workshop Comput. Arch., Pattern Anal. Machine Intell.
[10] D. S. Hirschberg, A. K. Chandra, and D. V. Sarwate, "Computing connected components on parallel computers,"Commun. Assoc. Comput. Mach., pp. 461464, 1979.
[11] R. Hummel, "Connected component labelling in image processing with MIMD architectures," inIntermediateLevel Image Processing. New York: Academic, 1986, pp. 101127.
[12] R. Hummel and A. Rojer, "Implementing a parallel connected component algorithm on MIMD architectures," presented at the IEEE Comput. Soc. Workshop Comput. Arch. Pattern Anal. Image Data Base Manage., Miami, FL, 1985.
[13] Y. Hung and A. Rosenfeld, "Parallel processing of linear quadtrees on a meshconnected computer," Cent. Automat. Res., Univ. of Maryland, Tech. Rep. CARTR278, Mar. 1987.
[14] V. K. P. Kumar and M. M. Eshaghian, "Parallel geometric algorithms for digitized pictures on mesh of trees" (preliminary version)." inProc. 1986 Int. Conf. Parallel Process., pp. 270273.
[15] W. Lim, "Fast algorithms for labeling connected components in 2 D arrays," Thinking Mach. Corp., Cambridge, Mass., Tech. Rep. 86.22, July 1986.
[16] G. L. Miller and J. H. Reif, "Parallel tree contraction and its application," inProc. 26th Annu. Symp. Found. Comput. Sci., 1985, pp. 478489.
[17] R. Miller and Q. Stout, "Varying diameter and problem size in meshconnected computers" (preliminary version), inProc. 1985 Int. Conf. Parallel Process., pp. 697699.
[18] R. Miller and Q. F. Stout, "Data movement techniques for the pyramid computer,"SIAM J. Comput., vol. 16, pp. 3860, 1987.
[19] D. Nassimi and S. Sahni, "Finding connected components and connected ones on a meshconnected parallel computer,"Siam J. Comput., vol. 9, no. 4, pp. 744757, Nov. 1980.
[20] A. Rosenfeld, "Parallel image processing using cellular arrays,"IEEE Comput., pp. 1420, 1983.
[21] A. Rosenfeld and A. Kak,Digital Picture Processing, New York: Academic, 1976.
[22] J. L. C. Sanz and I. Dinstein, "Projectionbased geometrical feature computation for computer vision: Algorithms in Pipeline Architectures,"IEEE Trans. Pattern Anal. Mach. Intell., Jan. 1987.
[23] Y. Shiloach and U. Vishkin, "AnO(logn) parallel connectivity algorithm,"J. Algorithms, vol. 3, pp. 5767, 1982.
[24] Q. F. Stout, "Properties of divideandconquer algorithms for image processing,"1985 IEEE Comput. Soc. Workshop Comput. Arch. Pattern Anal. Image Database Manage., pp. 203209.
[25] S. Tanimoto, "Architectural issues for intermediatelevel vision," inIntermediateLevel Image Processing. New York: Academic, 1986, pp. 316.
[26] R. E. Tarjan and U. Vishkin, "An efficient parallel biconnectivity algorithm,"Siam J. Comput., vol. 14, no. 4, pp. 862874, Nov. 1985.
[27] R. Tarjan and U. Vishkin, "Finding biconnected components and computing tree functions in logarithmic parallel time," inProc. 25th Ann. Symp. Founations Comput. Sci., 1984.
[28] F. Veillon, "One pass computation of morphological and geometrical properties of objects in digital pictures,"Signal Process., vol. 1, pp. 175189, 1979.
[29] U. Vishkin, "Synchronous Parallel ComputationA Survey," Comput. Sci. Dep., New York Univ., Tech. Rep. 69, New York, NY, 1983.
[30] J. C. Wyllie, "The complexity of parallel computations," Ph.D. dissertation, Dep. Comput. Sci., Cornell Univ., Ithaca, NY, 1979.