Perceptual Complexity as Normalized Shannon Entropy

Complexity is one of the most important variables in how the brain performs decision making based on esthetic values. Multiple definitions of perceptual complexity have been proposed, with one of the most fruitful being the Normalized Shannon Entropy one. However, the Normalized Shannon Entropy definition has theoretical gaps that we address in this article. Focusing on visual perception, we first address whether normalization fully corrects for the effects of measurement resolution on entropy. The answer is negative, but the remaining effects are minor, and we propose alternate definitions of complexity, correcting this problem. Related to resolution, we discuss the ideal spatial range in the computation of spatial complexity. The results show that this range must be small but not too small. Furthermore, it is suggested by the analysis of this range that perceptual spatial complexity is based solely on translational isometry. Finally, we study how the complexities of distinct visual variables interact. We argue that the complexities of the variables of interest to the brain's visual system may not interact linearly because of interclass correlation. But the interaction would be linear if the brain weighed complexities as in Kempthorne's lambda-Bayes-based compromise problem. We finish by listing several experimental tests of these theoretical ideas on complexity.