Published in

Elsevier, Information Sciences, (370-371), p. 33-49, 2016

DOI: 10.1016/j.ins.2016.07.005

Links

Tools

Export citation

Search in Google Scholar

Classification of cellular automata through texture analysis

This paper was not found in any repository, but could be made available legally by the author.
This paper was not found in any repository, but could be made available legally by the author.

Full text: Unavailable

Green circle
Preprint: archiving allowed
Orange circle
Postprint: archiving restricted
Red circle
Published version: archiving forbidden
Data provided by SHERPA/RoMEO

Abstract

The spatio-temporal dynamics of cellular automata (CAs) has attracted the attention of researchers from different fields, mainly mathematics, computer science and engineering, as a consequence of both the intriguing spatio-temporal patterns that these dynamical systems evolve and the fact that they enable the modelling of complex natural phenomena. Yet, to this day, there are only a few studies that focus on the automated classification of cellular automata on the basis of the space-time diagrams they evolve. Here, we present an innovative approach to classify CAs according to Wolfram's classification scheme in an automated way by relying on texture descriptors that capture the nature of the evolved space-time diagrams. More specifically, we propose the use of one of two well-known texture descriptors, namely Local Binary Pattern Variance and Fourier descriptors, to generate features grasping the diagrams' nature, followed by nearest neighbor classification. The performance of this approach is assessed through a cross-validation and by analysing the percentage of pre-classified rules that is required to arrive at an acceptable success rate. The experiments involve the family of elementary CAs and four families of totalistic CAs with neighborhood radii ranging from one to three, and a state space consisting of up to three states. The results show the potential of our proposal with success rates varying between 65% and 98% depending on the size of the training set, which ranges from 10% to 90% of the rules in the CA family at stake. For totalistic CAs, this training set should be classified manually to start the process of automated classification. (C) 2016 Published by Elsevier Inc.