Labeling connected components in binary images based on cellular automata
2015
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
Labeling connected components in binary images based on cellular automata
Stamatovic, Biljana
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...
Download
2015
Stamatovic, Biljana
Data parallel algorithm in finding 2-D site percolation backbones
Stamatovic, Biljana
,
Trobec, Roman
Proceedings of: First International Workshop on Sustainable Ultrascale Computing Systems (NESUS 2014). Porto (Portugal), August 27-28, 2014.A data parallel solution approach formulated with cellular automata is proposed with a potential to become a part of future sustainable computers. It offers extreme parallelism on data-flow principles. If a problem can be formulated with a local and iterative methodology, so that data cell results always depend on neighbouring data items only, the cellular automata...
Download
2014
Stamatovic, Biljana
,
Trobec, Roman
