Cellular automata labeling of connected components in n-dimensional binary lattices.
Saved in:
| 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 |
| FullText | Links: – Type: pdflink Text: Availability: 0 |
|---|---|
| Header | DbId: egs DbLabel: Engineering Source An: 119139955 AccessLevel: 6 PubType: Academic Journal PubTypeId: academicJournal PreciseRelevancyScore: 0 |
| IllustrationInfo | |
| Items | – Name: Title Label: Title Group: Ti Data: Cellular automata labeling of connected components in n-dimensional binary lattices. – Name: Author Label: Authors Group: Au Data: <searchLink fieldCode="AR" term="%22Stamatovic%2C+Biljana%22">Stamatovic, Biljana</searchLink><relatesTo>1</relatesTo><i> biljana.stamatovic@udg.edu.me</i><br /><searchLink fieldCode="AR" term="%22Trobec%2C+Roman%22">Trobec, Roman</searchLink><relatesTo>2</relatesTo><i> roman.trobec@ijs.si</i> – Name: TitleSource Label: Source Group: Src Data: <searchLink fieldCode="JN" term="%22Journal+of+Supercomputing%22">Journal of Supercomputing</searchLink>. Nov2016, Vol. 72 Issue 11, p4221-4232. 12p. – Name: Subject Label: Subjects Group: Su Data: <searchLink fieldCode="DE" term="%22Sequential+machine+theory%22">Sequential machine theory</searchLink><br /><searchLink fieldCode="DE" term="%22Parallel+processing%22">Parallel processing</searchLink><br /><searchLink fieldCode="DE" term="%22Lattice+networks%22">Lattice networks</searchLink><br /><searchLink fieldCode="DE" term="%22Cellular+automata%22">Cellular automata</searchLink><br /><searchLink fieldCode="DE" term="%22Data+flow+computing%22">Data flow computing</searchLink><br /><searchLink fieldCode="DE" term="%22Mathematical+models%22">Mathematical models</searchLink> – Name: Abstract Label: Abstract Group: Ab Data: 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] – Name: AbstractSuppliedCopyright Label: Group: Ab Data: <i>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.</i> (Copyright applies to all Abstracts.) |
| PLink | https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=egs&AN=119139955 |
| RecordInfo | BibRecord: BibEntity: Identifiers: – Type: doi Value: 10.1007/s11227-016-1761-4 Languages: – Code: eng Text: English PhysicalDescription: Pagination: PageCount: 12 StartPage: 4221 Subjects: – SubjectFull: Sequential machine theory Type: general – SubjectFull: Parallel processing Type: general – SubjectFull: Lattice networks Type: general – SubjectFull: Cellular automata Type: general – SubjectFull: Data flow computing Type: general – SubjectFull: Mathematical models Type: general Titles: – TitleFull: Cellular automata labeling of connected components in n-dimensional binary lattices. Type: main BibRelationships: HasContributorRelationships: – PersonEntity: Name: NameFull: Stamatovic, Biljana – PersonEntity: Name: NameFull: Trobec, Roman IsPartOfRelationships: – BibEntity: Dates: – D: 01 M: 11 Text: Nov2016 Type: published Y: 2016 Identifiers: – Type: issn-print Value: 09208542 Numbering: – Type: volume Value: 72 – Type: issue Value: 11 Titles: – TitleFull: Journal of Supercomputing Type: main |
| ResultId | 1 |
