论文信息 - Parallel Asynchronous Connected Components in a Mesh

Parallel Asynchronous Connected Components in a Mesh

Abstract Leviald introduced a parallel synchronous algorithm for counting the number of connected components in a binary image embedded in an n × n mesh of processors that runs in time O( n ).We describe a parallel asynchronous algorithm for the same problem achieving the same time bound.

Susanne E. Hambrusch | Michael Luby

[1] S. Kung,et al. VLSI Array processors , 1985, IEEE ASSP Magazine.

[2] John N. Tsitsiklis,et al. Parallel and distributed computation , 1989 .

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

[4] Juha Röning,et al. Algorithms and Architectures for Machine Vision , 1989 .

[5] Jorge L. C. Sanz,et al. Algorithms for Image Component Labeling on SIMD Mesh-Connected Computers , 1987, IEEE Trans. Computers.

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

[7] Stefano Levialdi,et al. On shrinking binary picture patterns , 1972, CACM.