# Avenues for the use of cellular automata in image segmentation

## Abstract

The majority of Cellular Automata (CA) described in the literature are binary or three-state. While several abstractions are possible to generalise to more than three states, only a negligible number of multi-state CA rules exist with concrete practical applications.

This paper proposes a generic rule for multi-state CA. The rule allows for any number of states, and allows for the states are semantically related. The rule is illustrated on the concrete example of image segmentation, where the CA agents are pixels in an image, and their states are the pixels’ greyscale values.

We investigate in detail the proposed rule and some of its variations, and we also compare its effectiveness against its closest relative, the existing Greenberg–Hastings automaton. We apply the proposed methods to both synthetic and real-world images, evaluating the results with a variety of measures. The experimental results demonstrate that our proposed method can segment images accurately and effectively.

## Authors

Laura Dioşan
Department of Computer Science, Babes-Bolyai University, Cluj-Napoca, Romania

Anca Andreica
Department of Computer Science, Babes-Bolyai University, Cluj-Napoca, Romania

Imre Boros
Department of Computer Science, Babes-Bolyai University, Cluj-Napoca, Romania

Irina Voiculescu
Department of Computer Science, University of Oxford, Oxford, UK

## Keywords

unconstrained optimization problems; splitting; neural network training;

## Paper coordinates

Dioşan L., Andreica A., Boros I., Voiculescu I. (2017) Avenues for the Use of Cellular Automata in Image Segmentation. In: Squillero G., Sim K. (eds) Applications of Evolutionary Computation. EvoApplications 2017. Lecture Notes in Computer Science, vol 10199. Springer, Cham, https://doi.org/10.1007/978-3-319-55849-3_19

## PDF

?

##### Journal

European Conference on the Applications of Evolutionary Computation

Springer, Cham

##### Print ISSN

978-3-319-55848-6

##### Online ISSN

978-3-319-55849-3