On some structure–morphology problems by the extended partitioned iterated function system (PIFS-SF)

Using a newly developed technique of coding 2D sets (PIFS-SF) we have shown how to analyse the family of sets (images) given with different resolutions. Based on the number of codes (PIFS-SF) we have been able to describe quantitatively the high-resolution structure (HRS) and low-resolution structure (LRS), as well as supramolecular structure (SMS). Following the essence of aggregation processes (crystallization, gelation, clustering) we showed how different SMS, LRS and morphologies are generated. In a sense “by occasion” we also approached the problems of uniqueness of coding and data compression. To produce required images with different resolution we have employed a process of deterministic aggregation of cells (first generation aggregates – FGA) made of different generators (molecules) with the Sierpinski gasket as an attractor. An example of some real sets analysis has also been provided.