Fast rule identification and neighborhood selection for cellular automata.

School of Computer Science and Informatics, Cardiff University, Cardiff, UK.
IEEE transactions on systems, man, and cybernetics. Part B, Cybernetics: a publication of the IEEE Systems, Man, and Cybernetics Society (Impact Factor: 3.01). 12/2010; 41(3):749-60. DOI: 10.1109/TSMCB.2010.2091271
Source: PubMed

ABSTRACT Cellular automata (CA) with given evolution rules have been widely investigated, but the inverse problem of extracting CA rules from observed data is less studied. Current CA rule extraction approaches are both time consuming and inefficient when selecting neighborhoods. We give a novel approach to identifying CA rules from observed data and selecting CA neighborhoods based on the identified CA model. Our identification algorithm uses a model linear in its parameters and gives a unified framework for representing the identification problem for both deterministic and probabilistic CA. Parameters are estimated based on a minimum variance criterion. An incremental procedure is applied during CA identification to select an initial coarse neighborhood. Redundant cells in the neighborhood are then removed based on parameter estimates, and the neighborhood size is determined using the Bayesian information criterion. Experimental results show the effectiveness of our algorithm and that it outperforms other leading CA identification algorithms.

  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: An important step in the identification of cellular automata (CA) is to detect the correct neighborhood before parameter estimation. Many authors have suggested procedures based on the removal of redundant neighbors from a very large initial neighborhood one by one to find the real model, but this often induces ill conditioning and overfitting. This is true particularly for a large initial neighborhood where there are few significant terms, and this will be demonstrated by an example in this paper. By introducing a new criteria and three new techniques, this paper proposes a new adaptive fast CA orthogonal-least-square (Adaptive-FCA-OLS) algorithm, which cannot only adaptively search for the correct neighborhood without any preset tolerance but can also considerably reduce the computational complexity and memory usage. Several numerical examples demonstrate that the Adaptive-FCA-OLS algorithm has better robustness to noise and to the size of the initial neighborhood than other recently developed neighborhood detection methods in the identification of binary CA.
    IEEE transactions on systems, man, and cybernetics. Part B, Cybernetics: a publication of the IEEE Systems, Man, and Cybernetics Society 06/2012; · 3.01 Impact Factor
  • [Show abstract] [Hide abstract]
    ABSTRACT: According to the maximum likelihood principle, a maximum likelihood least squares identification method is presented for input nonlinear finite impulse response moving average (IN-FIR-MA) systems (e.g., Hammerstein FIR-MA systems). The simulation results indicate that the proposed algorithm is effective.
    Mathematical and Computer Modelling 02/2012; 55:442-450. · 2.02 Impact Factor
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: Ahstract-A common image forgery method is copy-move forgery (CMF), where part of an image is copied and moved to a new location. Identification of CMF can be conducted by detection of duplicated regions in the image. This paper presents a new approach for CMF detection where cellular automata (CA) are used. The main idea is to divide an image into overlapping blocks and use CA to learn a set of rules. Those rules appropriately describe the intensity changes in every block and are used as features for detection of duplicated areas in the image. Use of CA for image processing implies use of pixels' intensities as cell states, leading to a combinatorial explosion in the number of possible rules and subsets of those rules. Therefore, we propose a reduced description based on a proper binary representation using local binary patterns (LBPs). For detection of plain CMF, where no transformation of the copied area is applied, sufficient detection is accomplished by ID CA. The main issue of the proposed method is its sensitivity to post-processing methods, such as the addition of noise or blurring. Coping with that is possible by pre-processing of the image using an averaging filter.
    IWSSIP 2014; 05/2014

Full-text (2 Sources)

Available from
May 28, 2014