Classification of cellular automata through texture analysis

被引:6
作者
da Silva, Nubia Rosa [1 ,2 ]
Baetens, Jan M. [3 ]
da Silva Oliveira, Marcos William [1 ,2 ]
De Baets, Bernard
Bruno, Odemir Martinez [1 ,2 ]
机构
[1] Univ Sao Paulo, Inst Math & Comp Sci, Ave Trabaihador Sao Carlense 400, BR-13566590 Sao Carlos, SP, Brazil
[2] Univ Sao Paulo, Sao Carlos Inst Phys, Sci Comp Grp, POB 369, BR-13560970 Sao Carlos, SP, Brazil
[3] Univ Ghent, Dept Math Modelling Stat & Bioinformat, KERMIT, Coupure Links 653, B-9000 Ghent, Belgium
基金
巴西圣保罗研究基金会;
关键词
Cellular automata; Pattern recognition; Image analysis; Texture analysis; Classification; PERCEPTION;
D O I
10.1016/j.ins.2016.07.005
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
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.
引用
收藏
页码:33 / 49
页数:17
相关论文
共 31 条
[1]   INSTANCE-BASED LEARNING ALGORITHMS [J].
AHA, DW ;
KIBLER, D ;
ALBERT, MK .
MACHINE LEARNING, 1991, 6 (01) :37-66
[2]  
[Anonymous], J NONLINEAR IN PRESS
[3]  
[Anonymous], THESIS
[4]  
[Anonymous], 2020, Digital Image Processing using Matlab
[5]  
[Anonymous], PHYS D, DOI DOI 10.1016/J.NEUNET.2007.04.017
[6]  
[Anonymous], 2001, CELLULAR AUTOMATA A, DOI DOI 10.1142/4702
[7]   DAMAGE SPREADING AND LYAPUNOV EXPONENTS IN CELLULAR AUTOMATA [J].
BAGNOLI, F ;
RECHTMAN, R ;
RUFFO, S .
PHYSICS LETTERS A, 1992, 172 (1-2) :34-38
[8]   Texture synthesis and perception: Using computational models to study texture representations in the human visual system [J].
Balas, BJ .
VISION RESEARCH, 2006, 46 (03) :299-309
[9]   A cellular automata model of Ebola virus dynamics [J].
Burkhead, Emily ;
Hawkins, Jane .
PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS, 2015, 438 :424-435
[10]  
Deutsch A., 2005, CELLULAR AUTOMATON M