Information Hiding Based on Statistical Features of Self-Organizing Patterns

A computational technique for the determination of optimal hiding conditions of a digital image in a self-organizing pattern is presented in this paper. Three statistical features of the developing pattern (the Wada index based on the weighted and truncated Shannon entropy, the mean of the brightness of the pattern, and the p-value of the Kolmogorov-Smirnov criterion for the normality testing of the distribution function) are used for that purpose. The transition from the small-scale chaos of the initial conditions to the large-scale chaos of the developed pattern is observed during the evolution of the self-organizing system. Computational experiments are performed with the stripe-type patterns, spot-type patterns, and unstable patterns. It appears that optimal image hiding conditions are secured when the Wada index stabilizes after the initial decline, the mean of the brightness of the pattern remains stable before dropping down significantly below the average, and the p-value indicates that the distribution becomes Gaussian.