Labeling connected components in binary images based on cellular automata

Proceedings of: Second International Workshop on Sustainable Ultrascale Computing Systems (NESUS 2015). Krakow (Poland), September 10-11, 2015.This short paper introduce an algorithm for labeling connected components in n-dimensional binary images based on cellular automata, , n >= 2. Here is presented tree-dimensional binary images algorithm. The algorithm code was implemented in NetLogo programming environment. The algorithm is local and can be efficiently implemented on data-flow parallel platforms with an asymptotic complexity of O(L) on an L × L × L bynary image