This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Algorithms for Image Component Labeling on SIMD Mesh-Connected Computers
February 1990 (vol. 39 no. 2)
pp. 276-281

Two parallel algorithms are presented for the problem of labeling the connected components of a binary image. The machine model is an SIMD two-dimensional mesh-connected computer consisting of an N*N array of processing elements, each containing a single pixel of an N*N image. Both new algorithms use a local shrinking operation defined by S. Levialdi (1972) and have time complexities of O(N log N) bit operations, making them the fastest local algorithms for the problem. Compared to other approaches with similar or better asymptotic time complexities, this local approach greatly simplifies the algorithms and reduces the constants of proportionality by nearly two orders of magnitude, making them the first practical algorithms for the problem. The two algorithms differ in the amount of memory required per processing element; the first uses O(N) bits, while the second uses a novel compression scheme to reduce the requirement to O(log N) bits.

[1] F. Veillon, "One pass computation of morphological and geometrical properties of objects in digital pictures,"Signal Processing, vol. 1, pp. 175-189, 1979.
[2] R. Hummel and A. Rojer, "Implementing a parallel connected component algorithm on MIMD architectures," inProc. Workshop Comput. Architecture Pattern Analysis Image Data Base Management, Miami, FL, IEEE, 1985.
[3] 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.
[4] W. D. Hillis and G. L. Steele, Jr., "Data parallel algorithms,"Commun. ACM, vol. 29, no. 12, pp. 1170-1183, Dec. 1986.
[5] A. Agraval and A. Kulkarni, "A sequential approach to the extraction of shape features,"CVGIP, vol. 6, pp. 538-557, 1977.
[6] Q. F. Stout, "Using clerks in parallel processing," inProc. 23rd Annu. Symp. Foundations Comput. Sci., 1983, vol. 272-279.
[7] M. J. B. Duff, "Review of the CLIP image processing system," inProc. Nat. Comput. Conf., Anaheim, CA, 1978.
[8] K. E. Batcher, "Design of a massively parallel processor,"IEEE Trans. Comput., vol. C-29, pp. 836-840, 1980.
[9] NCR Microelectronics Division, Product Description ncr 45cg72, NCR Corp., Dayton, OH, 1984.
[10] R. Miller and Q. Stout, "Varying diameter and problem size in mesh connected computers," inProc. Int. Conf. Parallel Processing, IEEE, 1985.
[11] T. J. Fountain, "Plans for the CLIP7 Chip," inIntegrated Technology for Parallel Image Processing, S. Levialdi, Ed. New York: Academic, 1985, pp. 199-214.
[12] K. N. Matthews, "The CLIP7 Image Analyser--A multi-bit processor array," Ph.D. dissertation, Univ. of London, 1986.
[13] C. Dyer and A. Rosenfeld, "Parallel image processing by memory-augmented cellular automata,"IEEE Trans. Pattern Anal. Machine Intell., vol. PAMI-3, pp. 29-41, 1981.
[14] S. R. Kosaraju, "Fast parallel processing array algorithms for some graph problems," inProc. 27th ACM Symp. Theory Comput., 1979, pp. 231-236.
[15] S. Levialdi, "On shrinking binary picture patterns,"Commun. ACM, Jan. 1972.

Index Terms:
SIMD mesh-connected computers; parallel algorithms; binary image; machine model; local shrinking operation; time complexities; compression scheme; computerised picture processing; parallel algorithms.
Citation:
R.E. Cypher, J.L.C. Sanz, L. Snyder, "Algorithms for Image Component Labeling on SIMD Mesh-Connected Computers," IEEE Transactions on Computers, vol. 39, no. 2, pp. 276-281, Feb. 1990, doi:10.1109/12.45215
Usage of this product signifies your acceptance of the Terms of Use.