Conceptualizing Birkhoff's Aesthetic Measure Using Shannon Entropy and Kolmogorov Complexity

dc.contributor.authorRigau, Jaumeen_US
dc.contributor.authorFeixas, Miquelen_US
dc.contributor.authorSbert, Mateuen_US
dc.contributor.editorDouglas W. Cunningham and Gary Meyer and Laszlo Neumannen_US
dc.date.accessioned2013-10-22T07:39:42Z
dc.date.available2013-10-22T07:39:42Z
dc.date.issued2007en_US
dc.description.abstractIn 1928, George D. Birkhoff introduced the Aesthetic Measure, defined as the ratio between order and complexity, and, in 1965, Max Bense analyzed Birkhoff s measure from an information theory point of view. In this paper, the concepts of order and complexity in an image (in our case, a painting) are analyzed in the light of Shannon entropy and Kolmogorov complexity. We also present a new vision of the creative process: the initial uncertainty, obtained from the Shannon entropy of the repertoire (palette), is transformed into algorithmic information content, defined by the Kolmogorov complexity of the image. From this perspective, the Birkhoff s Aesthetic Measure is presented as the ratio between the algorithmic reduction of uncertainty (order) and the initial uncertainty (complexity). The measures proposed are applied to several works of Mondrian, Pollock, and van Gogh.en_US
dc.description.seriesinformationComputational Aesthetics in Graphics, Visualization, and Imagingen_US
dc.identifier.isbn978-3-905673-43-2en_US
dc.identifier.issn1816-0859en_US
dc.identifier.urihttps://doi.org/10.2312/COMPAESTH/COMPAESTH07/105-112en_US
dc.publisherThe Eurographics Associationen_US
dc.subjectCategories and Subject Descriptors (according to ACM CCS): I.4 [Computing Methodologies]: Image Processing and Computer Vision J.5 [Computer Applications]: Arts and Humanitiesen_US
dc.titleConceptualizing Birkhoff's Aesthetic Measure Using Shannon Entropy and Kolmogorov Complexityen_US
Files
Original bundle
Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
105-112.pdf
Size:
430.54 KB
Format:
Adobe Portable Document Format