Beauty and structural complexity

10/14/2019
by   Samy Lakhal, et al.
0

We revisit the long-standing question of the relation between image appreciation and its statistical properties. We generate two different sets of random images well distributed along three measures of entropic complexity. We run a large-scale survey in which people are asked to sort the images by preference, which reveals maximum appreciation at intermediate entropic complexity. We show that the algorithmic complexity of the coarse-grained images, expected to capture structural complexity while abstracting from high frequency noise, is a good predictor of preferences. Our analysis suggests that there might exist some universal quantitative criteria for aesthetic judgement.

READ FULL TEXT

page 2

page 4

research
03/18/2018

Complexity problems in enumerative combinatorics

We give a broad survey of recent results in Enumerative Combinatorics an...
research
04/18/2015

Time Resolution Dependence of Information Measures for Spiking Neurons: Atoms, Scaling, and Universality

The mutual information between stimulus and spike-train response is comm...
research
01/05/2022

Complexity and Aesthetics in Generative and Evolutionary Art

In this paper we examine the concept of complexity as it applies to gene...
research
04/26/2022

A New Spin on Color Quantization

We address the problem of image color quantization using a Maximum Entro...
research
09/15/2018

History of art paintings through the lens of entropy and complexity

Art is the ultimate expression of human creativity that is deeply influe...
research
11/27/2022

Diffusion Probabilistic Model Made Slim

Despite the recent visually-pleasing results achieved, the massive compu...
research
02/24/2011

Randomized algorithms for statistical image analysis and site percolation on square lattices

We propose a novel probabilistic method for detection of objects in nois...

Please sign up or login with your details

Forgot password? Click here to reset