Theta (1) algorithm for image component labeling in a mesh connected computer

A labeling algorithm for the components of a multicolored image is proposed. This image is registered in a size n*n mesh-connected computer. Each pixel is associated with a processing element. The number of operations necessary for component labeling is fixed independently of the value of n. >

[1]  Jake K. Aggarwal,et al.  Parallel 2-D Convolution on a Mesh Connected Array Processor , 1987, IEEE Transactions on Pattern Analysis and Machine Intelligence.

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

[3]  Russ Miller,et al.  Geometric Algorithms for Digitized Pictures on a Mesh-Connected Computer , 1985, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[4]  Russ Miller,et al.  Data Movement Techniques for the Pyramid Computer , 1987, SIAM J. Comput..

[5]  Frank Dehne,et al.  O(n^(1/2)) Algorithms for the Maximal Elements and ECDF Searching Problem on a Mesh-Connected Parallel Computer , 1986, Inf. Process. Lett..

[6]  M. Maresca,et al.  Connected component labeling on polymorphic torus architecture , 1988, Proceedings CVPR '88: The Computer Society Conference on Computer Vision and Pattern Recognition.

[7]  Ajit Agrawal,et al.  A Parallel O(log N) Algorithm for Finding Connected Components In Planar Images , 1987, ICPP.

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