Thinning in a distributed environment

In the digitization of survey maps where the components are sparse but occupy large areas, a serial thinning algorithm implemented on a distributed environment can yield a better speedup than is possible with other forms of parallelism. A distributed algorithm based on contour generation is described. A component is divided into rectangular sections and assigned to different processors. A block-resume synchronization mechanism is examined. The different contour configurations at the border of a section are identified. The amount of communication between neighboring sections can be kept to a minimum by chain code representations. The proposed synchronization mechanism has been incorporated in the contour generation thinning algorithm and has been simulated on a Sun/4 workstation. For images such as contour maps, the extra overhead needed for synchronization is not significant.<<ETX>>

[1]  Wen Xu,et al.  CGT: A fast thinning algorithm implemented on a sequential computer , 1987, IEEE Transactions on Systems, Man, and Cybernetics.

[2]  C. J. Hilditch,et al.  Linear Skeletons From Square Cupboards , 1969 .

[3]  David R. Jefferson,et al.  Virtual time , 1985, ICPP.

[4]  Herbert Freeman,et al.  On the Encoding of Arbitrary Geometric Configurations , 1961, IRE Trans. Electron. Comput..

[5]  Ronald H. Perrott,et al.  An improved parallel thinning algorithm , 1987, CACM.

[6]  Ching Y. Suen,et al.  A fast parallel algorithm for thinning digital patterns , 1984, CACM.

[7]  Ben J. H. Verwer,et al.  Improved metrics in image processing applied to the Hilditch skeleton , 1988, [1988 Proceedings] 9th International Conference on Pattern Recognition.

[8]  Martin D. Levine,et al.  Multiple Resolution Skeletons , 1987, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[9]  K. Mani Chandy,et al.  Parallel program design - a foundation , 1988 .

[10]  Carlo Arcelli,et al.  Pattern thinning by contour tracing , 1981 .

[11]  Patrick Shen-Pei Wang,et al.  A comment on “a fast parallel algorithm for thinning digital patterns” , 1986, CACM.

[12]  Lucas J. van Vliet,et al.  A contour processing method for fast binary neighbourhood operations , 1988, Pattern Recognit. Lett..

[13]  T. Pavlidis.  A thinning algorithm for discrete binary images , 1980 .

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

[15]  Azriel Rosenfeld,et al.  A Characterization of Parallel Thinning Algorithms , 1975, Inf. Control..

[16]  Paul C. K. Kwok,et al.  A thinning algorithm by contour generation , 1988, CACM.

[17]  Gabriella Sanniti di Baja,et al.  A Width-Independent Fast Thinning Algorithm , 1985, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[18]  Carlo Arcelli.  A condition for digital points removal , 1979 .

[19]  Azriel Rosenfeld,et al.  Some Parallel Thinning Algorithms for Digital Pictures , 1971, JACM.

[20]  Gabriella Sanniti di Baja,et al.  A One-Pass Two-Operation Process to Detect the Skeletal Pixels on the 4-Distance Transform , 1989, IEEE Trans. Pattern Anal. Mach. Intell..

[21]  Yun Xia,et al.  Skeletonization via the Realization of the Fire Front's Propagation and Extinction in Digital Binary Shapes , 1989, IEEE Trans. Pattern Anal. Mach. Intell..