Publication:
Labeling connected components in binary images based on cellular automata

Thumbnail Image
Identifiers
URI: https://hdl.handle.net/10016/21993
ISBN: 978-84-608-2581-4
Files
labeling_NESUS_2015.pdf (407.67 KB)
Publication date
2015-10
Defense date
Authors
Advisors
Tutors
Journal Title
Journal ISSN
Volume Title
Publisher
Impact
Google Scholar
Export
Research Projects
Organizational Units
Journal Issue
Abstract
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.
Description
Proceedings of: Second International Workshop on Sustainable Ultrascale Computing Systems (NESUS 2015). Krakow (Poland), September 10-11, 2015.
Keywords
Labeling connected components, Cellular automata, Data-flow
Bibliographic citation
Carretero Pérez, Jesús; et.al. (eds.). (2015) Proceedings of the Second International Workshop on Sustainable Ultrascale Computing Systems (NESUS 2015): Krakow, Poland. Universidad Carlos III de Madrid, pp. 41-44.
Collections
Second International Workshop on Sustainable Ultrascale Computing Systems (NESUS 2015)