Bibliographic Details
| Title: |
Cellular automata labeling of connected components in n-dimensional binary lattices. |
| Authors: |
Stamatovic, Biljana1 biljana.stamatovic@udg.edu.me, Trobec, Roman2 roman.trobec@ijs.si |
| Source: |
Journal of Supercomputing. Nov2016, Vol. 72 Issue 11, p4221-4232. 12p. |
| Subjects: |
Sequential machine theory, Parallel processing, Lattice networks, Cellular automata, Data flow computing, Mathematical models |
| 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. [ABSTRACT FROM AUTHOR] |
|
Copyright of Journal of Supercomputing is the property of Springer Nature and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) |
| Database: |
Engineering Source |
