Patterns found among both living systems, such as fish scales, bones, and tree rings, and non-living systems, such as terrestrial and extraterrestrial dunes, microstructures of alloys, and geological seismic profiles, are comprised of anisotropic layers of different thicknesses and lengths. These layered patterns form a record of internal and external factors that regulate pattern formation in their various systems, making it potentially possible to recognize events in the formation history of these systems. In our previous work, we developed an empirical model (EM) of anisotropic layered patterns using an N-partite graph, denoted as G(N), and a Boolean function to formalize the layer structure. The concept of isotropic and anisotropic layers was presented and described in terms of the G(N) and Boolean function. The central element of the present work is the justification that arbitrary binary patterns are made up of such layers. It has been shown that within the frame of the proposed model, it is the isotropic and anisotropic layers themselves that are the building blocks of binary layered and arbitrary patterns; pixels play no role. This is why the EM can be used to describe the morphological characteristics of such patterns. We present the parameters disorder of layer structure, disorder of layer size, and pattern complexity to describe the degree of deviation of the structure and size of an arbitrary anisotropic pattern being studied from the structure and size of a layered isotropic analog. Experiments with arbitrary patterns, such as regular geometric figures, convex and concave polygons, contour maps, the shape of island coastlines, river meanders, historic texts, and artistic drawings are presented to illustrate the spectrum of problems that it may be possible to solve by applying the EM. The differences and similarities between the proposed and existing morphological characteristics of patterns has been discussed, as well as the pros and cons of the suggested method.
Monotone Boolean Functions with s Zeros Farthest from Threshold Functions
