This work investigates binary pattern formations of two-dimensional standard cellular neural networks (CNN) as well as the complexity of the binary patterns. The complexity is measured by the exponential growth rate in which the patterns grow as the size of the lattice increases, i.e. spatial entropy. We propose an algorithm to generate the patterns in the finite lattice for general two-dimensional CNN. For the simplest two-dimensional template, the parameter space is split up into finitely many regions which give rise to different binary patterns. Qualitatively, the global patterns are classified for each region. Quantitatively, the upper bound of the spatial entropy is estimated by computing the number of patterns in the finite lattice, and the lower bound is given by observing a maximal set of patterns of a suitable size which can be adjacent to each other.
|頁（從 - 到）||115-128|
|期刊||International Journal of Bifurcation and Chaos in Applied Sciences and Engineering|
|出版狀態||Published - 1 一月 2002|