2016
DOI: 10.1007/978-3-319-31008-4_6
|View full text |Cite
|
Sign up to set email alerts
|

Correlation Between Human Aesthetic Judgement and Spatial Complexity Measure

Abstract: Abstract. The quantitative evaluation of order and complexity conforming with human intuitive perception has been at the core of computational notions of aesthetics. Informational theories of aesthetics have taken advantage of entropy in measuring order and complexity of stimuli in relation to their aesthetic value. However entropy fails to discriminate structurally different patterns in a 2D plane. This paper investigates a computational measure of complexity, which is then compared to a results from a previo… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
6
0

Year Published

2017
2017
2024
2024

Publication Types

Select...
3
2
1

Relationship

0
6

Authors

Journals

citations
Cited by 8 publications
(6 citation statements)
references
References 35 publications
0
6
0
Order By: Relevance
“…Figure 16 shows the results of applying an information-gain-based approach proposed in [ 29 ] for the images in Figure 11 a. The results show a link between information gain and empirical aesthetic judgement in the case of the asymmetrical patterns, but not for the symmetrical patterns.…”
Section: Resultsmentioning
confidence: 99%
See 1 more Smart Citation
“…Figure 16 shows the results of applying an information-gain-based approach proposed in [ 29 ] for the images in Figure 11 a. The results show a link between information gain and empirical aesthetic judgement in the case of the asymmetrical patterns, but not for the symmetrical patterns.…”
Section: Resultsmentioning
confidence: 99%
“…Birkhoff [ 25 ] proposed an aesthetic measure, where the measure of aesthetic quality is in a direct relation to the degree of order O, and in a reverse relation to the complexity C, M = O/C. Eysenck [ 26 , 27 , 28 ] conducted a series of experiments on Birkhoff’s model; he argued that the aesthetic measure has to be in direct relation to the complexity rather than an inverse relation M = O × C. Javid et al [ 29 ] conducted a survey on the use of entropy to quantify order and complexity; they also proposed a computational measure of complexity. Their measure is based on the information gain from specifying the spatial distribution of pixels and their uniformity and non-uniformity.…”
Section: Related Workmentioning
confidence: 99%
“…We defined six measures that could be potential influencers of subjective ratings: density, entropy, local spatial complexity (LSC), KC (approximate), intricacy, and symmetry; these are described below. We chose these six measures since they are commonly studied in the literature as potential determinants of complexity and beauty judgments (Arnheim, 1956(Arnheim, , 1966Attneave, 1957;Bense, 1960Bense, , 1969Chikhman et al, 2012;Damiano et al, 2021;Fan et al, 2022;Friedenberg & Liby, 2016;Gartus & Leder, 2017;Javaheri Javid et al, 2016;Moles, 1958;Rigau et al, 2008;Roberts, 2007;Schmidhuber, 2009;Singh & Shukla, 2017;Silva et al, 2021;Snodgrass, 1971). We do not consider other popular measures such as number of vertices or edges since as remarked in the previous section, they are hard to define for our CA patterns.…”
Section: Computational Measures For Pattern Quantificationmentioning
confidence: 99%
“…We defined six measures that could potentially explain subjective complexity ratings: density, entropy, local spatial complexity, (approximate) Kolmogorov complexity, intricacy, and symmetry; these are described below. We chose these six measures since they are commonly studied in the literature as potential determinants of subjective complexity (Friedenberg and Liby, 2016;Fan et al, 2022;Nadal, 2007;Attneave, 1957;Gartus and Leder, 2017;Damiano et al, 2021;Snodgrass, 1971;Arnheim, 1956Arnheim, , 1966Bense, 1960Bense, , 1969Moles, 1958;Schmidhuber, 2009;Javid, 2016;Rigau, 2008;Chikhman et al, 2012;Singh and Shukla, 2017;Silva, 2021). We do not consider other popular measures such as number of vertices or edges since as remarked in the previous section, they are hard to define for our CA patterns.…”
Section: Computational Measures For Pattern Quantificationmentioning
confidence: 99%
“…To relate participant ratings of complexity on these patterns to objective measures, we programmed six computational complexity measures including density, entropy, local spatial complexity, Kolmogorov complexity, and local and global asymmetry. These measures have been considered frequently in past studies (Friedenberg and Liby, 2016;Fan et al, 2022;Nadal, 2007;Attneave, 1957;Gartus and Leder, 2017;Damiano et al, 2021;Snodgrass, 1971;Arnheim, 1956Arnheim, , 1966Bense, 1960Bense, , 1969Moles, 1958;Schmidhuber, 2009;Javid, 2016;Rigau, 2008;Chikhman et al, 2012;Singh and Shukla, 2017;Silva, 2021). We also introduced a novel intricacy measure which quantified the number of visual elements in a pattern using a graph-based approach.…”
Section: Metric For Complexitymentioning
confidence: 99%