Parallel Algorithms for Gray-Scale Digitized Picture Component Labeling on a Mesh-Connected Computer

Abstract We consider the problem of labeling connected components in a gray-scale image so that every component is connected, the maximum difference in the gray-scale values of the pixels within any component does not exceed a given value, and no component can be merged with a neighboring component. We develop two asymptotically optimal θ(n) time algorithms for generating such labelings on a mesh-connected computer when the image is mapped onto the mesh with one pixel per processor. The first algorithm operates directly on the image and is based on a divide-and-conquer approach. Although it is simple, it has the potential drawback of possibly assigning two adjacent pixels with the same gray-scale value to different components. The second algorithm avoids this potential drawback. It works with a graph representation of the image and it allows larger components to be formed from smaller ones by taking into account properties and characteristics of the smaller components.

[1]  T. Pavlidis.  Algorithms for Graphics and Image Processing , 1981, Springer Berlin Heidelberg.

[2]  Andrew V. Goldberg,et al.  Parallel Symmetry-Breaking in Sparse Graphs , 1988, SIAM J. Discret. Math..

[3]  H. T. Kung,et al.  Sorting on a mesh-connected parallel computer , 1977, CACM.

[4]  Mikhail J. Atallah,et al.  Solving tree problems on a mesh-connected processor array , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

[5]  Richard M. Karp,et al.  Parallel Algorithms for Shared-Memory Machines , 1991, Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity.

[6]  Marek Chrobak,et al.  Optimal Parallel 5-Colouring of Planar Graphs , 1989, SIAM J. Comput..

[7]  Sartaj Sahni,et al.  Finding Connected Components and Connected Ones on a Mesh-Connected Parallel Computer , 1980, SIAM J. Comput..

[8]  J. A. Bondy,et al.  Graph Theory with Applications , 1978 .

[9]  Quentin F. Stout.  Tree-Based Graph Algorithms for Some Parallel Computers , 1985, ICPP.

[10]  Azriel Rosenfeld,et al.  Hierarchical Image Analysis Using Irregular Tessellations , 1990, IEEE Trans. Pattern Anal. Mach. Intell..

[11]  Mikhail J. Atallah,et al.  Multisearch techniques for implementing data structures on a mesh-connected computer (preliminary version) , 1991, SPAA '91.

[12]  Sartaj Sahni,et al.  Data broadcasting in SIMD computers , 1981, IEEE Transactions on Computers.

[13]  Russ Miller,et al.  Parallel algorithms for regular architectures - meshes and pyramids , 1996 .

[14]  F. Leighton,et al.  Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes , 1991 .

[15]  Norishige Chiba,et al.  A Linear 5-Coloring Algorithm of Planar Graphs , 1981, J. Algorithms.

[16]  Susanne E. Hambrusch,et al.  Parallel algorithms for determining k-width- connectivity in binary images , 1990, Proceedings of the Second IEEE Symposium on Parallel and Distributed Processing 1990.

[17]  Sartaj Sahni,et al.  Bitonic Sort on a Mesh-Connected Parallel Computer , 1979, IEEE Transactions on Computers.