This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Parallel Architectures and Algorithms for Image Component Labeling
October 1992 (vol. 14 no. 10)
pp. 1014-1034

A survey and a characterization of the various parallel algorithms and architectures developed for the problem of labeling digitized images over the last two decades are presented. It is shown that four basic parallel techniques underly the various parallel algorithms for this problem. However, because most of these techniques have been developed at a theoretical level, it is still not clear which techniques are most efficient in practical terms. Parallel architectures and parallel models of computation that implement these techniques are also studied.

[1] A. Agrawal, L. Nekludova, and W. Lim, "A parallelO(logN) algorithm for finding connected components in planar images," inProc. Int. Conf. Parallel Processing, 1987, pp. 783-786.
[2] A. K. Agrawala and A. V. Kulkarni, "A sequential approach to the extraction of shape features,"Comput. Graphics Image Processing, vol. 6, pp. 538-557, 1977.
[3] A. Aho, J. Hopcroft, and J. Ullman,Design and Analysis of Computer Algorithms. Reading, MA: Addison Wesley, 1979.
[4] N. Ahuja and S. Swamy, "Multiprocessor pyramids for bottom-up image analysis,"IEEE Trans. Patt. Anal. Machine Intell., vol. PAMI-6, pp. 463-474, 1984.
[5] H. M. Alnuweiri and V. K. Prasanna Kumar, "Optimal VLSI sorting with reduced number of processors,"IEEE Trans. Comput., vol. C-40, no. 1, pp. 105-110.
[6] H. M. Alnuweiri and V. K. Prasanna Kumar, "Optimal geometric algorithms for fixed-size linear arrays and scan line arrays," inProc. IEEE Conf. Comput. Vision Pattern Recognition, 1988.
[7] H. M. Alnuweiri and V. K. Prasanna Kumar, "Fast image labeling using local operators on mesh-connected computers,"IEEE Trans. Patt. Anal. Machine Intell., vol. 13, no. 2, pp. 202-207, 1991.
[8] H. M. Alnuweiri and V. K. Prasanna Kumar, "Optimal image computations on reduced VLSI architectures,"IEEE Trans. Circuits Syst., Oct. 1989.
[9] H. M. Alnuweiri and V. K. Prasanna Kumar, "An efficient VLSI architecture with applications to geometric problems,"Parallel Comput., vol. 12, pp. 71-93, 1989.
[10] H. M. Alnuweiri and V. K. Prasanna Kumar, "Optimal image computations on reduced processing parallel architectures," inParallel Architectures and Algorithms for Image Understanding(V. K. Prasanna Kumar, Ed.). New York: Academic, June 1991.
[11] H. M. Alnuweiri and V. K. Prasanna Kumar, "Processor-time optimal parallel algorithms for digitized images on mesh-connected arrays,"Algorithmica, vol. 6, pp. 698-733, 1991.
[12] R. J. Anderson and G. L. Miller, "Deterministic parallel list ranking," inVLSI Algorithms Architectures: Proc. 3rd Aegean Workshop Comput., June 1988, pp. 81-90.
[13] M. Annaraton, E. Arnould, T. Gross, H. Kung, M. Lam, O. Menzilcioglu, and J. Webb, "The Warp computer: Architecture, implementation, and performance,"IEEE Trans. Comput., vol. C-36, pp. 1523-1538, Dec. 1987.
[14] M. Atallah and S. Hambrusch, "Solving tree problems on a mesh-connected processor array," inProc. IEEE Symp. Foundations Comput. Sci., 1986, pp. 222-231.
[15] K. E. Batcher, "Design of a massively parallel processor,"IEEE Trans. Comput., vol. C-29, no. 9, pp. 836-840, 1980.
[16] W. T. Beyer, "Recognition of topological invariants by iterative array," Ph.D. dissertation, Mass. Inst. Technol, Cambridge, MA, 1969.
[17] A. Borodin and J. E. Hopcroft, "Routing, merging and sorting on parallel models of computation,"J. Comput. Syst. Sci., vol. 30, pp. 130-145, 1985.
[18] R. E. Buehreret al., "The ETH-multiprocessor EMPRESS: A dynamically configurable MIMD system,"IEEE Trans. Comput., vol. C-31, no. 11, pp. 1035-1044, 1982.
[19] W. J. Bouknight,et al., "The ILLIAC IV system,"Proc. IEEE, vol. 60, no. 4, pp. 369-388, 1972.
[20] V. Cantoni and S. Levialdi, "PAPIA: A case history," inParallel Computer Vision(L. Uhr, Ed.). New York, NY: Academic, 1987.
[21] R. Cole and U. Vishkin, "The accelerated centroid decomposition technique for optimal parallel tree evaluation in logarithmic time,"Algorithmica, vol. 3, pp. 329-346, 1987.
[22] H. S. M. Coxeter,Introduction to Geometry. New York, Wiley: 1961, p. 62.
[23] R. Cypher, J. L. C. Sanz, L. Snyder, "Au EREW PRAM algorithm for image component labeling,"IEEE Trans. Patt. Anal. Machine Intell., vol. 11, no. 3, pp. 258-262, 1989.
[24] R. Cypher, J. L. C. Sanz, L. Snyder, "Hypercube and shuffle-exchange algorithms for image component labeling," inProc. IEEE Workshop Patt Anal. Machine Intell.(Seattle, WA), 1987, pp. 5-10.
[25] R. Cypher, J. L. C. Sanz, L. Snyder, "Algorithms for image component labeling on SIMD mesh connected computers,"IEEE Trans. Comput., vol. 39, no. 2, pp. 276-281, 1990.
[26] K. A. Doshi and P. J. Varman, "Optimal graph algorithms on a fixed-size linear arrays,"IEEE Trans. Comput., vol. C-36, no. 4, 1987.
[27] M. J. Duff and T. J. Fountain,Cellular Logic Image Processing. New York: Academic, 1986.
[28] C. R. Dyer, "Pyramid algorithms and machines," inMulticomputers and Image Processing Algorithms and Programs. New York: Academic, 1982, pp. 409-420.
[29] C. R. Dyer and A. Rosenfeld, "Parallel image processing by memory augmented cellular automata,"IEEE Trans. Patt. Anal. Machine Intell., pp. 29-41, Jan. 1981.
[30] A. Fisher, "Scan line array processors for image computations," inProc. Int. Conf. Comput. Architecture, 1986, pp. 338-345.
[31] T. J. Fountain, Processor Arrays:Architectures and Applications. London: Academic, 1987.
[32] G. Grant and A. F. Reid, "An efficient algorithm for boundary tracking and feature extraction,"Comput. Graphics Image Processing, vol. 17, pp. 225-237, 1981.
[33] S. B. Gray, "Local properties of binary images in two dimensions,"IEEE Trans. Comput., vol. C-20, no. 5, pp. 551-561, 1971.
[34] D. Hillis,The Connection Machine. Cambridge, MA: M.I.T. Press, 1985.
[35] E. B. Hinkle, J. L. C. Sanz, A. K. Jain, and D. Petkovic, "P3Enew life for projection-based image processing,"J. Parallel Distributed Comput., vol. 4, pp. 45-87, 1987.
[36] K. Hwang and F. A. Briggs,Computer Architecture and Parallel Processing. New York: McGraw-Hill, 1984.
[37] K. Hwang, P.-S. Tseng, and D. Kim, "An orthogonal multiprocessor for parallel scientific computations,"IEEE Trans. Comput., vol. 38, no. 1, 1989.
[38] K. Hwanget. al., "OMP: A RISC-based multiprocessor using orthogonal access memories and multiple spanning buses," inProc. Int. Conf. Super Comput.(Amsterdam), 1990, pp. 7-22.
[39] H. Ibrahim, J. Kender, and D. Shaw, "Low-level image analysis tasks on fine-grained tree-structered SIMD machines,"J. Parallel Distributed Comput., vol. 4, pp. 546-574, 1987.
[40] "The INTEL concurrent computer," INTEL Corp., Portland, OR, 1985.
[41] J. Ja'Ja' and R. M. Owens, "An architecture for a VLSI FFT processor,"INTEGRATION VLSI J., vol. 1, no. 4, pp. 305-316, 1983.
[42] C. E. Kim, "On the cellular convexity of complexes,"IEEE Trans. Patt. Anal. Machine Intell., vol. PAMI-3, no. 6, pp. 617-625, 1981.
[43] S. R. Kosaraju, "Fast parallel processing array algorithms for some graph problems," inProc. 27th ACM Symp. Theory Comput., 1979, pp. 231-236.
[44] H. T. Kung and J. A. Webb, "Mapping image processing operations onto a linear systolic machine,"Distributed Comput., vol. 1, pp. 246-257, 1986.
[45] F. T. Leighton, "New lower bound techniques for VLSI," inProc. IEEE Symp. Foundations Comput. Sci., 1981, pp. 85-98.
[46] S. Levialdi, "On shrinking binary picture patterns,"Commun. ACM, Jan. 1972.
[47] H. Li and M. Maresca, "Polymorphic-torus architecture for computer vision,"IEEE Trans. Patt. Anal. Machine Intell., vol. 11, no. 3, pp. 233-243, 1989.
[48] J. Little, G. Blelloch, and T. Cass, "Algorithmic techniques for computer vision on a fine-grained parallel machine,"IEEE Trans. Patt. Anal. Machine Intell., vol. 11, no. 3, pp. 244-257, 1989.
[49] R. Lumia, L. Shapiro, and O. Zuniga, "A new connected components algorithm for virtual memory computers,"Comput. Vision Graphics Image Processing, vol. 22, pp. 287-300, 1983.
[50] C. Mead and L. Conway,Introduction to VLSI Systems. Reading, MA: Addison-Wesley, 1980, pp. 150-152.
[51] J. M. Marberg and E. Gafni, "Sorting in constant number of row and column phases on a mesh,"Algorithmica, vol. 3, pp. 561-572, 1988.
[52] D. L. Milgram, "Region extraction using convergent evidence,"Comput. Graphics Image Processing, vol. 5, no. 2, pp. 172-189, 1976.
[53] R. Miller and Q. F. Stout, "Geometric algorithms for digitized pictures on a mesh-connected computer,"IEEE Trans. Patt. Anal. Machine Intell., vol. PAMI-7, no. 2, pp. 216-228, 1985.
[54] R. Miller and Q. F. Stout, "Varying diameter and problem size on mesh-connected computers," inProc. Int. Conf. Parallel Processing, 1985, pp. 697-699.
[55] R. Miller and Q. F. Stout, "Data movement techniques for the pyramid computer,"SIAM J. Comput., vol. 16, pp. 38-60, 1987.
[56] R. Miller and Q. F. Stout, "Graph and image processing algorithms for the hypercube," inProc. 2nd Conf. Hypercube Multiprocessors, 1987, pp. 418-425.
[57] R. Miller, V. K. Prasanna Kumar, D. Reisis, and Q. F. Stout, "Meshes with reconfigurable buses," inProc. 5th MIT Conf. Advanced Res. VLSI(Cambridge, MA), 1988, pp. 163-178.
[58] M. Minsky and S. Papert,Perceptrons: An Introduction to Computational Geometry. Cambridge, MA: MIT Press, 1969.
[59] D. Nassimi and S. Sahni, "Finding connected components and connected ones on a mesh-connected parallel computer,"SIAM J. Comput., vol. 9, no. 4, pp. 744-757, 1980.
[60] D. Nassimi and S. Sahni, "Data broadcasting in SIMD computers,"IEEE Trans. Comput., vol. C-30, no. 2, pp. 101-107, 1981.
[61] D. Nassimi and S. Sahni, "Parallel permutation and sorting algorithms and a new generalized connection network,"J. ACM, vol. 29, no. 3, pp. 642-667, 1982.
[62] D. Nath, S. N. Maheshwari, and P. C. P. Bhatt, "Efficient VLSI networks for parallel processing based on orthogonal trees,"IEEE Trans. Comput., vol. C-32, no. 6, pp. 569-580, 1983.
[63] NCUBE. Product Report, NCUBE Corp., Beaverton, OR, 1986.
[64] D. Parkinson, D. J. Hunt, and K. S. MacQueen, "The AMT DAP 500," inProc. 33rd IEEE Comput. Conf.(San Francisco, CA), 1988, pp. 196-199.
[65] D. Parkinson, "Experiments in component labeling in a parallel computer," inParallel Architectures and Algorithms for Image Understanding(V. K. Prasanna Kumar, Ed.). New York: Academic, Jan. 1991.
[66] V. K. Prasanna Kumar and M. Eshaghian, "Parallel geometric algorithms for digitized pictures on mesh of trees organization," inProc. Int. Conf. Parallel Processing, 1986, pp. 270-273.
[67] V. K. Prasanna Kumar and C. S. Raghavendra, "Array processor with multiple broadcasting,"J. Parallel Distributed Comput., vol. 4, pp. 173-190, 1987.
[68] V. K. Prasanna Kumar and D. Reisis, "Image computations on meshes with multiple broadcast,"IEEE Trans. Patt. Anal. Machine Intell., vol. 11, no. 11, pp. 1194-1202, Nov. 1989.
[69] K. Preston, Jr., "Use of Golay logic processor in pattern recognition studies using hexagonal neighborhood logic," inComputers and Automata(J. Fox, Ed.). New York, NY: Polytechnic, 1971, pp. 609-623.
[70] K. Preston, "Cellular logic computers for pattern recognition,"Comput., vol. 16, pp. 36-47, 1983.
[71] K. W. Przytula, J. G. Nash, and S. Hansen, "Fast Fourier transform for two-dimensional array of processors," inSPIE Symp. Optical Optoelectron. Appl. Sci. Eng.(San Diego), Aug. 1987.
[72] D. Reisis and V. K. Prasanna Kumar, "VLSI arrays with reconfigurable buses," inProc. Int. Conf. Supercomput.(Athens, Greece), June 1987.
[73] I. N. Robinson and W. R. Moore, "A parallel processing array architecture and its implementation in silicon," inProc. IEEE Custom Integrated Circuits Conf.(Rochester, NY), 1982.
[74] A. Rosenfeld, "Connectivity in digital pictures,"J. ACM, Jan. 1970.
[75] A. Rosenfeld, "Parallel image processing using cellular arrays,"IEEE Comput., vol. 16, 1983.
[76] A. Rosenfeld and A. Kak,Digital Picture Processing, New York: Academic, 1976.
[77] A. Rosenfeld and J. Pfaltz, "Sequential operations in digital picture processing,"J. ACM, vol. 4, 1966.
[78] H. Samet, "Connected component labeling using quadtrees,"J. ACM, vol. 28, pp. 487-501, July 1981.
[79] H. Samet and M. Tamminen, "Efficient component labeling of images of arbitrary dimension represented by linear bintrees,"IEEE Trans. Patt. Anal. Machine Intell., vol. 10, no. 4, pp. 579-586, 1988.
[80] Y. Saad and M. Schultz, "Topological properties of hypercubes,"IEEE Trans. Comput., vol. 37, no. 7, pp. 867-872, 1988.
[81] J. L. C. Sanz and D. Petkovic, "Machine vision algorithms for automated inspection of thin-film disk heads,"IEEE Trans. Patt. Anal. Machine Intell., vol. 10, no. 6, pp. 830-848, 1988.
[82] I. D. Scherson and Y. Ma, "Analysis and applications of an orthogonal access multiprocessor,"J. Parallel Distributed Comput., vol. 7, pp. 232-255, 1989.
[83] Y. Shiloach and U. Vishkin, "AnO(logn)parallel connectivity algorithm,"J. Algorithms, vol. 3, 1982.
[84] D. B. Shu and J. G. Nash, "Minimum spanning tree on an image understanding architecture," Tech. Rep., Hughes Malibu Res. Lab., 1987.
[85] H. S. Stone, "Parallel processing with the perfect shuffle,"IEEE Trans. Comput., vol. C-20, no. 2, 1971.
[86] Q. F. Stout, Personal communication, 1986.
[87] M. H. Sunwoo, B. S. Baroody, and J. K. Aggarwal, "A parallel algorithm for region labeling," inProc. IEEE Workshop Comput. Architecture Patt. Anal. Machine Intell.(Seattle, WA), 1987, pp. 27-34.
[88] S. L. Tanimoto, "A hierarchical cellular logic for pyramid computers,"J. Parallel Distributed Comput., vol. 1, pp. 105-132, 1984.
[89] R. E. Tarjan, "Efficiency of a good but non linear set union algorithm,"J. ACM, vol. 22, pp. 215-225, 1975.
[90] R. Tarjan and U. Vishkin, "Finding biconnected components and computing tree functions in logarithmic parallel time," inProc. 25th Ann. Symp. Founations Comput. Sci., 1984.
[91] C. D. Thompson, "Area-time complexity for VLSI," inProc. Eleventh Annu. ACM Symp. Theory Comput., 1979, pp. 81-88.
[92] P. S. Tseng, K. Hwang, and V. K. Prasanna Kumar, "A VLSI based multiprocessor architecture for implementing parallel algorithms," inProc. Int. Conf. Parallel Processing, 1985.
[93] L. W. Tucker, "Labeling connected-components on a massively parallel tree machine," inProc. IEEE Conf. Comput. Vision Pattern Recogn., 1986, pp. 124-129.
[94] J. Ullman,Computational Aspects of VLSI. Comput. Sci. Press, 1984.
[95] S. H. Unger, "A computer oriented toward spatial problems,"Proc. IRE, vol. 46, pp. 1744-1754, 1958.
[96] R. S. Wallace and M. D. Howard, "HBA vision architecture: Built and bench marked,"IEEE Trans. Patt. Anal. Machine Intell., vol. 11, no. 3, pp. 227-232, 1989.
[97] J. C. Wyllie, "The complexity of parallel computations," Ph.D. dissertation, Dep. Comput. Sci., Cornell Univ., Ithaca, NY, 1979.
[98] X. D. Yang, "Design of fast connected components hardware," inProc. IEEE Conf. Comput. Vision Patt. Recogn., 1988.

Index Terms:
parallel architectures; computer vision; image component labeling; parallel algorithms; computer vision; image recognition; parallel algorithms; parallel architectures
Citation:
H.M. Alnuweiri, V.K. Prasanna, "Parallel Architectures and Algorithms for Image Component Labeling," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 14, no. 10, pp. 1014-1034, Oct. 1992, doi:10.1109/34.159904
Usage of this product signifies your acceptance of the Terms of Use.