Cellular automata labeling of connected components in n-dimensional binary lattices

A new cellular automata-based algorithm for labeling of connected components in n -dimensional binary lattices, for n ≥ 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 dat...

Full description

Saved in:
Bibliographic Details
Published in:The Journal of supercomputing Vol. 72; no. 11; pp. 4221 - 4232
Main Authors: Stamatovic, Biljana, Trobec, Roman
Format: Journal Article
Language:English
Published: New York Springer US 01.11.2016
Springer Nature B.V
Subjects:
Algorithms
Cellular automata
Compilers
Computer Science
Interpreters
Labeling
Lattices
Processor Architectures
Programming environments
Programming Languages
Connected components
Parallel algorithm
Data-flow
Cellular automata
Image
Lattice
Dimensional
ISSN:0920-8542, 1573-0484
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:A new cellular automata-based algorithm for labeling of connected components in n -dimensional binary lattices, for n ≥ 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 O ( L ) on L n binary lattices. However, some worst-case arrangements of the n -dimensional lattice cells could require O ( L n ) calculation steps.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0920-8542
1573-0484
DOI:10.1007/s11227-016-1761-4