Fast parallel thinning algorithms: parallel speed and connectivity preservation

A recently published parallel thinning approach [4] is evaluated. An improvement is suggested to enable preservation of certain diagonal lines which are not preserved by this algorithm. A unified notion of what is meant by an iteration (or subiteration) and parallel speed is presented, and with regard to its parallel speed this algorithm is argued to be comparable to other two-subiteration algorithms. The parallel speed of this algorithm is compared experimentally to the original algorithm that it improves [12] and it is shown that, unlike execution time on a specific machine, parallel speed is not improved. Finally, a more complete connectivity analysis is given illustrating sufficient additional conditions for applying fully in parallel the basic thinning operator used in both algorithms while maintaining all image connectivity properties.

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

[2]  N. Metropolis,et al.  Equation of State Calculations by Fast Computing Machines , 1953, Resonance.

[3]  David M. Nicol,et al.  Problem oriented protocol design , 1984, WSC '84.

[4]  Zicheng Guo,et al.  Parallel thinning with two-subiteration algorithms , 1989, Commun. ACM.

[5]  David M. Nicol,et al.  Parallel discrete-event simulation of FCFS stochastic queueing networks , 1988, PPEALS '88.

[6]  David M. Nicol,et al.  An optimal repartitioning decision policy , 1985, WSC '85.

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

[8]  Allen D. Malony,et al.  Parallel Discrete Event Simulation Using Shared Memory , 1988, IEEE Trans. Software Eng..

[9]  Eric G. Manning,et al.  Distributed Simulation Using a Network of Processors , 1979, Comput. Networks.

[10]  E. Dubois,et al.  Digital picture processing , 1985, Proceedings of the IEEE.

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

[12]  Azriel Rosenfeld,et al.  Digital Picture Processing , 1976 .

[13]  P. S. P. Wang,et al.  A Fast Serial and Parallel Thinning Algorithm , 1986 .

[14]  Jayadev Misra,et al.  Distributed discrete-event simulation , 1986, CSUR.

[15]  Stefano Levialdi,et al.  Parallel thinning of binary pictures , 1975 .

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

[17]  M NicolDavid.  Parallel discrete-event simulation of FCFS stochastic queueing networks , 1988 .

[18]  Marcel J. E. Golay,et al.  Hexagonal Parallel Pattern Transformations , 1969, IEEE Transactions on Computers.

[19]  B. Ripley,et al.  Pattern Recognition , 1968, Nature.

[20]  David M. Nicol.  Synchronizing network performance , 1984 .

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