We found a match
Your institution may have rights to this item. Sign in to continue.
- Title
Cellular automata labeling of connected components in n-dimensional binary lattices.
- Authors
Stamatovic, Biljana; Trobec, Roman
- Abstract
A new cellular automata-based algorithm for labeling of connected components in n-dimensional binary lattices, for $$n \ge 2$$ , is proposed. The algorithm for 3D binary images was implemented in NetLogo and MatLab programming environments. The algorithm is local and can be efficiently implemented on data-flow parallel platforms with an average asymptotic complexity of $$\mathcal{O}(L)$$ on $$L^n $$ binary lattices. However, some worst-case arrangements of the n-dimensional lattice cells could require $$\mathcal{O}(L^{n})$$ calculation steps.
- Subjects
SEQUENTIAL machine theory; PARALLEL processing; LATTICE networks; CELLULAR automata; DATA flow computing; MATHEMATICAL models
- Publication
Journal of Supercomputing, 2016, Vol 72, Issue 11, p4221
- ISSN
0920-8542
- Publication type
Article
- DOI
10.1007/s11227-016-1761-4