Compression ensembles quantify aesthetic complexity and the evolution of visual art — TEI-tagged view

Andres Karjus, Mar Canet Solà, Tillmann Ohm, Sebastian E. Ahnert, Maximilian Schich · 2023 · data-science · doi:10.1140/epjds/s13688-023-00397-3 · TEI xml · tagged edition · index · concepts · authors
Where this record's text came from. 2026-09-08 schema-0.3 pass: every quote verified as an exact substring of the staged text and anchored at merge time; concept terms verified present; every edge endpoint an existing node.
Other fields define these differently the same word, defined another way in another discipline
deep learning 11 fields · Principal Component Analysis 5 fields · family resemblance 2 fields · aesthetic value 2 fields · cultural evolution 2 fields · NFT 2 fields
Tags on this paper every tag the record carries, whether or not the words occur in the text below — a number is how many papers in the corpus carry that tag; a tag with no number is unique to this paper
compression ensemble aesthetic complexity visual aesthetic complexity visual complexity algorithmic complexity Kolmogorov complexity compression ratios compressibility black-and-white transformation normalized compression distance algorithmic distance transformation temporal resemblance family resemblance3 image embeddings deep learning42 Principal Component Analysis37 UMAP2 artistic style connoisseurship cultural evolution3 aesthetic value4 ensemble methods NFT2 corpus-analysis16
Method, as described: apply many image-processing transformations to each image, compress each transformed image and divide by the original compression size to form a vector of compression ratios (plus fractal dimension and colorfulness), rescale, reduce with PCA/UMAP, then compare and cluster; validate against human complexity norms and classification tasks

Colour legend

EPJ Data Science<title level="j">A work — the journal / venue title.
2023<date>A year or date.

Andres KarjuspersName, Mar Canet SolàpersName, Tillmann OhmpersName, Sebastian E. AhnertpersName, Maximilian SchichpersName (2023date). “Compression ensembles quantify aesthetic complexity and the evolution of visual art.” EPJ Data Sciencetitle·j.

Object of study — the aesthetic complexityterm of images and its use to quantify and track the historical and contemporary evolution of visual art

Research question — whether simple vectors of compression ratiosterm are provably informative about visual complexityterm and artistic aestheticsterm·def, and can be used to track the evolution of visual art

Contribution — compression ensemblesterm·def - a computationally simple, transparent, explainable method that models aesthetic complexityterm as a multidimensional algorithmic phenomenon via many image transformationsterm followed by compression

Cross-disciplinary analysis
content-tags & facets: phenomenon · claim-type · cross-domain-transfer · mechanism · claim-relation · replication-status · limitation — grounded in the full text
phenomenonrelative visual/aesthetic complexity of images as a multidimensional algorithmic phenomenon, and its dynamics across historical and contemporary art — “As demonstrated below, compression ensembles can be used for estimating relative visual complexity as a multidimensional phenomenon; inferring specific aesthetic aspects of complexity where any two images or artist oeuvres differ; and as input to any predictive downstream tasks where image complexity (and by proxy aesthetic or stylistic) profiles matter. We also show its use as a “computational art historian” or “curator” algorithm to quantify and systematically explore the dynamics of art artistic careers in very large datasets. While we focus our showcase here on art, it is suitable for comparing any sort of images, and as described in the Discussion, straightforwardly extendable to other types of media to estimate their inherent aesthetic complexity.”
claim-typemethod — “We introduce “compression ensembles”, an efficient and explainable algorithmic comparison framework for images. Instead of attempting to find a single algorithm or metric to best match human judgments or perform on downstream tasks, we argue for an ensemble approach of concurrently using multiple measures. This consists of two steps: multiple transformations and subsequent compression. For a given input image, a set of alternative images is produced by applying a number of different image processing transformations, including various filters, blurs, distortions and color manipulations (see Fig. 1.A, Methods section, and Additional file 1, for details).”
method — evidence — “These new images are compressed (possibly with multiple compression algorithms), and the resulting file sizes are divided by the compression size of the original bitmap; the unfiltered original input is also compressed but divided by the size of the bitmap input. This yields a vector of compression ratios. Further statistical transformations such as colorfulness metrics and fractal dimension [5, 16, 39, 40] (compressions in a broader sense) can also be added to these vectors, and rescaled if the magnitudes differ, which we do (see Methods). Given the perspective of artists as (or as executing) algorithms — in the very broadest sense — our approach aims to capture the residual signal of the generating process, the “algorithmic fingerprints” of an artwork, through the operationalization of various aspects of visual aesthetic complexity, as estimated by compression ratios of the visual transformations. This approach can, however, currently only assess the visual complexity apparent in the image. This may or may not correlate with production complexity, i.e. the time, effort, expertise, etc. that goes into producing an artwork.”
object of study — evidence — “To the human eye, different images appear more or less complex, but capturing this intuition in a single aesthetic measure is considered hard. Here, we propose a computationally simple, transparent method for modeling aesthetic complexity as a multidimensional algorithmic phenomenon, which enables the systematic analysis of large image datasets. The approach captures visual family resemblance via a multitude of image transformations and subsequent compressions, yielding explainable embeddings. It aligns well with human judgments of visual complexity, and performs well in authorship and style recognition tasks. Showcasing the functionality, we apply the method to 125,000 artworks, recovering trends and revealing new insights regarding historical art, artistic careers over centuries, and emerging aesthetics in a contemporary NFT art market. Our approach, here applied to images but applicable more broadly, provides a new perspective to quantitative aesthetics, connoisseurship, multidimensional meaning spaces, and the study of cultural complexity.”
research question — evidence — “The obvious question is whether simple vectors of file size ratios are provably informative about visual complexity or artistic aesthetics. We carried out two sets of experiments to verify that the compression ensembles are fit for this purpose, and show that they allow us to meaningfully track the evolution of complexity in historical art. As detailed in the Evaluation subsection under Methods, we first tested the approach against two sets of human visual complexity judgments, where it performed very well, aligning with what people would judge to be visually simple or complex. This indicates the method is cognitively plausible as a visual complexity estimator. Secondly, we devised a set of classification experiments to determine if there is enough information in a compression ensemble to meaningfully delineate aspects of interest in visual art such as style, genre, authorship and medium. The model yields reasonable accuracy in all cases (and its mis-classifications make sense from an art historical point of view). This indicates the method is fit for purpose for the exploratory tasks showcased in the next section.”
contribution — evidence — “We introduce “compression ensembles”, an efficient and explainable algorithmic comparison framework for images. Instead of attempting to find a single algorithm or metric to best match human judgments or perform on downstream tasks, we argue for an ensemble approach of concurrently using multiple measures. This consists of two steps: multiple transformations and subsequent compression. For a given input image, a set of alternative images is produced by applying a number of different image processing transformations, including various filters, blurs, distortions and color manipulations (see Fig. 1.A, Methods section, and Additional file 1, for details).”
mechanismtransformation then compression For each input image a set of alternative images is produced by a battery of image-processing transformations, and each is then compressed - the two steps that constitute a compression ensemble. — “We introduce “compression ensembles”, an efficient and explainable algorithmic comparison framework for images. Instead of attempting to find a single algorithm or metric to best match human judgments or perform on downstream tasks, we argue for an ensemble approach of concurrently using multiple measures. This consists of two steps: multiple transformations and subsequent compression. For a given input image, a set of alternative images is produced by applying a number of different image processing transformations, including various filters, blurs, distortions and color manipulations (see Fig. 1.A, Methods section, and Additional file 1, for details).”mechanisms[0]
mechanismvector of compression ratios Each transformed image's compressed file size is divided by the original bitmap's compression size, yielding a vector of compression ratios that serve as explainable features. — “These new images are compressed (possibly with multiple compression algorithms), and the resulting file sizes are divided by the compression size of the original bitmap; the unfiltered original input is also compressed but divided by the size of the bitmap input. This yields a vector of compression ratios. Further statistical transformations such as colorfulness metrics and fractal dimension [5, 16, 39, 40] (compressions in a broader sense) can also be added to these vectors, and rescaled if the magnitudes differ, which we do (see Methods). Given the perspective of artists as (or as executing) algorithms — in the very broadest sense — our approach aims to capture the residual signal of the generating process, the “algorithmic fingerprints” of an artwork, through the operationalization of various aspects of visual aesthetic complexity, as estimated by compression ratios of the visual transformations. This approach can, however, currently only assess the visual complexity apparent in the image. This may or may not correlate with production complexity, i.e. the time, effort, expertise, etc. that goes into producing an artwork.”mechanisms[1]
mechanismtransformation breaks coincidental proximity Two dissimilar images may share a compressed size by chance, but it becomes increasingly unlikely they stay close across many different transformations, so the vector space indicates algorithmic distance. — “However, now consider an image transformation T (e.g. Gaussian blur), which we apply to the uncompressed versions of our four images A, B, C, and D before compressing them. The compressed sizes of \(T(A)\) and \(T(B)\) are still likely to be very similar, as the algorithms that generated the original images are very similar, and the transformation and compression algorithms are identical. \(T(C)\) is very likely to still be very different to \(T(A)\) and \(T(B)\). While the compressed size of D was similar to A and B by chance, it is much more unlikely that \(T(D)\) is also similar to \(T(A)\) and \(T(B)\), as the interaction between the transformation T and the generative algorithm of D would have to change the compressibility in the same way as the interaction of T and A/B. Put more intuitively, a Gaussian blur is very likely to affect the compressibility of a Monet very differently from the compressibility of a Dali. Thus, more generally speaking, two images with similar compressed sizes are much less likely to still yield similar compressed sizes by chance after a transformation unless they are algorithmically similar to start with in which case the combined algorithms of generation and transformation (and their interaction with the compression algorithm) remain similar. If we now consider the application of N different transformations of an uncompressed image A, each applied before a subsequent compression, the compressed sizes (including of the untransformed image) \(c(A)\), \(c(T_{1}(A)),c(T_{2}(A)), \dots, c(T_{N}(A))\) form a vector \({\mathbf{v}}(A)\) of length \(N+1\). It follows from the above argument about coincidental proximity that it becomes increasingly unlikely for two algorithmically dissimilar images to remain close together as N increases. Thus the resulting vector space of compressed sizes provides an indication of algorithmic distance between images.”mechanisms[2]
mechanismcompression approximates Kolmogorov complexity Kolmogorov complexity is uncomputable but is approximated by compression size as an upper bound, so more compressible images are treated as visually simpler. — “Considering quantitative analysis of visual art, it makes sense to adopt algorithmic approaches, as creative processes themselves also follow a set of procedures — or algorithms, in the broadest sense — in which artists may be similar or differ [2, 3, 34]. Algorithmic complexity is best understood via information theory [35, 36], defining the Kolmogorov complexity of a string or dataset as the length of the shortest algorithm reproducing the data. Kolmogorov complexity is uncomputable, but can be approximated using the compression size of a dataset as its upper bound. In the case of images, the more compressible one is — i.e. the larger the difference between a bitmap and a compressed version e.g. gif — the visually simpler it is. This notion in turn can be extended to measures of algorithmic distance, one example being normalized compression distance (NCD) [37]. This however requires a separate compression for each comparison event, and has been rarely applied to visual materials [38]. Pairwise image comparison frameworks [19, 22], suffer from the same computational bottleneck. Furthermore, visual media such as art or photography can, intuitively, differ in various dimensions of complexity, such as color, composition and detail. A single value of complexity would likely fail to capture this multiplicity.”mechanisms[3]
mechanismtemporal resemblance via nearest neighbours For each artwork the nearest neighbours in the complexity space are found by cosine similarity, and the GAM-adjusted median time distance to them says whether the work resembles the past or anticipates the future. — “The temporal resemblance method generalizes this comparison. Given the vector space of the Historical set (decorrelated using PCA), we can calculate the nearest neighbors for each artwork vector (like the columns in 3.A). We use cosine similarity and the top closest 100 neighbors (excluding works by the same artist). The median temporal distance between these neighbors and the target work indicates if it resembles the past or anticipates some yet unseen future. This allows us to group artists who are traditionalist or historicist, those who stay current, and those ahead of their time. It is necessary to adjust the median time distances to account for the boundedness and density bias of the dataset: the metric reported here is derived from the residuals of a generalized additive regression model (GAM), still on the same yearly timescale (see Additional file 1 for technical details of the adjustment). Figure 3.B again depicts Mondrian’s works, with temporal resemblance now on the vertical axis.”mechanisms[4]
mechanisminterpretable dimension reduction PCA and UMAP reduce the ensemble while staying interpretable, PCA through its linear relationship to the original transformation variables. — “The model used in this contribution consists of 112 transformations (see Fig. 1.A for examples; Table S1 and Figure S1 in the Additional file 1 for the full list; we use lossless gif, and also png and lossy jpeg on a smaller subset). The exact nature and number of transformations is unimportant yet subject to optimization. More features increase computation time, but provide more information, i.e. the approximation honing in on the true uncomputable Kolmogorov complexity (see Methods). As demonstrated in the classification experiments in the Methods section, different transforms are informative for different tasks, and, given a specific task, a handful of well-chosen features can yield accuracy close to using a large ensemble. Some transformations, like blurs of various magnitudes, may well correlate. In applications where multicollinearity must be avoided or a lower number of dimensions is desired, methods such as Principal Component Analysis (PCA) or UMAP [49] can easily be applied. In this work we use both, as PCA is directly interpretable due to linear relationship with original variables, while UMAP arguably offers better low-dimensional representations [49].”mechanisms[5]
builds-on Birkhoff and Bense's quantification of visual aesthetics and the computational approaches they inspired — “The quantification of visual aesthetics and artistic expression goes back to Birkhoff [1] and Bense [2], inspiring several computational approaches [3–16]. Research drawing on information theory has shown repeatedly and in parallel that visual complexity can be estimated with some accuracy using compression algorithms such as zip or gif [17–29]. While some previous proposals were tested against perceptual human judgments, results diverge as to which compression algorithm or approach would be optimal. Elsewhere in cultural research, measures of compression length have been used at face value to compare the complexity of visual inputs [30–32]. Related information-theoretic approaches have also used entropy to quantify artistic styles and conceptual groupings [8, 12, 33].”claim_relations[0]
builds-on information-theoretic estimation of visual complexity by compression (zip, gif) — “The quantification of visual aesthetics and artistic expression goes back to Birkhoff [1] and Bense [2], inspiring several computational approaches [3–16]. Research drawing on information theory has shown repeatedly and in parallel that visual complexity can be estimated with some accuracy using compression algorithms such as zip or gif [17–29]. While some previous proposals were tested against perceptual human judgments, results diverge as to which compression algorithm or approach would be optimal. Elsewhere in cultural research, measures of compression length have been used at face value to compare the complexity of visual inputs [30–32]. Related information-theoretic approaches have also used entropy to quantify artistic styles and conceptual groupings [8, 12, 33].”claim_relations[1]
contrasts-with normalized compression distance (NCD) and pairwise image comparison frameworks — “Considering quantitative analysis of visual art, it makes sense to adopt algorithmic approaches, as creative processes themselves also follow a set of procedures — or algorithms, in the broadest sense — in which artists may be similar or differ [2, 3, 34]. Algorithmic complexity is best understood via information theory [35, 36], defining the Kolmogorov complexity of a string or dataset as the length of the shortest algorithm reproducing the data. Kolmogorov complexity is uncomputable, but can be approximated using the compression size of a dataset as its upper bound. In the case of images, the more compressible one is — i.e. the larger the difference between a bitmap and a compressed version e.g. gif — the visually simpler it is. This notion in turn can be extended to measures of algorithmic distance, one example being normalized compression distance (NCD) [37]. This however requires a separate compression for each comparison event, and has been rarely applied to visual materials [38]. Pairwise image comparison frameworks [19, 22], suffer from the same computational bottleneck. Furthermore, visual media such as art or photography can, intuitively, differ in various dimensions of complexity, such as color, composition and detail. A single value of complexity would likely fail to capture this multiplicity.”claim_relations[2]
contrasts-with pre-trained deep-learning image embeddings in computer vision — “Compression vectors can be rapidly compared, clustered, or used in image recognition and comparison tasks, as demonstrated below. Our method is comparable, but largely orthogonal to deep learning models of computer vision that also embed images in numeric vector spaces. Typically pre-trained on very large image databases, the latter excel at inferring image similarity (in the feature space), and can be tuned to predict discrete classes such as objects on the image, historical style, or authorship [9, 41, 42]. Compression ensembles can also be used to estimate similarity (in the complexity space), and nearby images often depict similar subjects — albeit incidentally, due to shared stylistic commonalities in how certain subjects are depicted (Fig. 1.B). However, the main function of the ensembles is to operationalize visual complexity as such. Our approach infers meaningful values for an input without requiring any costly pre-training, and therefore also entirely bypasses the “training set bias” problem inherent to pre-trained machine learning models. Fitting new images to an already generated vector space here does not require retraining or realignment of the space either, just a matching set of transformations.”claim_relations[3]
qualifies claims about the history and dynamics of visual art drawn from these datasets — “In the case of art collections or databases like Wikiart and art500k, it is important to be clear that these consist of small, curated, often biased samples of art of some place and period. As such, they represent the historiography of art first and the actual history of art second [12] (see Data Limitations in the Methods section for further discussion). When we make claims here about the history or dynamics of visual art, we are only referring to information derived from the sample — but we make the assumption that the sample is reasonably representative and as such informative of the population of Western art in the time periods we cover. This means that the figures depicting historical changes may look different if more data would be available. However, our quantitative method could also be used for systematic study of data set bias.”claim_relations[4]
recommends concatenating compression ensembles with deep-learning image embeddings for downstream tasks — “Nevertheless, below are some analogous results, to give a sense of machine learning accuracy in similar classification tasks using similar art corpora. These are however not directly comparable to ours due to training and test set differences. Mao et al. [42] report a 39% accuracy for style period and 30% for author retrieval; Tan et al. [41] report 55% for style and 76% for artist (but that is between just 23 artists with the most training data). If for example authorship attribution was the goal of a given application, we envision that its accuracy could likely be improved by concatenating image embeddings with compression ensembles, as mentioned in the Discussion.”claim_relations[5]
sensecomplexity - algorithmic/Kolmogorov sense (length of the shortest reproducing algorithm, approximated by compression) versus perceptual/visual sense (what the human eye judges complex) — “Considering quantitative analysis of visual art, it makes sense to adopt algorithmic approaches, as creative processes themselves also follow a set of procedures — or algorithms, in the broadest sense — in which artists may be similar or differ [2, 3, 34]. Algorithmic complexity is best understood via information theory [35, 36], defining the Kolmogorov complexity of a string or dataset as the length of the shortest algorithm reproducing the data. Kolmogorov complexity is uncomputable, but can be approximated using the compression size of a dataset as its upper bound. In the case of images, the more compressible one is — i.e. the larger the difference between a bitmap and a compressed version e.g. gif — the visually simpler it is. This notion in turn can be extended to measures of algorithmic distance, one example being normalized compression distance (NCD) [37]. This however requires a separate compression for each comparison event, and has been rarely applied to visual materials [38]. Pairwise image comparison frameworks [19, 22], suffer from the same computational bottleneck. Furthermore, visual media such as art or photography can, intuitively, differ in various dimensions of complexity, such as color, composition and detail. A single value of complexity would likely fail to capture this multiplicity.”senses[0]
senseaesthetic - the everyday value-judgment sense (beauty) versus the paper's practical, comparative algorithmic-measure sense, explicitly not a value judgment — “To contrast another related body of literature, some previous research has tried to build statistical and machine learning models to explicitly predict what humans participants in psychology experiments perceive as intuitively complex, “aesthetic”, or “beautiful” [14, 20, 25, 43–45]. We did test our approach on a set of human complexity judgments and show that it performs very well (see Methods), but our goal, to provide a general framework, is broader. We use complexity as a practical comparative algorithmic measure, and, to be very clear, “aesthetic” not as a value judgment. Besides “beauty”, here we also do not attempt to quantify complexity in terms of iconography, semantics nor number of depicted subjects (but see Discussion for possible extensions).”senses[1]
sensestyle - the art-historical discrete style-period sense (Rococo, Baroque, Impressionism) versus the continuous aesthetic-complexity-space proxy sense used here — “We are less interested in discrete classification (although we do run tests on these tasks, see Methods), and more in efficient exploration and curation of large image sets in the continuous complexity space. We show that this is also a good proxy for aesthetic complexity, and by extension, indeed notions of artistic style (see Figs. 1.B, 3). The issue with discrete style classification [5, 42] is that it inevitably requires training on some “ground truth”, which in the case of historical style periods is highly debatable. Our approach goes beyond limited discrete categories to operate in a continuous aesthetics space.”senses[2]
senseensemble - the statistics/ML sense (combine models into one aggregated prediction) versus the compression-ensemble sense (the full vector of complexity estimates is itself the output) — “Our approach is also conceptually related to “ensemble methods” in statistics and machine learning [46], but instead of a single aggregated prediction, the useful output here is the full vector of complexity estimates. Approaches using ensembles of various metrics have also been proposed in linguistics for language complexity [47] and economics for tax system complexity [48].”senses[3]
sensealgorithm - the compression/computational sense versus the broad sense of an artist's creative process as a set of procedures ('artists as algorithms') — “Considering quantitative analysis of visual art, it makes sense to adopt algorithmic approaches, as creative processes themselves also follow a set of procedures — or algorithms, in the broadest sense — in which artists may be similar or differ [2, 3, 34]. Algorithmic complexity is best understood via information theory [35, 36], defining the Kolmogorov complexity of a string or dataset as the length of the shortest algorithm reproducing the data. Kolmogorov complexity is uncomputable, but can be approximated using the compression size of a dataset as its upper bound. In the case of images, the more compressible one is — i.e. the larger the difference between a bitmap and a compressed version e.g. gif — the visually simpler it is. This notion in turn can be extended to measures of algorithmic distance, one example being normalized compression distance (NCD) [37]. This however requires a separate compression for each comparison event, and has been rarely applied to visual materials [38]. Pairwise image comparison frameworks [19, 22], suffer from the same computational bottleneck. Furthermore, visual media such as art or photography can, intuitively, differ in various dimensions of complexity, such as color, composition and detail. A single value of complexity would likely fail to capture this multiplicity.”senses[4]
senseaesthetic complexity - a single unidimensional aesthetic measure versus a multidimensional, polymorphic algorithmic phenomenon — “To the human eye, different images appear more or less complex, but capturing this intuition in a single aesthetic measure is considered hard. Here, we propose a computationally simple, transparent method for modeling aesthetic complexity as a multidimensional algorithmic phenomenon, which enables the systematic analysis of large image datasets. The approach captures visual family resemblance via a multitude of image transformations and subsequent compressions, yielding explainable embeddings. It aligns well with human judgments of visual complexity, and performs well in authorship and style recognition tasks. Showcasing the functionality, we apply the method to 125,000 artworks, recovering trends and revealing new insights regarding historical art, artistic careers over centuries, and emerging aesthetics in a contemporary NFT art market. Our approach, here applied to images but applicable more broadly, provides a new perspective to quantitative aesthetics, connoisseurship, multidimensional meaning spaces, and the study of cultural complexity.”senses[5]
sense'cumulative' cultural evolution - the sense implying objective improvement over time versus the sense of better meeting a community's preferences or communicative need — “While we focus on complexity, the same approach could be used on other related phenomena. For example, Sinclair et al. [68] raise the concept of “aesthetic value” or “attractiveness” of a given cultural product, to discuss whether art and music indeed could be considered as products of cumulative cultural evolution [66] or not, as “cumulative” would allude to objective improvement over time [69]. From the art historical perspective, a style that builds on or grows out of another style may not be necessarily objectively better, but may better meet the preferences of its consumers in a given time, place, or ecological niche. This is not unlike the concept of communicative need in language: a structure or lexical configuration might not be better in some absolute evolutionary terms, but can be more optimal or efficient given the usage tendencies or needs of a given language community [70, 71].”senses[6]
noteBirkhoff and Bense's quantification of visual aesthetics and the computational approaches they inspired — Situates the method in a long lineage of quantifying visual aesthetics. — “The quantification of visual aesthetics and artistic expression goes back to Birkhoff [1] and Bense [2], inspiring several computational approaches [3–16]. Research drawing on information theory has shown repeatedly and in parallel that visual complexity can be estimated with some accuracy using compression algorithms such as zip or gif [17–29]. While some previous proposals were tested against perceptual human judgments, results diverge as to which compression algorithm or approach would be optimal. Elsewhere in cultural research, measures of compression length have been used at face value to compare the complexity of visual inputs [30–32]. Related information-theoretic approaches have also used entropy to quantify artistic styles and conceptual groupings [8, 12, 33].”claim_relations[0]
weightBirkhoff and Bense's quantification of visual aesthetics and the computational approaches they inspired — 0.9 — “The quantification of visual aesthetics and artistic expression goes back to Birkhoff [1] and Bense [2], inspiring several computational approaches [3–16]. Research drawing on information theory has shown repeatedly and in parallel that visual complexity can be estimated with some accuracy using compression algorithms such as zip or gif [17–29]. While some previous proposals were tested against perceptual human judgments, results diverge as to which compression algorithm or approach would be optimal. Elsewhere in cultural research, measures of compression length have been used at face value to compare the complexity of visual inputs [30–32]. Related information-theoretic approaches have also used entropy to quantify artistic styles and conceptual groupings [8, 12, 33].”claim_relations[0]
noteinformation-theoretic estimation of visual complexity by compression (zip, gif) — Adopts the established result that compression estimates visual complexity. — “The quantification of visual aesthetics and artistic expression goes back to Birkhoff [1] and Bense [2], inspiring several computational approaches [3–16]. Research drawing on information theory has shown repeatedly and in parallel that visual complexity can be estimated with some accuracy using compression algorithms such as zip or gif [17–29]. While some previous proposals were tested against perceptual human judgments, results diverge as to which compression algorithm or approach would be optimal. Elsewhere in cultural research, measures of compression length have been used at face value to compare the complexity of visual inputs [30–32]. Related information-theoretic approaches have also used entropy to quantify artistic styles and conceptual groupings [8, 12, 33].”claim_relations[1]
weightinformation-theoretic estimation of visual complexity by compression (zip, gif) — 0.9 — “The quantification of visual aesthetics and artistic expression goes back to Birkhoff [1] and Bense [2], inspiring several computational approaches [3–16]. Research drawing on information theory has shown repeatedly and in parallel that visual complexity can be estimated with some accuracy using compression algorithms such as zip or gif [17–29]. While some previous proposals were tested against perceptual human judgments, results diverge as to which compression algorithm or approach would be optimal. Elsewhere in cultural research, measures of compression length have been used at face value to compare the complexity of visual inputs [30–32]. Related information-theoretic approaches have also used entropy to quantify artistic styles and conceptual groupings [8, 12, 33].”claim_relations[1]
notenormalized compression distance (NCD) and pairwise image comparison frameworks — NCD needs a separate compression per comparison event, a bottleneck the ensemble avoids. — “Considering quantitative analysis of visual art, it makes sense to adopt algorithmic approaches, as creative processes themselves also follow a set of procedures — or algorithms, in the broadest sense — in which artists may be similar or differ [2, 3, 34]. Algorithmic complexity is best understood via information theory [35, 36], defining the Kolmogorov complexity of a string or dataset as the length of the shortest algorithm reproducing the data. Kolmogorov complexity is uncomputable, but can be approximated using the compression size of a dataset as its upper bound. In the case of images, the more compressible one is — i.e. the larger the difference between a bitmap and a compressed version e.g. gif — the visually simpler it is. This notion in turn can be extended to measures of algorithmic distance, one example being normalized compression distance (NCD) [37]. This however requires a separate compression for each comparison event, and has been rarely applied to visual materials [38]. Pairwise image comparison frameworks [19, 22], suffer from the same computational bottleneck. Furthermore, visual media such as art or photography can, intuitively, differ in various dimensions of complexity, such as color, composition and detail. A single value of complexity would likely fail to capture this multiplicity.”claim_relations[2]
weightnormalized compression distance (NCD) and pairwise image comparison frameworks — 0.9 — “Considering quantitative analysis of visual art, it makes sense to adopt algorithmic approaches, as creative processes themselves also follow a set of procedures — or algorithms, in the broadest sense — in which artists may be similar or differ [2, 3, 34]. Algorithmic complexity is best understood via information theory [35, 36], defining the Kolmogorov complexity of a string or dataset as the length of the shortest algorithm reproducing the data. Kolmogorov complexity is uncomputable, but can be approximated using the compression size of a dataset as its upper bound. In the case of images, the more compressible one is — i.e. the larger the difference between a bitmap and a compressed version e.g. gif — the visually simpler it is. This notion in turn can be extended to measures of algorithmic distance, one example being normalized compression distance (NCD) [37]. This however requires a separate compression for each comparison event, and has been rarely applied to visual materials [38]. Pairwise image comparison frameworks [19, 22], suffer from the same computational bottleneck. Furthermore, visual media such as art or photography can, intuitively, differ in various dimensions of complexity, such as color, composition and detail. A single value of complexity would likely fail to capture this multiplicity.”claim_relations[2]
notepre-trained deep-learning image embeddings in computer vision — The method is orthogonal, needs no pre-training, and bypasses the training-set-bias problem. — “Compression vectors can be rapidly compared, clustered, or used in image recognition and comparison tasks, as demonstrated below. Our method is comparable, but largely orthogonal to deep learning models of computer vision that also embed images in numeric vector spaces. Typically pre-trained on very large image databases, the latter excel at inferring image similarity (in the feature space), and can be tuned to predict discrete classes such as objects on the image, historical style, or authorship [9, 41, 42]. Compression ensembles can also be used to estimate similarity (in the complexity space), and nearby images often depict similar subjects — albeit incidentally, due to shared stylistic commonalities in how certain subjects are depicted (Fig. 1.B). However, the main function of the ensembles is to operationalize visual complexity as such. Our approach infers meaningful values for an input without requiring any costly pre-training, and therefore also entirely bypasses the “training set bias” problem inherent to pre-trained machine learning models. Fitting new images to an already generated vector space here does not require retraining or realignment of the space either, just a matching set of transformations.”claim_relations[3]
weightpre-trained deep-learning image embeddings in computer vision — 0.9 — “Compression vectors can be rapidly compared, clustered, or used in image recognition and comparison tasks, as demonstrated below. Our method is comparable, but largely orthogonal to deep learning models of computer vision that also embed images in numeric vector spaces. Typically pre-trained on very large image databases, the latter excel at inferring image similarity (in the feature space), and can be tuned to predict discrete classes such as objects on the image, historical style, or authorship [9, 41, 42]. Compression ensembles can also be used to estimate similarity (in the complexity space), and nearby images often depict similar subjects — albeit incidentally, due to shared stylistic commonalities in how certain subjects are depicted (Fig. 1.B). However, the main function of the ensembles is to operationalize visual complexity as such. Our approach infers meaningful values for an input without requiring any costly pre-training, and therefore also entirely bypasses the “training set bias” problem inherent to pre-trained machine learning models. Fitting new images to an already generated vector space here does not require retraining or realignment of the space either, just a matching set of transformations.”claim_relations[3]
noteclaims about the history and dynamics of visual art drawn from these datasets — All claims refer only to the sample, assumed reasonably representative. — “In the case of art collections or databases like Wikiart and art500k, it is important to be clear that these consist of small, curated, often biased samples of art of some place and period. As such, they represent the historiography of art first and the actual history of art second [12] (see Data Limitations in the Methods section for further discussion). When we make claims here about the history or dynamics of visual art, we are only referring to information derived from the sample — but we make the assumption that the sample is reasonably representative and as such informative of the population of Western art in the time periods we cover. This means that the figures depicting historical changes may look different if more data would be available. However, our quantitative method could also be used for systematic study of data set bias.”claim_relations[4]
weightclaims about the history and dynamics of visual art drawn from these datasets — 0.9 — “In the case of art collections or databases like Wikiart and art500k, it is important to be clear that these consist of small, curated, often biased samples of art of some place and period. As such, they represent the historiography of art first and the actual history of art second [12] (see Data Limitations in the Methods section for further discussion). When we make claims here about the history or dynamics of visual art, we are only referring to information derived from the sample — but we make the assumption that the sample is reasonably representative and as such informative of the population of Western art in the time periods we cover. This means that the figures depicting historical changes may look different if more data would be available. However, our quantitative method could also be used for systematic study of data set bias.”claim_relations[4]
noteconcatenating compression ensembles with deep-learning image embeddings for downstream tasks — Future work: accuracy on tasks like authorship could likely be improved by combining the two. — “Nevertheless, below are some analogous results, to give a sense of machine learning accuracy in similar classification tasks using similar art corpora. These are however not directly comparable to ours due to training and test set differences. Mao et al. [42] report a 39% accuracy for style period and 30% for author retrieval; Tan et al. [41] report 55% for style and 76% for artist (but that is between just 23 artists with the most training data). If for example authorship attribution was the goal of a given application, we envision that its accuracy could likely be improved by concatenating image embeddings with compression ensembles, as mentioned in the Discussion.”claim_relations[5]
weightconcatenating compression ensembles with deep-learning image embeddings for downstream tasks — 0.6 — “Nevertheless, below are some analogous results, to give a sense of machine learning accuracy in similar classification tasks using similar art corpora. These are however not directly comparable to ours due to training and test set differences. Mao et al. [42] report a 39% accuracy for style period and 30% for author retrieval; Tan et al. [41] report 55% for style and 76% for artist (but that is between just 23 artists with the most training data). If for example authorship attribution was the goal of a given application, we envision that its accuracy could likely be improved by concatenating image embeddings with compression ensembles, as mentioned in the Discussion.”claim_relations[5]
notecompression ensemble —distinct-from→ image embeddings — Differentiator: interpretability of the dimensions. — “Importantly, unlike all of the aforementioned machine learning based image embeddings, the dimensions or variables in a compression ensemble remain interpretable: a compression ratio difference between two images for a given transformation indicates that they differ in this aspect. Applying a black-and-white transformation to a colorful image increases compressibility relative to the original (compression ratio ≪1), but has no effect on an already black-and-white image (ratio ≈1). Applying coarse pixelation to Piet Mondrian’s abstract paintings (Fig. 1.B.1) barely changes their compressibility, while it greatly increases compressibility for the highly detailed works of Hieronymus Bosch (Fig. 1.B.6). Therefore, images similar in multiple aspects end up close together in multidimensional compression space, while dissimilar ones stay far apart. Though our approach does not include any visual similarity or object recognition features in the machine learning sense, certain genres do appear more popular within certain regions of the space, depicting features yielding a similar complexity profile (e.g. human half-figures on dark background; Fig. 1.B.2).”concept_edges[0]
relationcompression ensemble —distinct-from→ image embeddings — Unlike machine-learning image embeddings, the dimensions of a compression ensemble remain interpretable. — “Importantly, unlike all of the aforementioned machine learning based image embeddings, the dimensions or variables in a compression ensemble remain interpretable: a compression ratio difference between two images for a given transformation indicates that they differ in this aspect. Applying a black-and-white transformation to a colorful image increases compressibility relative to the original (compression ratio ≪1), but has no effect on an already black-and-white image (ratio ≈1). Applying coarse pixelation to Piet Mondrian’s abstract paintings (Fig. 1.B.1) barely changes their compressibility, while it greatly increases compressibility for the highly detailed works of Hieronymus Bosch (Fig. 1.B.6). Therefore, images similar in multiple aspects end up close together in multidimensional compression space, while dissimilar ones stay far apart. Though our approach does not include any visual similarity or object recognition features in the machine learning sense, certain genres do appear more popular within certain regions of the space, depicting features yielding a similar complexity profile (e.g. human half-figures on dark background; Fig. 1.B.2).”concept_edges[0]
weightcompression ensemble —distinct-from→ image embeddings — 0.9 — “Importantly, unlike all of the aforementioned machine learning based image embeddings, the dimensions or variables in a compression ensemble remain interpretable: a compression ratio difference between two images for a given transformation indicates that they differ in this aspect. Applying a black-and-white transformation to a colorful image increases compressibility relative to the original (compression ratio ≪1), but has no effect on an already black-and-white image (ratio ≈1). Applying coarse pixelation to Piet Mondrian’s abstract paintings (Fig. 1.B.1) barely changes their compressibility, while it greatly increases compressibility for the highly detailed works of Hieronymus Bosch (Fig. 1.B.6). Therefore, images similar in multiple aspects end up close together in multidimensional compression space, while dissimilar ones stay far apart. Though our approach does not include any visual similarity or object recognition features in the machine learning sense, certain genres do appear more popular within certain regions of the space, depicting features yielding a similar complexity profile (e.g. human half-figures on dark background; Fig. 1.B.2).”concept_edges[0]
notecompression ensemble —distinct-from→ deep learning — Differentiator: no pre-training versus pre-trained baseline. — “Deep learning models, which typically involve lengthy pre-training on large image databases, can also be tuned to perform similar tasks [9, 42, 97]. Our method is primarily a general zero-shot complexity estimation algorithm and does not involve pre-training; but indeed its output is informative enough to perform some such downstream tasks with reasonable accuracy. The purpose of this exercise here however is not to compete with these approaches, but to show that a compression ensemble — despite consisting of no features other than file size ratios and statistical transformations, and containing no pre-trained baseline — still captures and disambiguates enough family resemblance to place stylistically similar artworks close together and dissimilar ones apart, with a non-random error structure.”concept_edges[1]
relationcompression ensemble —distinct-from→ deep learning — A compression ensemble is a zero-shot method with no pre-training, whereas deep-learning models require lengthy pre-training on large image databases. — “Deep learning models, which typically involve lengthy pre-training on large image databases, can also be tuned to perform similar tasks [9, 42, 97]. Our method is primarily a general zero-shot complexity estimation algorithm and does not involve pre-training; but indeed its output is informative enough to perform some such downstream tasks with reasonable accuracy. The purpose of this exercise here however is not to compete with these approaches, but to show that a compression ensemble — despite consisting of no features other than file size ratios and statistical transformations, and containing no pre-trained baseline — still captures and disambiguates enough family resemblance to place stylistically similar artworks close together and dissimilar ones apart, with a non-random error structure.”concept_edges[1]
weightcompression ensemble —distinct-from→ deep learning — 0.9 — “Deep learning models, which typically involve lengthy pre-training on large image databases, can also be tuned to perform similar tasks [9, 42, 97]. Our method is primarily a general zero-shot complexity estimation algorithm and does not involve pre-training; but indeed its output is informative enough to perform some such downstream tasks with reasonable accuracy. The purpose of this exercise here however is not to compete with these approaches, but to show that a compression ensemble — despite consisting of no features other than file size ratios and statistical transformations, and containing no pre-trained baseline — still captures and disambiguates enough family resemblance to place stylistically similar artworks close together and dissimilar ones apart, with a non-random error structure.”concept_edges[1]
notevisual aesthetic complexity —operationalised-as→ compression ratios — Explicit operationalisation of the from-concept as the measure. — “These new images are compressed (possibly with multiple compression algorithms), and the resulting file sizes are divided by the compression size of the original bitmap; the unfiltered original input is also compressed but divided by the size of the bitmap input. This yields a vector of compression ratios. Further statistical transformations such as colorfulness metrics and fractal dimension [5, 16, 39, 40] (compressions in a broader sense) can also be added to these vectors, and rescaled if the magnitudes differ, which we do (see Methods). Given the perspective of artists as (or as executing) algorithms — in the very broadest sense — our approach aims to capture the residual signal of the generating process, the “algorithmic fingerprints” of an artwork, through the operationalization of various aspects of visual aesthetic complexity, as estimated by compression ratios of the visual transformations. This approach can, however, currently only assess the visual complexity apparent in the image. This may or may not correlate with production complexity, i.e. the time, effort, expertise, etc. that goes into producing an artwork.”concept_edges[2]
relationvisual aesthetic complexity —operationalised-as→ compression ratios — Various aspects of visual aesthetic complexity are operationalised as, and estimated by, the compression ratios of the visual transformations. — “These new images are compressed (possibly with multiple compression algorithms), and the resulting file sizes are divided by the compression size of the original bitmap; the unfiltered original input is also compressed but divided by the size of the bitmap input. This yields a vector of compression ratios. Further statistical transformations such as colorfulness metrics and fractal dimension [5, 16, 39, 40] (compressions in a broader sense) can also be added to these vectors, and rescaled if the magnitudes differ, which we do (see Methods). Given the perspective of artists as (or as executing) algorithms — in the very broadest sense — our approach aims to capture the residual signal of the generating process, the “algorithmic fingerprints” of an artwork, through the operationalization of various aspects of visual aesthetic complexity, as estimated by compression ratios of the visual transformations. This approach can, however, currently only assess the visual complexity apparent in the image. This may or may not correlate with production complexity, i.e. the time, effort, expertise, etc. that goes into producing an artwork.”concept_edges[2]
weightvisual aesthetic complexity —operationalised-as→ compression ratios — 0.9 — “These new images are compressed (possibly with multiple compression algorithms), and the resulting file sizes are divided by the compression size of the original bitmap; the unfiltered original input is also compressed but divided by the size of the bitmap input. This yields a vector of compression ratios. Further statistical transformations such as colorfulness metrics and fractal dimension [5, 16, 39, 40] (compressions in a broader sense) can also be added to these vectors, and rescaled if the magnitudes differ, which we do (see Methods). Given the perspective of artists as (or as executing) algorithms — in the very broadest sense — our approach aims to capture the residual signal of the generating process, the “algorithmic fingerprints” of an artwork, through the operationalization of various aspects of visual aesthetic complexity, as estimated by compression ratios of the visual transformations. This approach can, however, currently only assess the visual complexity apparent in the image. This may or may not correlate with production complexity, i.e. the time, effort, expertise, etc. that goes into producing an artwork.”concept_edges[2]
effect directionblack-and-white transformation —causes→ compressibility — increases — “Importantly, unlike all of the aforementioned machine learning based image embeddings, the dimensions or variables in a compression ensemble remain interpretable: a compression ratio difference between two images for a given transformation indicates that they differ in this aspect. Applying a black-and-white transformation to a colorful image increases compressibility relative to the original (compression ratio ≪1), but has no effect on an already black-and-white image (ratio ≈1). Applying coarse pixelation to Piet Mondrian’s abstract paintings (Fig. 1.B.1) barely changes their compressibility, while it greatly increases compressibility for the highly detailed works of Hieronymus Bosch (Fig. 1.B.6). Therefore, images similar in multiple aspects end up close together in multidimensional compression space, while dissimilar ones stay far apart. Though our approach does not include any visual similarity or object recognition features in the machine learning sense, certain genres do appear more popular within certain regions of the space, depicting features yielding a similar complexity profile (e.g. human half-figures on dark background; Fig. 1.B.2).” — “Applying a black-and-white transformation to a colorful image increases compressibility”concept_edges[3]
noteblack-and-white transformation —causes→ compressibility — Positive effect on a colourful image; no effect on an already black-and-white one. — “Importantly, unlike all of the aforementioned machine learning based image embeddings, the dimensions or variables in a compression ensemble remain interpretable: a compression ratio difference between two images for a given transformation indicates that they differ in this aspect. Applying a black-and-white transformation to a colorful image increases compressibility relative to the original (compression ratio ≪1), but has no effect on an already black-and-white image (ratio ≈1). Applying coarse pixelation to Piet Mondrian’s abstract paintings (Fig. 1.B.1) barely changes their compressibility, while it greatly increases compressibility for the highly detailed works of Hieronymus Bosch (Fig. 1.B.6). Therefore, images similar in multiple aspects end up close together in multidimensional compression space, while dissimilar ones stay far apart. Though our approach does not include any visual similarity or object recognition features in the machine learning sense, certain genres do appear more popular within certain regions of the space, depicting features yielding a similar complexity profile (e.g. human half-figures on dark background; Fig. 1.B.2).”concept_edges[3]
relationblack-and-white transformation —causes→ compressibility — Applying a black-and-white transformation to a colourful image increases its compressibility relative to the original. — “Importantly, unlike all of the aforementioned machine learning based image embeddings, the dimensions or variables in a compression ensemble remain interpretable: a compression ratio difference between two images for a given transformation indicates that they differ in this aspect. Applying a black-and-white transformation to a colorful image increases compressibility relative to the original (compression ratio ≪1), but has no effect on an already black-and-white image (ratio ≈1). Applying coarse pixelation to Piet Mondrian’s abstract paintings (Fig. 1.B.1) barely changes their compressibility, while it greatly increases compressibility for the highly detailed works of Hieronymus Bosch (Fig. 1.B.6). Therefore, images similar in multiple aspects end up close together in multidimensional compression space, while dissimilar ones stay far apart. Though our approach does not include any visual similarity or object recognition features in the machine learning sense, certain genres do appear more popular within certain regions of the space, depicting features yielding a similar complexity profile (e.g. human half-figures on dark background; Fig. 1.B.2).”concept_edges[3]
weightblack-and-white transformation —causes→ compressibility — 0.9 — “Importantly, unlike all of the aforementioned machine learning based image embeddings, the dimensions or variables in a compression ensemble remain interpretable: a compression ratio difference between two images for a given transformation indicates that they differ in this aspect. Applying a black-and-white transformation to a colorful image increases compressibility relative to the original (compression ratio ≪1), but has no effect on an already black-and-white image (ratio ≈1). Applying coarse pixelation to Piet Mondrian’s abstract paintings (Fig. 1.B.1) barely changes their compressibility, while it greatly increases compressibility for the highly detailed works of Hieronymus Bosch (Fig. 1.B.6). Therefore, images similar in multiple aspects end up close together in multidimensional compression space, while dissimilar ones stay far apart. Though our approach does not include any visual similarity or object recognition features in the machine learning sense, certain genres do appear more popular within certain regions of the space, depicting features yielding a similar complexity profile (e.g. human half-figures on dark background; Fig. 1.B.2).”concept_edges[3]
relationKolmogorov complexity → compression size — Compression size upper-bounds and approximates Kolmogorov complexity. — “Considering quantitative analysis of visual art, it makes sense to adopt algorithmic approaches, as creative processes themselves also follow a set of procedures — or algorithms, in the broadest sense — in which artists may be similar or differ [2, 3, 34]. Algorithmic complexity is best understood via information theory [35, 36], defining the Kolmogorov complexity of a string or dataset as the length of the shortest algorithm reproducing the data. Kolmogorov complexity is uncomputable, but can be approximated using the compression size of a dataset as its upper bound. In the case of images, the more compressible one is — i.e. the larger the difference between a bitmap and a compressed version e.g. gif — the visually simpler it is. This notion in turn can be extended to measures of algorithmic distance, one example being normalized compression distance (NCD) [37]. This however requires a separate compression for each comparison event, and has been rarely applied to visual materials [38]. Pairwise image comparison frameworks [19, 22], suffer from the same computational bottleneck. Furthermore, visual media such as art or photography can, intuitively, differ in various dimensions of complexity, such as color, composition and detail. A single value of complexity would likely fail to capture this multiplicity.”unhoused_relations[0]
weightKolmogorov complexity → compression size — 0.9 — “Considering quantitative analysis of visual art, it makes sense to adopt algorithmic approaches, as creative processes themselves also follow a set of procedures — or algorithms, in the broadest sense — in which artists may be similar or differ [2, 3, 34]. Algorithmic complexity is best understood via information theory [35, 36], defining the Kolmogorov complexity of a string or dataset as the length of the shortest algorithm reproducing the data. Kolmogorov complexity is uncomputable, but can be approximated using the compression size of a dataset as its upper bound. In the case of images, the more compressible one is — i.e. the larger the difference between a bitmap and a compressed version e.g. gif — the visually simpler it is. This notion in turn can be extended to measures of algorithmic distance, one example being normalized compression distance (NCD) [37]. This however requires a separate compression for each comparison event, and has been rarely applied to visual materials [38]. Pairwise image comparison frameworks [19, 22], suffer from the same computational bottleneck. Furthermore, visual media such as art or photography can, intuitively, differ in various dimensions of complexity, such as color, composition and detail. A single value of complexity would likely fail to capture this multiplicity.”unhoused_relations[0]
relationfamily resemblance → polymorphic visual perception — Family resemblance is extended from games to polymorphic visual perception. — “The vector space of the ensemble allows for flexible operationalization and visualization, e.g. a single figure (e.g. 3) can summarize careers of several artists. This is not entirely dissimilar to the intuition of an human connoisseur trained on a given corpus of art. As each transformation in an ensemble represents a tangible visual aspect e.g. abundance of detail or colorfulness, as a whole, it constitutes an estimate of the philosophical and cognitive concept of polymorphic family resemblance, originally used to characterize similarity of games such as chess and soccer, later extended to polymorphic visual perception [72–74]. The recognition of visual family resemblance is arguably foundational and intrinsically mastered by trained human art connoisseurs, yet “exists at an unarticulated level, easy to invoke but difficult to explicate” [3]. Such recognition skills are also required of other visual experts e.g. radiologists, detecting health issues in medical imaging. Deep learning models have made headway in solving the latter among other object recognition tasks, but are not very good at explaining why or how they recognize something either (though cf. [29]).”unhoused_relations[1]
weightfamily resemblance → polymorphic visual perception — 0.9 — “The vector space of the ensemble allows for flexible operationalization and visualization, e.g. a single figure (e.g. 3) can summarize careers of several artists. This is not entirely dissimilar to the intuition of an human connoisseur trained on a given corpus of art. As each transformation in an ensemble represents a tangible visual aspect e.g. abundance of detail or colorfulness, as a whole, it constitutes an estimate of the philosophical and cognitive concept of polymorphic family resemblance, originally used to characterize similarity of games such as chess and soccer, later extended to polymorphic visual perception [72–74]. The recognition of visual family resemblance is arguably foundational and intrinsically mastered by trained human art connoisseurs, yet “exists at an unarticulated level, easy to invoke but difficult to explicate” [3]. Such recognition skills are also required of other visual experts e.g. radiologists, detecting health issues in medical imaging. Deep learning models have made headway in solving the latter among other object recognition tasks, but are not very good at explaining why or how they recognize something either (though cf. [29]).”unhoused_relations[1]
relationvisual complexity → production complexity — Visual complexity may or may not correlate with production complexity. — “These new images are compressed (possibly with multiple compression algorithms), and the resulting file sizes are divided by the compression size of the original bitmap; the unfiltered original input is also compressed but divided by the size of the bitmap input. This yields a vector of compression ratios. Further statistical transformations such as colorfulness metrics and fractal dimension [5, 16, 39, 40] (compressions in a broader sense) can also be added to these vectors, and rescaled if the magnitudes differ, which we do (see Methods). Given the perspective of artists as (or as executing) algorithms — in the very broadest sense — our approach aims to capture the residual signal of the generating process, the “algorithmic fingerprints” of an artwork, through the operationalization of various aspects of visual aesthetic complexity, as estimated by compression ratios of the visual transformations. This approach can, however, currently only assess the visual complexity apparent in the image. This may or may not correlate with production complexity, i.e. the time, effort, expertise, etc. that goes into producing an artwork.”unhoused_relations[2]
weightvisual complexity → production complexity — 0.6 — “These new images are compressed (possibly with multiple compression algorithms), and the resulting file sizes are divided by the compression size of the original bitmap; the unfiltered original input is also compressed but divided by the size of the bitmap input. This yields a vector of compression ratios. Further statistical transformations such as colorfulness metrics and fractal dimension [5, 16, 39, 40] (compressions in a broader sense) can also be added to these vectors, and rescaled if the magnitudes differ, which we do (see Methods). Given the perspective of artists as (or as executing) algorithms — in the very broadest sense — our approach aims to capture the residual signal of the generating process, the “algorithmic fingerprints” of an artwork, through the operationalization of various aspects of visual aesthetic complexity, as estimated by compression ratios of the visual transformations. This approach can, however, currently only assess the visual complexity apparent in the image. This may or may not correlate with production complexity, i.e. the time, effort, expertise, etc. that goes into producing an artwork.”unhoused_relations[2]
relationartists → algorithms — Artists are framed as algorithms executing a generating process. — “These new images are compressed (possibly with multiple compression algorithms), and the resulting file sizes are divided by the compression size of the original bitmap; the unfiltered original input is also compressed but divided by the size of the bitmap input. This yields a vector of compression ratios. Further statistical transformations such as colorfulness metrics and fractal dimension [5, 16, 39, 40] (compressions in a broader sense) can also be added to these vectors, and rescaled if the magnitudes differ, which we do (see Methods). Given the perspective of artists as (or as executing) algorithms — in the very broadest sense — our approach aims to capture the residual signal of the generating process, the “algorithmic fingerprints” of an artwork, through the operationalization of various aspects of visual aesthetic complexity, as estimated by compression ratios of the visual transformations. This approach can, however, currently only assess the visual complexity apparent in the image. This may or may not correlate with production complexity, i.e. the time, effort, expertise, etc. that goes into producing an artwork.”unhoused_relations[3]
weightartists → algorithms — 0.85 — “These new images are compressed (possibly with multiple compression algorithms), and the resulting file sizes are divided by the compression size of the original bitmap; the unfiltered original input is also compressed but divided by the size of the bitmap input. This yields a vector of compression ratios. Further statistical transformations such as colorfulness metrics and fractal dimension [5, 16, 39, 40] (compressions in a broader sense) can also be added to these vectors, and rescaled if the magnitudes differ, which we do (see Methods). Given the perspective of artists as (or as executing) algorithms — in the very broadest sense — our approach aims to capture the residual signal of the generating process, the “algorithmic fingerprints” of an artwork, through the operationalization of various aspects of visual aesthetic complexity, as estimated by compression ratios of the visual transformations. This approach can, however, currently only assess the visual complexity apparent in the image. This may or may not correlate with production complexity, i.e. the time, effort, expertise, etc. that goes into producing an artwork.”unhoused_relations[3]
relationaesthetic complexity → cultural complexity — Aesthetic-complexity quantification opens onto the study of cultural complexity. — “To the human eye, different images appear more or less complex, but capturing this intuition in a single aesthetic measure is considered hard. Here, we propose a computationally simple, transparent method for modeling aesthetic complexity as a multidimensional algorithmic phenomenon, which enables the systematic analysis of large image datasets. The approach captures visual family resemblance via a multitude of image transformations and subsequent compressions, yielding explainable embeddings. It aligns well with human judgments of visual complexity, and performs well in authorship and style recognition tasks. Showcasing the functionality, we apply the method to 125,000 artworks, recovering trends and revealing new insights regarding historical art, artistic careers over centuries, and emerging aesthetics in a contemporary NFT art market. Our approach, here applied to images but applicable more broadly, provides a new perspective to quantitative aesthetics, connoisseurship, multidimensional meaning spaces, and the study of cultural complexity.”unhoused_relations[4]
weightaesthetic complexity → cultural complexity — 0.8 — “To the human eye, different images appear more or less complex, but capturing this intuition in a single aesthetic measure is considered hard. Here, we propose a computationally simple, transparent method for modeling aesthetic complexity as a multidimensional algorithmic phenomenon, which enables the systematic analysis of large image datasets. The approach captures visual family resemblance via a multitude of image transformations and subsequent compressions, yielding explainable embeddings. It aligns well with human judgments of visual complexity, and performs well in authorship and style recognition tasks. Showcasing the functionality, we apply the method to 125,000 artworks, recovering trends and revealing new insights regarding historical art, artistic careers over centuries, and emerging aesthetics in a contemporary NFT art market. Our approach, here applied to images but applicable more broadly, provides a new perspective to quantitative aesthetics, connoisseurship, multidimensional meaning spaces, and the study of cultural complexity.”unhoused_relations[4]
no type for thisKolmogorov complexity → compression size — Kolmogorov complexity is uncomputable but is approximated using the compression size of a dataset as its upper bound. — “Considering quantitative analysis of visual art, it makes sense to adopt algorithmic approaches, as creative processes themselves also follow a set of procedures — or algorithms, in the broadest sense — in which artists may be similar or differ [2, 3, 34]. Algorithmic complexity is best understood via information theory [35, 36], defining the Kolmogorov complexity of a string or dataset as the length of the shortest algorithm reproducing the data. Kolmogorov complexity is uncomputable, but can be approximated using the compression size of a dataset as its upper bound. In the case of images, the more compressible one is — i.e. the larger the difference between a bitmap and a compressed version e.g. gif — the visually simpler it is. This notion in turn can be extended to measures of algorithmic distance, one example being normalized compression distance (NCD) [37]. This however requires a separate compression for each comparison event, and has been rarely applied to visual materials [38]. Pairwise image comparison frameworks [19, 22], suffer from the same computational bottleneck. Furthermore, visual media such as art or photography can, intuitively, differ in various dimensions of complexity, such as color, composition and detail. A single value of complexity would likely fail to capture this multiplicity.”unhoused_relations[0]
no type for thisfamily resemblance → polymorphic visual perception — The philosophical concept of family resemblance, first used for games like chess and soccer, is extended to polymorphic visual perception and grounds the ensemble. — “The vector space of the ensemble allows for flexible operationalization and visualization, e.g. a single figure (e.g. 3) can summarize careers of several artists. This is not entirely dissimilar to the intuition of an human connoisseur trained on a given corpus of art. As each transformation in an ensemble represents a tangible visual aspect e.g. abundance of detail or colorfulness, as a whole, it constitutes an estimate of the philosophical and cognitive concept of polymorphic family resemblance, originally used to characterize similarity of games such as chess and soccer, later extended to polymorphic visual perception [72–74]. The recognition of visual family resemblance is arguably foundational and intrinsically mastered by trained human art connoisseurs, yet “exists at an unarticulated level, easy to invoke but difficult to explicate” [3]. Such recognition skills are also required of other visual experts e.g. radiologists, detecting health issues in medical imaging. Deep learning models have made headway in solving the latter among other object recognition tasks, but are not very good at explaining why or how they recognize something either (though cf. [29]).”unhoused_relations[1]
no type for thisvisual complexity → production complexity — The method assesses only visual complexity in the image, which may or may not correlate with production complexity. — “These new images are compressed (possibly with multiple compression algorithms), and the resulting file sizes are divided by the compression size of the original bitmap; the unfiltered original input is also compressed but divided by the size of the bitmap input. This yields a vector of compression ratios. Further statistical transformations such as colorfulness metrics and fractal dimension [5, 16, 39, 40] (compressions in a broader sense) can also be added to these vectors, and rescaled if the magnitudes differ, which we do (see Methods). Given the perspective of artists as (or as executing) algorithms — in the very broadest sense — our approach aims to capture the residual signal of the generating process, the “algorithmic fingerprints” of an artwork, through the operationalization of various aspects of visual aesthetic complexity, as estimated by compression ratios of the visual transformations. This approach can, however, currently only assess the visual complexity apparent in the image. This may or may not correlate with production complexity, i.e. the time, effort, expertise, etc. that goes into producing an artwork.”unhoused_relations[2]
no type for thisartists → algorithms — Artists are treated as (or as executing) algorithms in the broadest sense, and the method aims to capture the algorithmic fingerprints of the generating process. — “These new images are compressed (possibly with multiple compression algorithms), and the resulting file sizes are divided by the compression size of the original bitmap; the unfiltered original input is also compressed but divided by the size of the bitmap input. This yields a vector of compression ratios. Further statistical transformations such as colorfulness metrics and fractal dimension [5, 16, 39, 40] (compressions in a broader sense) can also be added to these vectors, and rescaled if the magnitudes differ, which we do (see Methods). Given the perspective of artists as (or as executing) algorithms — in the very broadest sense — our approach aims to capture the residual signal of the generating process, the “algorithmic fingerprints” of an artwork, through the operationalization of various aspects of visual aesthetic complexity, as estimated by compression ratios of the visual transformations. This approach can, however, currently only assess the visual complexity apparent in the image. This may or may not correlate with production complexity, i.e. the time, effort, expertise, etc. that goes into producing an artwork.”unhoused_relations[3]
no type for thisaesthetic complexity → cultural complexity — Quantifying the aesthetic complexity of images is offered as a route into the broader study of cultural complexity. — “To the human eye, different images appear more or less complex, but capturing this intuition in a single aesthetic measure is considered hard. Here, we propose a computationally simple, transparent method for modeling aesthetic complexity as a multidimensional algorithmic phenomenon, which enables the systematic analysis of large image datasets. The approach captures visual family resemblance via a multitude of image transformations and subsequent compressions, yielding explainable embeddings. It aligns well with human judgments of visual complexity, and performs well in authorship and style recognition tasks. Showcasing the functionality, we apply the method to 125,000 artworks, recovering trends and revealing new insights regarding historical art, artistic careers over centuries, and emerging aesthetics in a contemporary NFT art market. Our approach, here applied to images but applicable more broadly, provides a new perspective to quantitative aesthetics, connoisseurship, multidimensional meaning spaces, and the study of cultural complexity.”unhoused_relations[4]
limitationThe approach currently assesses only the visual complexity apparent in the image, which may or may not correlate with production complexity (time, effort, expertise). — “These new images are compressed (possibly with multiple compression algorithms), and the resulting file sizes are divided by the compression size of the original bitmap; the unfiltered original input is also compressed but divided by the size of the bitmap input. This yields a vector of compression ratios. Further statistical transformations such as colorfulness metrics and fractal dimension [5, 16, 39, 40] (compressions in a broader sense) can also be added to these vectors, and rescaled if the magnitudes differ, which we do (see Methods). Given the perspective of artists as (or as executing) algorithms — in the very broadest sense — our approach aims to capture the residual signal of the generating process, the “algorithmic fingerprints” of an artwork, through the operationalization of various aspects of visual aesthetic complexity, as estimated by compression ratios of the visual transformations. This approach can, however, currently only assess the visual complexity apparent in the image. This may or may not correlate with production complexity, i.e. the time, effort, expertise, etc. that goes into producing an artwork.”limitations[0]
limitationThe art datasets are small, curated, often biased samples that represent the historiography of art first and the actual history of art second. — “In the case of art collections or databases like Wikiart and art500k, it is important to be clear that these consist of small, curated, often biased samples of art of some place and period. As such, they represent the historiography of art first and the actual history of art second [12] (see Data Limitations in the Methods section for further discussion). When we make claims here about the history or dynamics of visual art, we are only referring to information derived from the sample — but we make the assumption that the sample is reasonably representative and as such informative of the population of Western art in the time periods we cover. This means that the figures depicting historical changes may look different if more data would be available. However, our quantitative method could also be used for systematic study of data set bias.”limitations[1]
limitationThe Historical dataset is biased in several ways - primarily Western, concentrated in the 20th century, with variable and unidentifiable metadata and unknown sampling. — “Our Historical dataset is also likely biased in a number of ways. It features primarily Western art, most of the data is concentrated in the 20th century, the metadata quality varies and is of unidentifiable origin, the sampling mechanisms are unknown but likely biased by archival and selection practices of the various museums and collections in which these reproductions originate and the websites that house them. Still, from an art historical standpoint the dataset provides a reasonable and sufficient proxy benchmark to show the feasibility of our approach. Known biases of the Historical dataset include reliance on partially dated literature, including a corresponding gap of 18th century art, and very likely some variation in terms of reproduction quality due to the broad variety of the crowdsourced images, either found in the public domain or taken from a great variety of literature and online sources on the basis of fair use. Digitizing larger amounts of visual cultural heritage in high resolution, consistent quality, and minimal bias is a generational challenge. While the Historical dataset is sufficient for our proof of concept, as more data in better quality becomes available, descriptions based on our method are expected to also become more precise and representative.”limitations[2]
limitationHomogenising the images is imperfect: the physical originals range from postcard to altarpiece size and this cannot be systematically quantified at scale. — “This approach to homogenizing the images is far from perfect, as the size of the originals that these photographs and scans represent may well range from the size of a postcard to that of an altar piece. Not only that, but the latter may well be represented by a lower resolution image than the former, with better or worse color grading, etc. The dataset contains sparse metadata on original size and we have no way to systematically quantify this issue at scale, which remains a limitation of the current study. However, in a sense, our approach is not very different from making art historical inferences by going through and looking at large visual resource collections, much like students of art history examining art historical survey literature, or an art connoisseur training their eye using a large comprehensive 35 mm slide collection of a library of photos, which historically served exactly this very purpose.”limitations[3]
limitationThe historical trend analysis is explorative and does no statistical testing of the trends. — “Given the explainable nature of compression ensembles, and its demonstrable cognitive and technical plausibility, we proceed to use the method to investigate and interpret aesthetic trends over time. We do this for both the Historical and the Contemporary NFT datasets. To simplify this task, we apply Principal Component Analysis: compression vectors for both the Historical and the Contemporary datasets are fitted in the same PCA space for comparability. An alternative would be to map change over each individual transformation variable, but PCA conveniently allows for focusing on decorrelated latent aspects with most variance, while remaining interpretable through the transformations that load onto each component. Figure 2 depicts change over time in the two first most informative components. The Historical dataset is limited to 1500-2000 on the graph, as both ends outside of that range are quite sparse. The “trend lines” are estimates from a rolling window of ±10 (years of Historical data, days of Contemporary Hic et Nunc). Where there is insufficient data, the window is stretched up to size 50 to include at least 1000 artworks where possible; these broader estimates are reflected by decreased line opacity. We do not engage in statistical testing here, as this exercise is explorative (for dating and style classification testing, see Evaluation in the Methods section).”limitations[4]
limitationThe method deliberately does not quantify iconography, semantics, number of depicted subjects, or beauty. — “To contrast another related body of literature, some previous research has tried to build statistical and machine learning models to explicitly predict what humans participants in psychology experiments perceive as intuitively complex, “aesthetic”, or “beautiful” [14, 20, 25, 43–45]. We did test our approach on a set of human complexity judgments and show that it performs very well (see Methods), but our goal, to provide a general framework, is broader. We use complexity as a practical comparative algorithmic measure, and, to be very clear, “aesthetic” not as a value judgment. Besides “beauty”, here we also do not attempt to quantify complexity in terms of iconography, semantics nor number of depicted subjects (but see Discussion for possible extensions).”limitations[5]
Content tags
content-observations: finding · quantity · variable · definition · key-term — grounded in the full text
findingThe method aligns very well with human visual-complexity judgments; a regression on compression ratios explains 73-83% of variance on MultiPic and 32% on Fractals, far more than gif alone. — “We generate the compression ensemble vectors separately for each of the two datasets, then carry out repeated out-of-sample evaluation where we train a linear regression model on a set of vectors to predict human scores, then test its accuracy on a separate test set. The results are very good, with median absolute error ranging from 0.19 (Multipic English) to 0.23 (Multipic Flemish) on a scale of 0 to 5. To put this in perspective, this is smaller than the differences between languages in this dataset (the median standard deviation of complexity scores per image across languages is 0.24). In Fractals, median absolute error is 0.46 on the same scale of 0 to 5. The linear regression model with compression ratios as predictors describes most of the variance (measured as adjusted \(R^{2}\)) in human visual complexity ratings: 73% (Multipic Italian) to 83% (Multipic Flemish), and 32% in Fractals. By comparison, using gif compression alone describes just \(37-44\%\) (Multipic) and 10% (Fractals). These results provide us with confidence that the approach is cognitively valid, correlating with what the human eye would consider visually complex.”content_tags.findings[0]
findingA simple classifier on the compression vectors detects artist, date, style, genre, and medium well above chance (author 38% vs 1.1% chance; oil vs drawing about 86%). — “Even with a handful of examples and a couple of the most informative transforms, the simple classifier is able to detect above chance the creator, the date, style, genre, and medium of a given artwork. With a 100 examples and the full ensemble of transforms, author (\(n= 91\)) detection accuracy is 38%, which is much higher than the accuracy of 1.1% that random attribution would achieve by chance. Provided 1000 examples per class, oil paintings are distinguished from drawings about 86% of the time, same for landscapes vs human portraits (both have 50% random chance baseline), style period 34% (baseline \(\sim 8\%\)) and century 44% (baseline \(\sim 14\%\)).”content_tags.findings[1]
findingHistorical principal-component trends correspond to art-historical style periods, with a complexity decrease from Realism/Impressionism to mid-20th-century Abstract Expressionism and Pop Art. — “Changes in the trends of the half-millennium Historical dataset correspond broadly to art historical style classifications. PC1 in this model corresponds to texture and detail complexity (loading onto blurs, despeckle filters, and the Canny edge transform). A set of the more frequent style period labels are shown in Fig. 2.A, arranged by the median year of the respective artworks. Visible in the right half of (A), there is a visible median complexity decrease between the period of detailed paintings of Realism and Impressionism and the second half of the 20th century where (in this dimension less complex) styles such as Abstract Expressionism and Pop Art become more prevalent.”content_tags.findings[2]
findingMass-minted NFT portrait series show systematically lower texture/detail complexity and lower, less variable overall compressibility than preceding art. — “Even qualitatively, one can see revealing patterns, such as the mass-minting of initially non-selling NFT portrait images starting around day 110 in mid 2021. These can be described as simple, typically procedurally generated, mugshot or portrait-style images depicting various human, humanoid or cartoon characters. At the height of the NFT boom, the perhaps more widely known examples of this trend on other platforms included the “CryptoPunks” and “Bored Ape Yacht Club” series [51]. On Hic et Nunc, such series are titled for example “AI Pokemon”, “Dino Dudes”, and “NFT-People”. An emergent quality of these mass-produced images is that their texture and detail complexity (PC1, Fig. 2C/E, day 100-150) is substantially lower than the all preceding art, putting them more in the realm of icons or brand logos. At the same time their overall compressibility (PC2, Fig. 2D/F) is not only systematically lower, but also subject to less variance. This could potentially indicate low effort attempts at production of these simple images with hopes of fast monetary gain in the marketplace. The narrowness of the mass-produced NFT series also expresses itself in their skew towards highly saturated primary dominant colors. In at least one case, this indeed seemed to work, where sales follow in the wake of a strong minting burst, mostly consisting of the “NFT-People” and “NFT Kids” series (cf. the rightmost vertical blue line in Fig. 2.E, followed by a light red wake).”content_tags.findings[3]
findingThe compression vectors even support meaningful vector arithmetic, e.g. adding two artwork vectors yields nearest neighbours that fit the combination. — “As an interesting byproduct, the continuous multidimensional ensemble space of compression ratios also allows for mathematical vector operations (not unlike in word embeddings [76]) and explainable latent space exploration. Adding the vectors of Example 4 and 6 of Fig. 1.B, an etching or woodcut print plus the “Garden of earthly delights”, yields a vector where the closest neighbors are fittingly prints of trees and nature (cf. Figure S3). Multiplying a Mondrian vector of Example 1 with an averaged vector of all landscape paintings nets an abstract landscape. Exploring these operations could be an interesting venue of future research.”content_tags.findings[4]
findingClassification errors are systematic and art-historically intuitive - confusions occur between adjacent style periods and similar artists. — “Inspecting the relevant confusion matrices reveals the errors are fairly systematic and intuitive, as classification errors are more likely between adjacent style periods and artists. In the set of 91 artists, Thomas Lawrence and George Romney are most often confused with each other by the model — and indeed, both are portrait artists from roughly the same period (see Fig. 4.D). Conversely, artists in a distinguishable style or genre are easy to identify, for example the 19th century engraver Charles Turner is detected at 97%. Rococo, also known as Late Baroque, is correctly labeled in 47% of the tests, while 16% of it is misclassified as Baroque. Impressionism is easiest to identify (53% correct) — but confused with Post-Impressionism (14%). Expressionism is by far the hardest to put a finger on at 12% (cf. Figure S4 for the confusion matrix of style periods). These error structures are interesting in themselves, and could be investigated in future research.”content_tags.findings[5]
quantity125,000 artworks — total artworks the method is applied to in the showcase — “To the human eye, different images appear more or less complex, but capturing this intuition in a single aesthetic measure is considered hard. Here, we propose a computationally simple, transparent method for modeling aesthetic complexity as a multidimensional algorithmic phenomenon, which enables the systematic analysis of large image datasets. The approach captures visual family resemblance via a multitude of image transformations and subsequent compressions, yielding explainable embeddings. It aligns well with human judgments of visual complexity, and performs well in authorship and style recognition tasks. Showcasing the functionality, we apply the method to 125,000 artworks, recovering trends and revealing new insights regarding historical art, artistic careers over centuries, and emerging aesthetics in a contemporary NFT art market. Our approach, here applied to images but applicable more broadly, provides a new perspective to quantitative aesthetics, connoisseurship, multidimensional meaning spaces, and the study of cultural complexity.”content_tags.quantities[0]
quantity112 transformations — number of image transformations in the model used in this contribution — “The model used in this contribution consists of 112 transformations (see Fig. 1.A for examples; Table S1 and Figure S1 in the Additional file 1 for the full list; we use lossless gif, and also png and lossy jpeg on a smaller subset). The exact nature and number of transformations is unimportant yet subject to optimization. More features increase computation time, but provide more information, i.e. the approximation honing in on the true uncomputable Kolmogorov complexity (see Methods). As demonstrated in the classification experiments in the Methods section, different transforms are informative for different tasks, and, given a specific task, a handful of well-chosen features can yield accuracy close to using a large ensemble. Some transformations, like blurs of various magnitudes, may well correlate. In applications where multicollinearity must be avoided or a lower number of dimensions is desired, methods such as Principal Component Analysis (PCA) or UMAP [49] can easily be applied. In this work we use both, as PCA is directly interpretable due to linear relationship with original variables, while UMAP arguably offers better low-dimensional representations [49].”content_tags.quantities[1]
quantity74028 artworks, 6555 artists, years 1400-2018 — size and span of the Historical dataset — “We make use of two large art corpora to proof the application of the compression ensemble approach for visual data, while exemplifying the exploration of historical and contemporary dynamics of visual art. The first dataset which we denote as “Historical” (henceforth capitalized when being referred to) is illustrated in Fig. 1.B. It is sourced from the art500k project [42], filtered to only include two-dimensional art with a retrievable year of creation. Our subset contains 74028 (primarily Western) artworks representing 6555 artists from the years 1400-2018 (older art exists in the dataset but is sparsely distributed). This filtered dataset ends up consisting mostly of items art500k had in turn sourced from Wikiart.org. The latter is an online, user-editable, encyclopedic collection of mostly Western art images, also frequently used in computer vision research.”content_tags.quantities[2]
quantity51640 artworks, 7284 artists, first 175 days — size and span of the Contemporary Hic et Nunc NFT dataset — “The second dataset, denoted “Contemporary”, is mined from Hic et Nunc, a Tezos blockchain-based NFT art marketplace, representing the first 175 days of its existence (March to August 2021; 51640 artworks, 7284 artists). It contains 31% of all the objects added to the marketplace during our observation period. We only include static images (jpeg, png), as the currently presented approach does not yet extend to multi-frame objects such as animated gifs and videos. We also exclude low resolution images (such as icons), and a subset for which the data collection process failed to retrieve the image. Unlike the Historical dataset which consists of digitized art, the vast majority in the Contemporary set are born-digital images. For an overview of the NFT-driven “crypto art” market, see references [51, 52].”content_tags.quantities[3]
quantity73% to 83% (MultiPic) and 32% (Fractals) — adjusted R-squared of the compression-ratio regression on human visual-complexity ratings — “We generate the compression ensemble vectors separately for each of the two datasets, then carry out repeated out-of-sample evaluation where we train a linear regression model on a set of vectors to predict human scores, then test its accuracy on a separate test set. The results are very good, with median absolute error ranging from 0.19 (Multipic English) to 0.23 (Multipic Flemish) on a scale of 0 to 5. To put this in perspective, this is smaller than the differences between languages in this dataset (the median standard deviation of complexity scores per image across languages is 0.24). In Fractals, median absolute error is 0.46 on the same scale of 0 to 5. The linear regression model with compression ratios as predictors describes most of the variance (measured as adjusted \(R^{2}\)) in human visual complexity ratings: 73% (Multipic Italian) to 83% (Multipic Flemish), and 32% in Fractals. By comparison, using gif compression alone describes just \(37-44\%\) (Multipic) and 10% (Fractals). These results provide us with confidence that the approach is cognitively valid, correlating with what the human eye would consider visually complex.”content_tags.quantities[4]
quantity38% vs 1.1% chance — author detection accuracy among 91 artists versus random-attribution baseline — “Even with a handful of examples and a couple of the most informative transforms, the simple classifier is able to detect above chance the creator, the date, style, genre, and medium of a given artwork. With a 100 examples and the full ensemble of transforms, author (\(n= 91\)) detection accuracy is 38%, which is much higher than the accuracy of 1.1% that random attribution would achieve by chance. Provided 1000 examples per class, oil paintings are distinguished from drawings about 86% of the time, same for landscapes vs human portraits (both have 50% random chance baseline), style period 34% (baseline \(\sim 8\%\)) and century 44% (baseline \(\sim 14\%\)).”content_tags.quantities[5]
variablecompression ratio (per-transformation feature: transformed compressed size divided by the original compression size) — “These new images are compressed (possibly with multiple compression algorithms), and the resulting file sizes are divided by the compression size of the original bitmap; the unfiltered original input is also compressed but divided by the size of the bitmap input. This yields a vector of compression ratios. Further statistical transformations such as colorfulness metrics and fractal dimension [5, 16, 39, 40] (compressions in a broader sense) can also be added to these vectors, and rescaled if the magnitudes differ, which we do (see Methods). Given the perspective of artists as (or as executing) algorithms — in the very broadest sense — our approach aims to capture the residual signal of the generating process, the “algorithmic fingerprints” of an artwork, through the operationalization of various aspects of visual aesthetic complexity, as estimated by compression ratios of the visual transformations. This approach can, however, currently only assess the visual complexity apparent in the image. This may or may not correlate with production complexity, i.e. the time, effort, expertise, etc. that goes into producing an artwork.”content_tags.variables[0]
variablePC1 (first principal component, corresponding to texture and detail complexity) — “Changes in the trends of the half-millennium Historical dataset correspond broadly to art historical style classifications. PC1 in this model corresponds to texture and detail complexity (loading onto blurs, despeckle filters, and the Canny edge transform). A set of the more frequent style period labels are shown in Fig. 2.A, arranged by the median year of the respective artworks. Visible in the right half of (A), there is a visible median complexity decrease between the period of detailed paintings of Realism and Impressionism and the second half of the 20th century where (in this dimension less complex) styles such as Abstract Expressionism and Pop Art become more prevalent.”content_tags.variables[1]
variablePC2 (second principal component, corresponding to overall compressibility) — “PC2 corresponds to overall compressibility (loading onto compression of the original unfiltered image but with different compression algorithms). The median in the Historical dataset is somewhat lower where the dataset contains many Rococo style portraits (in the middle of Fig. 2.B), which typically contain plain (easily compressible) backgrounds — not unlike the pixel-art portraits of Hic et Nunc (cf. days 100-150 in Fig. 2.C-D). PC2 values in Historical (Fig. 2.B) go up around the onset of Impressionism, and the bounds are pushed once more with Cubism, Expressionism, Surrealism, and the general diversification of classic modern “-isms”. As demonstrated in the Evaluation section in Methods, given a sufficient number of transformations, such differences are consistent and diverse enough to predict style periods with reasonable accuracy.”content_tags.variables[2]
variabletemporal resemblance (outcome metric: GAM-adjusted residual median time distance to nearest neighbours) — “The temporal resemblance method generalizes this comparison. Given the vector space of the Historical set (decorrelated using PCA), we can calculate the nearest neighbors for each artwork vector (like the columns in 3.A). We use cosine similarity and the top closest 100 neighbors (excluding works by the same artist). The median temporal distance between these neighbors and the target work indicates if it resembles the past or anticipates some yet unseen future. This allows us to group artists who are traditionalist or historicist, those who stay current, and those ahead of their time. It is necessary to adjust the median time distances to account for the boundedness and density bias of the dataset: the metric reported here is derived from the residuals of a generalized additive regression model (GAM), still on the same yearly timescale (see Additional file 1 for technical details of the adjustment). Figure 3.B again depicts Mondrian’s works, with temporal resemblance now on the vertical axis.”content_tags.variables[3]
variabletransformation (an image-processing operation applied to an image before compression) — “We introduce “compression ensembles”, an efficient and explainable algorithmic comparison framework for images. Instead of attempting to find a single algorithm or metric to best match human judgments or perform on downstream tasks, we argue for an ensemble approach of concurrently using multiple measures. This consists of two steps: multiple transformations and subsequent compression. For a given input image, a set of alternative images is produced by applying a number of different image processing transformations, including various filters, blurs, distortions and color manipulations (see Fig. 1.A, Methods section, and Additional file 1, for details).”content_tags.variables[4]
definitioncompression ensembles — “We introduce “compression ensembles”, an efficient and explainable algorithmic comparison framework for images. Instead of attempting to find a single algorithm or metric to best match human judgments or perform on downstream tasks, we argue for an ensemble approach of concurrently using multiple measures. This consists of two steps: multiple transformations and subsequent compression. For a given input image, a set of alternative images is produced by applying a number of different image processing transformations, including various filters, blurs, distortions and color manipulations (see Fig. 1.A, Methods section, and Additional file 1, for details).”content_tags.definitions[0]
definitionKolmogorov complexity — “Considering quantitative analysis of visual art, it makes sense to adopt algorithmic approaches, as creative processes themselves also follow a set of procedures — or algorithms, in the broadest sense — in which artists may be similar or differ [2, 3, 34]. Algorithmic complexity is best understood via information theory [35, 36], defining the Kolmogorov complexity of a string or dataset as the length of the shortest algorithm reproducing the data. Kolmogorov complexity is uncomputable, but can be approximated using the compression size of a dataset as its upper bound. In the case of images, the more compressible one is — i.e. the larger the difference between a bitmap and a compressed version e.g. gif — the visually simpler it is. This notion in turn can be extended to measures of algorithmic distance, one example being normalized compression distance (NCD) [37]. This however requires a separate compression for each comparison event, and has been rarely applied to visual materials [38]. Pairwise image comparison frameworks [19, 22], suffer from the same computational bottleneck. Furthermore, visual media such as art or photography can, intuitively, differ in various dimensions of complexity, such as color, composition and detail. A single value of complexity would likely fail to capture this multiplicity.”content_tags.definitions[1]
definitionnormalized compression distance — “Considering quantitative analysis of visual art, it makes sense to adopt algorithmic approaches, as creative processes themselves also follow a set of procedures — or algorithms, in the broadest sense — in which artists may be similar or differ [2, 3, 34]. Algorithmic complexity is best understood via information theory [35, 36], defining the Kolmogorov complexity of a string or dataset as the length of the shortest algorithm reproducing the data. Kolmogorov complexity is uncomputable, but can be approximated using the compression size of a dataset as its upper bound. In the case of images, the more compressible one is — i.e. the larger the difference between a bitmap and a compressed version e.g. gif — the visually simpler it is. This notion in turn can be extended to measures of algorithmic distance, one example being normalized compression distance (NCD) [37]. This however requires a separate compression for each comparison event, and has been rarely applied to visual materials [38]. Pairwise image comparison frameworks [19, 22], suffer from the same computational bottleneck. Furthermore, visual media such as art or photography can, intuitively, differ in various dimensions of complexity, such as color, composition and detail. A single value of complexity would likely fail to capture this multiplicity.”content_tags.definitions[2]
definitiontemporal resemblance — “We introduce “temporal resemblance”, a simple metric to summarize and compare artistic careers (Fig. 3). This could be applied to any numeric space (including deep learning embeddings) that includes temporal metadata, but its interpretation of course depends on the space. Here, it represents resemblance in the compression ensemble approximated aesthetic complexity space.”content_tags.definitions[3]
definitionaesthetic — “To contrast another related body of literature, some previous research has tried to build statistical and machine learning models to explicitly predict what humans participants in psychology experiments perceive as intuitively complex, “aesthetic”, or “beautiful” [14, 20, 25, 43–45]. We did test our approach on a set of human complexity judgments and show that it performs very well (see Methods), but our goal, to provide a general framework, is broader. We use complexity as a practical comparative algorithmic measure, and, to be very clear, “aesthetic” not as a value judgment. Besides “beauty”, here we also do not attempt to quantify complexity in terms of iconography, semantics nor number of depicted subjects (but see Discussion for possible extensions).”content_tags.definitions[4]
definitioncompression ratios — “These new images are compressed (possibly with multiple compression algorithms), and the resulting file sizes are divided by the compression size of the original bitmap; the unfiltered original input is also compressed but divided by the size of the bitmap input. This yields a vector of compression ratios. Further statistical transformations such as colorfulness metrics and fractal dimension [5, 16, 39, 40] (compressions in a broader sense) can also be added to these vectors, and rescaled if the magnitudes differ, which we do (see Methods). Given the perspective of artists as (or as executing) algorithms — in the very broadest sense — our approach aims to capture the residual signal of the generating process, the “algorithmic fingerprints” of an artwork, through the operationalization of various aspects of visual aesthetic complexity, as estimated by compression ratios of the visual transformations. This approach can, however, currently only assess the visual complexity apparent in the image. This may or may not correlate with production complexity, i.e. the time, effort, expertise, etc. that goes into producing an artwork.”content_tags.definitions[5]
Concepts
terms this paper carries, each with the sentence it was cut from — the layer that joins one paper to another. Terms with no quote yet are on CONCEPTS.html.
conceptcompression ensemble — not defined in this paper's own words; the paper's named method: an ensemble of image transformations followed by compression, yielding an explainable complexity vector — “We introduce “compression ensembles”, an efficient and explainable algorithmic comparison framework for images. Instead of attempting to find a single algorithm or metric to best match human judgments or perform on downstream tasks, we argue for an ensemble approach of concurrently using multiple measures. This consists of two steps: multiple transformations and subsequent compression. For a given input image, a set of alternative images is produced by applying a number of different image processing transformations, including various filters, blurs, distortions and color manipulations (see Fig. 1.A, Methods section, and Additional file 1, for details).”concepts[0]
conceptaesthetic complexity — not defined in this paper's own words; the multidimensional algorithmic quantity the method models — “To the human eye, different images appear more or less complex, but capturing this intuition in a single aesthetic measure is considered hard. Here, we propose a computationally simple, transparent method for modeling aesthetic complexity as a multidimensional algorithmic phenomenon, which enables the systematic analysis of large image datasets. The approach captures visual family resemblance via a multitude of image transformations and subsequent compressions, yielding explainable embeddings. It aligns well with human judgments of visual complexity, and performs well in authorship and style recognition tasks. Showcasing the functionality, we apply the method to 125,000 artworks, recovering trends and revealing new insights regarding historical art, artistic careers over centuries, and emerging aesthetics in a contemporary NFT art market. Our approach, here applied to images but applicable more broadly, provides a new perspective to quantitative aesthetics, connoisseurship, multidimensional meaning spaces, and the study of cultural complexity.”concepts[1]
conceptvisual aesthetic complexity — not defined in this paper's own words; aesthetic complexity apparent in the image, operationalised through compression ratios — “These new images are compressed (possibly with multiple compression algorithms), and the resulting file sizes are divided by the compression size of the original bitmap; the unfiltered original input is also compressed but divided by the size of the bitmap input. This yields a vector of compression ratios. Further statistical transformations such as colorfulness metrics and fractal dimension [5, 16, 39, 40] (compressions in a broader sense) can also be added to these vectors, and rescaled if the magnitudes differ, which we do (see Methods). Given the perspective of artists as (or as executing) algorithms — in the very broadest sense — our approach aims to capture the residual signal of the generating process, the “algorithmic fingerprints” of an artwork, through the operationalization of various aspects of visual aesthetic complexity, as estimated by compression ratios of the visual transformations. This approach can, however, currently only assess the visual complexity apparent in the image. This may or may not correlate with production complexity, i.e. the time, effort, expertise, etc. that goes into producing an artwork.”concepts[2]
conceptvisual complexity — not defined in this paper's own words; how complex an image appears to the human eye; estimable by compression — “The quantification of visual aesthetics and artistic expression goes back to Birkhoff [1] and Bense [2], inspiring several computational approaches [3–16]. Research drawing on information theory has shown repeatedly and in parallel that visual complexity can be estimated with some accuracy using compression algorithms such as zip or gif [17–29]. While some previous proposals were tested against perceptual human judgments, results diverge as to which compression algorithm or approach would be optimal. Elsewhere in cultural research, measures of compression length have been used at face value to compare the complexity of visual inputs [30–32]. Related information-theoretic approaches have also used entropy to quantify artistic styles and conceptual groupings [8, 12, 33].”concepts[3]
conceptalgorithmic complexity — not defined in this paper's own words; complexity understood via information theory — “Considering quantitative analysis of visual art, it makes sense to adopt algorithmic approaches, as creative processes themselves also follow a set of procedures — or algorithms, in the broadest sense — in which artists may be similar or differ [2, 3, 34]. Algorithmic complexity is best understood via information theory [35, 36], defining the Kolmogorov complexity of a string or dataset as the length of the shortest algorithm reproducing the data. Kolmogorov complexity is uncomputable, but can be approximated using the compression size of a dataset as its upper bound. In the case of images, the more compressible one is — i.e. the larger the difference between a bitmap and a compressed version e.g. gif — the visually simpler it is. This notion in turn can be extended to measures of algorithmic distance, one example being normalized compression distance (NCD) [37]. This however requires a separate compression for each comparison event, and has been rarely applied to visual materials [38]. Pairwise image comparison frameworks [19, 22], suffer from the same computational bottleneck. Furthermore, visual media such as art or photography can, intuitively, differ in various dimensions of complexity, such as color, composition and detail. A single value of complexity would likely fail to capture this multiplicity.”concepts[4]
conceptKolmogorov complexity — not defined in this paper's own words; length of the shortest algorithm reproducing the data; uncomputable, approximated by compression — “Considering quantitative analysis of visual art, it makes sense to adopt algorithmic approaches, as creative processes themselves also follow a set of procedures — or algorithms, in the broadest sense — in which artists may be similar or differ [2, 3, 34]. Algorithmic complexity is best understood via information theory [35, 36], defining the Kolmogorov complexity of a string or dataset as the length of the shortest algorithm reproducing the data. Kolmogorov complexity is uncomputable, but can be approximated using the compression size of a dataset as its upper bound. In the case of images, the more compressible one is — i.e. the larger the difference between a bitmap and a compressed version e.g. gif — the visually simpler it is. This notion in turn can be extended to measures of algorithmic distance, one example being normalized compression distance (NCD) [37]. This however requires a separate compression for each comparison event, and has been rarely applied to visual materials [38]. Pairwise image comparison frameworks [19, 22], suffer from the same computational bottleneck. Furthermore, visual media such as art or photography can, intuitively, differ in various dimensions of complexity, such as color, composition and detail. A single value of complexity would likely fail to capture this multiplicity.”concepts[5]
conceptcompression ratios — not defined in this paper's own words; transformed compressed size divided by the original compression size; the ensemble's features — “These new images are compressed (possibly with multiple compression algorithms), and the resulting file sizes are divided by the compression size of the original bitmap; the unfiltered original input is also compressed but divided by the size of the bitmap input. This yields a vector of compression ratios. Further statistical transformations such as colorfulness metrics and fractal dimension [5, 16, 39, 40] (compressions in a broader sense) can also be added to these vectors, and rescaled if the magnitudes differ, which we do (see Methods). Given the perspective of artists as (or as executing) algorithms — in the very broadest sense — our approach aims to capture the residual signal of the generating process, the “algorithmic fingerprints” of an artwork, through the operationalization of various aspects of visual aesthetic complexity, as estimated by compression ratios of the visual transformations. This approach can, however, currently only assess the visual complexity apparent in the image. This may or may not correlate with production complexity, i.e. the time, effort, expertise, etc. that goes into producing an artwork.”concepts[6]
conceptcompressibility — not defined in this paper's own words; how much an image compresses; greater compressibility means visually simpler — “Importantly, unlike all of the aforementioned machine learning based image embeddings, the dimensions or variables in a compression ensemble remain interpretable: a compression ratio difference between two images for a given transformation indicates that they differ in this aspect. Applying a black-and-white transformation to a colorful image increases compressibility relative to the original (compression ratio ≪1), but has no effect on an already black-and-white image (ratio ≈1). Applying coarse pixelation to Piet Mondrian’s abstract paintings (Fig. 1.B.1) barely changes their compressibility, while it greatly increases compressibility for the highly detailed works of Hieronymus Bosch (Fig. 1.B.6). Therefore, images similar in multiple aspects end up close together in multidimensional compression space, while dissimilar ones stay far apart. Though our approach does not include any visual similarity or object recognition features in the machine learning sense, certain genres do appear more popular within certain regions of the space, depicting features yielding a similar complexity profile (e.g. human half-figures on dark background; Fig. 1.B.2).”concepts[7]
conceptblack-and-white transformation — not defined in this paper's own words; a colour-removing transformation that increases the compressibility of a colourful image — “Importantly, unlike all of the aforementioned machine learning based image embeddings, the dimensions or variables in a compression ensemble remain interpretable: a compression ratio difference between two images for a given transformation indicates that they differ in this aspect. Applying a black-and-white transformation to a colorful image increases compressibility relative to the original (compression ratio ≪1), but has no effect on an already black-and-white image (ratio ≈1). Applying coarse pixelation to Piet Mondrian’s abstract paintings (Fig. 1.B.1) barely changes their compressibility, while it greatly increases compressibility for the highly detailed works of Hieronymus Bosch (Fig. 1.B.6). Therefore, images similar in multiple aspects end up close together in multidimensional compression space, while dissimilar ones stay far apart. Though our approach does not include any visual similarity or object recognition features in the machine learning sense, certain genres do appear more popular within certain regions of the space, depicting features yielding a similar complexity profile (e.g. human half-figures on dark background; Fig. 1.B.2).”concepts[8]
conceptnormalized compression distance — not defined in this paper's own words; an algorithmic distance requiring a separate compression per comparison — “Considering quantitative analysis of visual art, it makes sense to adopt algorithmic approaches, as creative processes themselves also follow a set of procedures — or algorithms, in the broadest sense — in which artists may be similar or differ [2, 3, 34]. Algorithmic complexity is best understood via information theory [35, 36], defining the Kolmogorov complexity of a string or dataset as the length of the shortest algorithm reproducing the data. Kolmogorov complexity is uncomputable, but can be approximated using the compression size of a dataset as its upper bound. In the case of images, the more compressible one is — i.e. the larger the difference between a bitmap and a compressed version e.g. gif — the visually simpler it is. This notion in turn can be extended to measures of algorithmic distance, one example being normalized compression distance (NCD) [37]. This however requires a separate compression for each comparison event, and has been rarely applied to visual materials [38]. Pairwise image comparison frameworks [19, 22], suffer from the same computational bottleneck. Furthermore, visual media such as art or photography can, intuitively, differ in various dimensions of complexity, such as color, composition and detail. A single value of complexity would likely fail to capture this multiplicity.”concepts[9]
conceptalgorithmic distance — not defined in this paper's own words; distance between images in the space of compressed sizes — “However, now consider an image transformation T (e.g. Gaussian blur), which we apply to the uncompressed versions of our four images A, B, C, and D before compressing them. The compressed sizes of \(T(A)\) and \(T(B)\) are still likely to be very similar, as the algorithms that generated the original images are very similar, and the transformation and compression algorithms are identical. \(T(C)\) is very likely to still be very different to \(T(A)\) and \(T(B)\). While the compressed size of D was similar to A and B by chance, it is much more unlikely that \(T(D)\) is also similar to \(T(A)\) and \(T(B)\), as the interaction between the transformation T and the generative algorithm of D would have to change the compressibility in the same way as the interaction of T and A/B. Put more intuitively, a Gaussian blur is very likely to affect the compressibility of a Monet very differently from the compressibility of a Dali. Thus, more generally speaking, two images with similar compressed sizes are much less likely to still yield similar compressed sizes by chance after a transformation unless they are algorithmically similar to start with in which case the combined algorithms of generation and transformation (and their interaction with the compression algorithm) remain similar. If we now consider the application of N different transformations of an uncompressed image A, each applied before a subsequent compression, the compressed sizes (including of the untransformed image) \(c(A)\), \(c(T_{1}(A)),c(T_{2}(A)), \dots, c(T_{N}(A))\) form a vector \({\mathbf{v}}(A)\) of length \(N+1\). It follows from the above argument about coincidental proximity that it becomes increasingly unlikely for two algorithmically dissimilar images to remain close together as N increases. Thus the resulting vector space of compressed sizes provides an indication of algorithmic distance between images.”concepts[10]
concepttransformation — not defined in this paper's own words; an image-processing operation (filter, blur, distortion, colour manipulation) applied before compression — “We introduce “compression ensembles”, an efficient and explainable algorithmic comparison framework for images. Instead of attempting to find a single algorithm or metric to best match human judgments or perform on downstream tasks, we argue for an ensemble approach of concurrently using multiple measures. This consists of two steps: multiple transformations and subsequent compression. For a given input image, a set of alternative images is produced by applying a number of different image processing transformations, including various filters, blurs, distortions and color manipulations (see Fig. 1.A, Methods section, and Additional file 1, for details).”concepts[11]
concepttemporal resemblance — not defined in this paper's own words; a metric summarising an artist's career by median time distance to nearest neighbours in complexity space — “We introduce “temporal resemblance”, a simple metric to summarize and compare artistic careers (Fig. 3). This could be applied to any numeric space (including deep learning embeddings) that includes temporal metadata, but its interpretation of course depends on the space. Here, it represents resemblance in the compression ensemble approximated aesthetic complexity space.”concepts[12]
conceptfamily resemblance — not defined in this paper's own words; the philosophical and cognitive concept of polymorphic similarity, of which the ensemble is an estimate — “The vector space of the ensemble allows for flexible operationalization and visualization, e.g. a single figure (e.g. 3) can summarize careers of several artists. This is not entirely dissimilar to the intuition of an human connoisseur trained on a given corpus of art. As each transformation in an ensemble represents a tangible visual aspect e.g. abundance of detail or colorfulness, as a whole, it constitutes an estimate of the philosophical and cognitive concept of polymorphic family resemblance, originally used to characterize similarity of games such as chess and soccer, later extended to polymorphic visual perception [72–74]. The recognition of visual family resemblance is arguably foundational and intrinsically mastered by trained human art connoisseurs, yet “exists at an unarticulated level, easy to invoke but difficult to explicate” [3]. Such recognition skills are also required of other visual experts e.g. radiologists, detecting health issues in medical imaging. Deep learning models have made headway in solving the latter among other object recognition tasks, but are not very good at explaining why or how they recognize something either (though cf. [29]).”concepts[13]
conceptimage embeddings — not defined in this paper's own words; machine-learning vector representations of images from deep-learning feature spaces — “Importantly, unlike all of the aforementioned machine learning based image embeddings, the dimensions or variables in a compression ensemble remain interpretable: a compression ratio difference between two images for a given transformation indicates that they differ in this aspect. Applying a black-and-white transformation to a colorful image increases compressibility relative to the original (compression ratio ≪1), but has no effect on an already black-and-white image (ratio ≈1). Applying coarse pixelation to Piet Mondrian’s abstract paintings (Fig. 1.B.1) barely changes their compressibility, while it greatly increases compressibility for the highly detailed works of Hieronymus Bosch (Fig. 1.B.6). Therefore, images similar in multiple aspects end up close together in multidimensional compression space, while dissimilar ones stay far apart. Though our approach does not include any visual similarity or object recognition features in the machine learning sense, certain genres do appear more popular within certain regions of the space, depicting features yielding a similar complexity profile (e.g. human half-figures on dark background; Fig. 1.B.2).”concepts[14]
conceptdeep learning — not defined in this paper's own words; pre-trained neural models of computer vision that embed images in feature spaces — “Compression vectors can be rapidly compared, clustered, or used in image recognition and comparison tasks, as demonstrated below. Our method is comparable, but largely orthogonal to deep learning models of computer vision that also embed images in numeric vector spaces. Typically pre-trained on very large image databases, the latter excel at inferring image similarity (in the feature space), and can be tuned to predict discrete classes such as objects on the image, historical style, or authorship [9, 41, 42]. Compression ensembles can also be used to estimate similarity (in the complexity space), and nearby images often depict similar subjects — albeit incidentally, due to shared stylistic commonalities in how certain subjects are depicted (Fig. 1.B). However, the main function of the ensembles is to operationalize visual complexity as such. Our approach infers meaningful values for an input without requiring any costly pre-training, and therefore also entirely bypasses the “training set bias” problem inherent to pre-trained machine learning models. Fitting new images to an already generated vector space here does not require retraining or realignment of the space either, just a matching set of transformations.”concepts[15]
conceptPrincipal Component Analysis — not defined in this paper's own words; linear dimension reduction, interpretable via loadings on the original variables — “The model used in this contribution consists of 112 transformations (see Fig. 1.A for examples; Table S1 and Figure S1 in the Additional file 1 for the full list; we use lossless gif, and also png and lossy jpeg on a smaller subset). The exact nature and number of transformations is unimportant yet subject to optimization. More features increase computation time, but provide more information, i.e. the approximation honing in on the true uncomputable Kolmogorov complexity (see Methods). As demonstrated in the classification experiments in the Methods section, different transforms are informative for different tasks, and, given a specific task, a handful of well-chosen features can yield accuracy close to using a large ensemble. Some transformations, like blurs of various magnitudes, may well correlate. In applications where multicollinearity must be avoided or a lower number of dimensions is desired, methods such as Principal Component Analysis (PCA) or UMAP [49] can easily be applied. In this work we use both, as PCA is directly interpretable due to linear relationship with original variables, while UMAP arguably offers better low-dimensional representations [49].”concepts[16]
conceptUMAP — not defined in this paper's own words; nonlinear dimension reduction giving a proxy topography or field of similarity — “The model used in this contribution consists of 112 transformations (see Fig. 1.A for examples; Table S1 and Figure S1 in the Additional file 1 for the full list; we use lossless gif, and also png and lossy jpeg on a smaller subset). The exact nature and number of transformations is unimportant yet subject to optimization. More features increase computation time, but provide more information, i.e. the approximation honing in on the true uncomputable Kolmogorov complexity (see Methods). As demonstrated in the classification experiments in the Methods section, different transforms are informative for different tasks, and, given a specific task, a handful of well-chosen features can yield accuracy close to using a large ensemble. Some transformations, like blurs of various magnitudes, may well correlate. In applications where multicollinearity must be avoided or a lower number of dimensions is desired, methods such as Principal Component Analysis (PCA) or UMAP [49] can easily be applied. In this work we use both, as PCA is directly interpretable due to linear relationship with original variables, while UMAP arguably offers better low-dimensional representations [49].”concepts[17]
conceptartistic style — not defined in this paper's own words; style as an art-historical property, approximated here as a proxy of aesthetic complexity — “We are less interested in discrete classification (although we do run tests on these tasks, see Methods), and more in efficient exploration and curation of large image sets in the continuous complexity space. We show that this is also a good proxy for aesthetic complexity, and by extension, indeed notions of artistic style (see Figs. 1.B, 3). The issue with discrete style classification [5, 42] is that it inevitably requires training on some “ground truth”, which in the case of historical style periods is highly debatable. Our approach goes beyond limited discrete categories to operate in a continuous aesthetics space.”concepts[18]
conceptconnoisseurship — not defined in this paper's own words; an expert's trained, hard-to-articulate recognition of visual family resemblance — “The vector space of the ensemble allows for flexible operationalization and visualization, e.g. a single figure (e.g. 3) can summarize careers of several artists. This is not entirely dissimilar to the intuition of an human connoisseur trained on a given corpus of art. As each transformation in an ensemble represents a tangible visual aspect e.g. abundance of detail or colorfulness, as a whole, it constitutes an estimate of the philosophical and cognitive concept of polymorphic family resemblance, originally used to characterize similarity of games such as chess and soccer, later extended to polymorphic visual perception [72–74]. The recognition of visual family resemblance is arguably foundational and intrinsically mastered by trained human art connoisseurs, yet “exists at an unarticulated level, easy to invoke but difficult to explicate” [3]. Such recognition skills are also required of other visual experts e.g. radiologists, detecting health issues in medical imaging. Deep learning models have made headway in solving the latter among other object recognition tasks, but are not very good at explaining why or how they recognize something either (though cf. [29]).”concepts[19]
conceptcultural evolution — not defined in this paper's own words; art as a product of cumulative cultural evolution, studiable at scale by the method — “While we focus on complexity, the same approach could be used on other related phenomena. For example, Sinclair et al. [68] raise the concept of “aesthetic value” or “attractiveness” of a given cultural product, to discuss whether art and music indeed could be considered as products of cumulative cultural evolution [66] or not, as “cumulative” would allude to objective improvement over time [69]. From the art historical perspective, a style that builds on or grows out of another style may not be necessarily objectively better, but may better meet the preferences of its consumers in a given time, place, or ecological niche. This is not unlike the concept of communicative need in language: a structure or lexical configuration might not be better in some absolute evolutionary terms, but can be more optimal or efficient given the usage tendencies or needs of a given language community [70, 71].”concepts[20]
conceptaesthetic value — not defined in this paper's own words; the attractiveness of a cultural product; whether art improves objectively over time — “While we focus on complexity, the same approach could be used on other related phenomena. For example, Sinclair et al. [68] raise the concept of “aesthetic value” or “attractiveness” of a given cultural product, to discuss whether art and music indeed could be considered as products of cumulative cultural evolution [66] or not, as “cumulative” would allude to objective improvement over time [69]. From the art historical perspective, a style that builds on or grows out of another style may not be necessarily objectively better, but may better meet the preferences of its consumers in a given time, place, or ecological niche. This is not unlike the concept of communicative need in language: a structure or lexical configuration might not be better in some absolute evolutionary terms, but can be more optimal or efficient given the usage tendencies or needs of a given language community [70, 71].”concepts[21]
conceptensemble methods — not defined in this paper's own words; a statistics/ML technique aggregating models into a single prediction, contrasted with the full-vector output here — “Our approach is also conceptually related to “ensemble methods” in statistics and machine learning [46], but instead of a single aggregated prediction, the useful output here is the full vector of complexity estimates. Approaches using ensembles of various metrics have also been proposed in linguistics for language complexity [47] and economics for tax system complexity [48].”concepts[22]
conceptNFT — not defined in this paper's own words; blockchain-based non-fungible tokens for digital art; the Contemporary dataset — “The second dataset, denoted “Contemporary”, is mined from Hic et Nunc, a Tezos blockchain-based NFT art marketplace, representing the first 175 days of its existence (March to August 2021; 51640 artworks, 7284 artists). It contains 31% of all the objects added to the marketplace during our observation period. We only include static images (jpeg, png), as the currently presented approach does not yet extend to multi-frame objects such as animated gifs and videos. We also exclude low resolution images (such as icons), and a subset for which the data collection process failed to retrieve the image. Unlike the Historical dataset which consists of digitized art, the vast majority in the Contemporary set are born-digital images. For an overview of the NFT-driven “crypto art” market, see references [51, 52].”concepts[23]

Full text — tagged

The reference list is not part of the text we hold for this paper. Our copy was extracted from the publisher's page and the bibliography did not survive that extraction, so the article below ends before its references. Nothing has been removed by us.

Compression ensemblesterm·def quantify aesthetic complexityterm and the evolution of visual art Abstract To the human eye, different images appear more or less complex, but capturing this intuition in a single aestheticterm·def measure is considered hard. Here, we propose a computationally simple, transparent method for modeling aesthetic complexityterm as a multidimensional algorithmic phenomenon, which enables the systematic analysis of large image datasets. The approach captures visual family resemblanceterm via a multitude of image transformationsterm and subsequent compressions, yielding explainable embeddings. It aligns well with human judgments of visual complexityterm, and performs well in authorship and style recognition tasks. Showcasing the functionality, we apply the method to 125,000 artworks, recovering trends and revealing new insights regarding historical art, artistic careers over centuries, and emerging aestheticsterm·def in a contemporary NFTterm art market. Our approach, here applied to images but applicable more broadly, provides a new perspective to quantitative aestheticsterm·def, connoisseurshipterm, multidimensional meaning spaces, and the study of cultural complexity.

1 Introduction The quantification of visual aestheticsterm·def and artistic expression goes back to Birkhoff [1] and Bense [2], inspiring several computational approaches [3–16]. Research drawing on information theory has shown repeatedly and in parallel that visual complexityterm can be estimated with some accuracy using compression algorithms such as zip or gif [17–29]. While some previous proposals were tested against perceptual human judgments, results diverge as to which compression algorithm or approach would be optimal. Elsewhere in cultural research, measures of compression length have been used at face value to compare the complexity of visual inputs [30–32]. Related information-theoretic approaches have also used entropy to quantify artistic stylesterm and conceptual groupings [8, 12, 33].

Considering quantitative analysis of visual art, it makes sense to adopt algorithmic approaches, as creative processes themselves also follow a set of procedures — or algorithms, in the broadest sense — in which artists may be similar or differ [2, 3, 34]. Algorithmic complexityterm is best understood via information theory [35, 36], defining the Kolmogorov complexityterm of a string or dataset as the length of the shortest algorithm reproducing the data. Kolmogorov complexityterm is uncomputable, but can be approximated using the compression size of a dataset as its upper bound. In the case of images, the more compressible one is — i.e. the larger the difference between a bitmap and a compressed version e.g. gif — the visually simpler it is. This notion in turn can be extended to measures of algorithmic distanceterm, one example being normalized compression distanceterm (NCD) [37]. This however requires a separate compression for each comparison event, and has been rarely applied to visual materials [38]. Pairwise image comparison frameworks [19, 22], suffer from the same computational bottleneck. Furthermore, visual media such as art or photography can, intuitively, differ in various dimensions of complexity, such as color, composition and detail. A single value of complexity would likely fail to capture this multiplicity.

1.1 A method proposal We introduce “compression ensemblesterm·def”, an efficient and explainable algorithmic comparison framework for images. Instead of attempting to find a single algorithm or metric to best match human judgments or perform on downstream tasks, we argue for an ensemble approach of concurrently using multiple measures. This consists of two steps: multiple transformationsterm and subsequent compression. For a given input image, a set of alternative images is produced by applying a number of different image processing transformationsterm, including various filters, blurs, distortions and color manipulations (see Fig. 1.A, Methods section, and Additional file 1, for details).

These new images are compressed (possibly with multiple compression algorithms), and the resulting file sizes are divided by the compression size of the original bitmap; the unfiltered original input is also compressed but divided by the size of the bitmap input. This yields a vector of compression ratiosterm. Further statistical transformationsterm such as colorfulness metrics and fractal dimension [5, 16, 39, 40] (compressions in a broader sense) can also be added to these vectors, and rescaled if the magnitudes differ, which we do (see Methods). Given the perspective of artists as (or as executing) algorithms — in the very broadest sense — our approach aims to capture the residual signal of the generating process, the “algorithmic fingerprints” of an artwork, through the operationalization of various aspects of visual aesthetic complexityterm, as estimated by compression ratiosterm of the visual transformationsterm. This approach can, however, currently only assess the visual complexityterm apparent in the image. This may or may not correlate with production complexity, i.e. the time, effort, expertise, etc. that goes into producing an artwork.

As demonstrated below, compression ensemblesterm·def can be used for estimating relative visual complexityterm as a multidimensional phenomenon; inferring specific aestheticterm·def aspects of complexity where any two images or artist oeuvres differ; and as input to any predictive downstream tasks where image complexity (and by proxy aestheticterm·def or stylistic) profiles matter. We also show its use as a “computational art historian” or “curator” algorithm to quantify and systematically explore the dynamics of art artistic careers in very large datasets. While we focus our showcase here on art, it is suitable for comparing any sort of images, and as described in the Discussion, straightforwardly extendable to other types of media to estimate their inherent aesthetic complexityterm.

1.2 Relation to other image embeddingterm approaches Compression vectors can be rapidly compared, clustered, or used in image recognition and comparison tasks, as demonstrated below. Our method is comparable, but largely orthogonal to deep learningterm models of computer vision that also embed images in numeric vector spaces. Typically pre-trained on very large image databases, the latter excel at inferring image similarity (in the feature space), and can be tuned to predict discrete classes such as objects on the image, historical style, or authorship [9, 41, 42]. Compression ensemblesterm·def can also be used to estimate similarity (in the complexity space), and nearby images often depict similar subjects — albeit incidentally, due to shared stylistic commonalities in how certain subjects are depicted (Fig. 1.B). However, the main function of the ensembles is to operationalize visual complexityterm as such. Our approach infers meaningful values for an input without requiring any costly pre-training, and therefore also entirely bypasses the “training set bias” problem inherent to pre-trained machine learning models. Fitting new images to an already generated vector space here does not require retraining or realignment of the space either, just a matching set of transformationsterm.

We are less interested in discrete classification (although we do run tests on these tasks, see Methods), and more in efficient exploration and curation of large image sets in the continuous complexity space. We show that this is also a good proxy for aesthetic complexityterm, and by extension, indeed notions of artistic styleterm (see Figs. 1.B, 3). The issue with discrete style classification [5, 42] is that it inevitably requires training on some “ground truth”, which in the case of historical style periods is highly debatable. Our approach goes beyond limited discrete categories to operate in a continuous aestheticsterm·def space.

To contrast another related body of literature, some previous research has tried to build statistical and machine learning models to explicitly predict what humans participants in psychology experiments perceive as intuitively complex, “aestheticterm·def”, or “beautiful” [14, 20, 25, 43–45]. We did test our approach on a set of human complexity judgments and show that it performs very well (see Methods), but our goal, to provide a general framework, is broader. We use complexity as a practical comparative algorithmic measure, and, to be very clear, “aestheticterm·def” not as a value judgment. Besides “beauty”, here we also do not attempt to quantify complexity in terms of iconography, semantics nor number of depicted subjects (but see Discussion for possible extensions).

Our approach is also conceptually related to “ensemble methodsterm” in statistics and machine learning [46], but instead of a single aggregated prediction, the useful output here is the full vector of complexity estimates. Approaches using ensembles of various metrics have also been proposed in linguistics for language complexity [47] and economics for tax system complexity [48].

1.3 Explainable vector spaces Importantly, unlike all of the aforementioned machine learning based image embeddingsterm, the dimensions or variables in a compression ensembleterm remain interpretable: a compression ratioterm·var difference between two images for a given transformationterm indicates that they differ in this aspect. Applying a black-and-white transformationterm to a colorful image increases compressibilityterm relative to the original (compression ratioterm·var ≪1), but has no effect on an already black-and-white image (ratio ≈1). Applying coarse pixelation to Piet Mondrian’s abstract paintings (Fig. 1.B.1) barely changes their compressibilityterm, while it greatly increases compressibilityterm for the highly detailed works of Hieronymus Bosch (Fig. 1.B.6). Therefore, images similar in multiple aspects end up close together in multidimensional compression space, while dissimilar ones stay far apart. Though our approach does not include any visual similarity or object recognition features in the machine learning sense, certain genres do appear more popular within certain regions of the space, depicting features yielding a similar complexity profile (e.g. human half-figures on dark background; Fig. 1.B.2).

The model used in this contribution consists of 112 transformationsterm (see Fig. 1.A for examples; Table S1 and Figure S1 in the Additional file 1 for the full list; we use lossless gif, and also png and lossy jpeg on a smaller subset). The exact nature and number of transformationsterm is unimportant yet subject to optimization. More features increase computation time, but provide more information, i.e. the approximation honing in on the true uncomputable Kolmogorov complexityterm (see Methods). As demonstrated in the classification experiments in the Methods section, different transforms are informative for different tasks, and, given a specific task, a handful of well-chosen features can yield accuracy close to using a large ensemble. Some transformationsterm, like blurs of various magnitudes, may well correlate. In applications where multicollinearity must be avoided or a lower number of dimensions is desired, methods such as Principal Component Analysisterm (PCA) or UMAPterm [49] can easily be applied. In this work we use both, as PCA is directly interpretable due to linear relationship with original variables, while UMAPterm arguably offers better low-dimensional representations [49].

Dimension reduction like UMAPterm can be used to produce a complementary “field of similarity” [50] where similar images cluster together intuitively, while remaining subject to the “curse of dimensionality” (Fig. 1.B). We can break the curse by repeatedly mapping individual transformationsterm onto the common UMAPterm, effectively using it as a reference topography (Figs. 1.C and S2). The resulting “small multiple” of visualizations provides intuition why an ensemble of multiple transformationsterm is necessary towards a fuller understanding of visual aesthetic complexityterm. It also relates to the explainability aspect: images being in different ends of a given transformationterm variable (colored brown to blue in 1.C) indicates they differ in the aspect of complexity represented by the given distortion.

In this contribution, we define and test the compression ensembleterm approach in a number of experiments from human complexity judgments to example downstream classification tasks (see Methods section). In the Results section, we showcase the utility of the approach for the exploration of art collections, quantifying global trends in historical art over the past six centuries in a large dataset, and the first half a year of a non-fungible token (NFTterm) art marketplace. On historical timescales, we introduce a temporal resemblanceterm model to quantify artistic career trajectories, grouping them into qualitatively distinct types. We reveal artists that were well embedded in the historical tradition of their time, those who simultaneously experimented with different areas of the aesthetic complexityterm space, artists with transitory success, and those who were later seen as ahead of their time. Finally, we discuss the broader relevance of the approach to digital art history, cultural evolutionterm, and extensions to other media and modalities.

2 Results We make use of two large art corpora to proof the application of the compression ensembleterm approach for visual data, while exemplifying the exploration of historical and contemporary dynamics of visual art. The first dataset which we denote as “Historical” (henceforth capitalized when being referred to) is illustrated in Fig. 1.B. It is sourced from the art500k project [42], filtered to only include two-dimensional art with a retrievable year of creation. Our subset contains 74028 (primarily Western) artworks representing 6555 artists from the years 1400-2018 (older art exists in the dataset but is sparsely distributed). This filtered dataset ends up consisting mostly of items art500k had in turn sourced from Wikiart.org. The latter is an online, user-editable, encyclopedic collection of mostly Western art images, also frequently used in computer vision research.

In the case of art collections or databases like Wikiart and art500k, it is important to be clear that these consist of small, curated, often biased samples of art of some place and period. As such, they represent the historiography of art first and the actual history of art second [12] (see Data Limitations in the Methods section for further discussion). When we make claims here about the history or dynamics of visual art, we are only referring to information derived from the sample — but we make the assumption that the sample is reasonably representative and as such informative of the population of Western art in the time periods we cover. This means that the figures depicting historical changes may look different if more data would be available. However, our quantitative method could also be used for systematic study of data set bias.

The second dataset, denoted “Contemporary”, is mined from Hic et Nunc, a Tezos blockchain-based NFTterm art marketplace, representing the first 175 days of its existence (March to August 2021; 51640 artworks, 7284 artists). It contains 31% of all the objects added to the marketplace during our observation period. We only include static images (jpeg, png), as the currently presented approach does not yet extend to multi-frame objects such as animated gifs and videos. We also exclude low resolution images (such as icons), and a subset for which the data collection process failed to retrieve the image. Unlike the Historical dataset which consists of digitized art, the vast majority in the Contemporary set are born-digital images. For an overview of the NFT-driven “crypto art” market, see references [51, 52].

The obvious question is whether simple vectors of file size ratios are provably informative about visual complexityterm or artistic aestheticsterm·def. We carried out two sets of experiments to verify that the compression ensemblesterm·def are fit for this purpose, and show that they allow us to meaningfully track the evolution of complexity in historical art. As detailed in the Evaluation subsection under Methods, we first tested the approach against two sets of human visual complexityterm judgments, where it performed very well, aligning with what people would judge to be visually simple or complex. This indicates the method is cognitively plausible as a visual complexityterm estimator. Secondly, we devised a set of classification experiments to determine if there is enough information in a compression ensembleterm to meaningfully delineate aspects of interest in visual art such as style, genre, authorship and medium. The model yields reasonable accuracy in all cases (and its mis-classifications make sense from an art historical point of view). This indicates the method is fit for purpose for the exploratory tasks showcased in the next section.

2.1 Tracking historical and contemporary art dynamics Given the explainable nature of compression ensemblesterm·def, and its demonstrable cognitive and technical plausibility, we proceed to use the method to investigate and interpret aestheticterm·def trends over time. We do this for both the Historical and the Contemporary NFTterm datasets. To simplify this task, we apply Principal Component Analysisterm: compression vectors for both the Historical and the Contemporary datasets are fitted in the same PCA space for comparability. An alternative would be to map change over each individual transformationterm variable, but PCA conveniently allows for focusing on decorrelated latent aspects with most variance, while remaining interpretable through the transformationsterm that load onto each component. Figure 2 depicts change over time in the two first most informative components. The Historical dataset is limited to 1500-2000 on the graph, as both ends outside of that range are quite sparse. The “trend lines” are estimates from a rolling window of ±10 (years of Historical data, days of Contemporary Hic et Nunc). Where there is insufficient data, the window is stretched up to size 50 to include at least 1000 artworks where possible; these broader estimates are reflected by decreased line opacity. We do not engage in statistical testing here, as this exercise is explorative (for dating and style classification testing, see Evaluation in the Methods section).

Changes in the trends of the half-millennium Historical dataset correspond broadly to art historical style classifications. PC1term·var in this model corresponds to texture and detail complexity (loading onto blurs, despeckle filters, and the Canny edge transform). A set of the more frequent style period labels are shown in Fig. 2.A, arranged by the median year of the respective artworks. Visible in the right half of (A), there is a visible median complexity decrease between the period of detailed paintings of Realism and Impressionism and the second half of the 20th century where (in this dimension less complex) styles such as Abstract Expressionism and Pop Art become more prevalent.

PC2term·var corresponds to overall compressibilityterm (loading onto compression of the original unfiltered image but with different compression algorithms). The median in the Historical dataset is somewhat lower where the dataset contains many Rococo style portraits (in the middle of Fig. 2.B), which typically contain plain (easily compressible) backgrounds — not unlike the pixel-art portraits of Hic et Nunc (cf. days 100-150 in Fig. 2.C-D). PC2term·var values in Historical (Fig. 2.B) go up around the onset of Impressionism, and the bounds are pushed once more with Cubism, Expressionism, Surrealism, and the general diversification of classic modern “-isms”. As demonstrated in the Evaluation section in Methods, given a sufficient number of transformationsterm, such differences are consistent and diverse enough to predict style periods with reasonable accuracy.

The Historical and Contemporary sets are combined in the same space, but the ranges of the vertical axes representing the components in Figs. 2.A-B versus C-D are intentionally different, as the two datasets occupy markedly different ranges in the complexity space, with much higher variance in the Contemporary Hic et Nunc dataset compared to the more conventional Historical dataset. This does not necessarily mean that art in the last 500 years has been less creative or explorative. The relative boundedness instead is more plausibly rooted in a combination of material affordances and limits of curation and scholarship. The latter is a function of cultural selection, as collectors, audiences, and art historians put a bound on what has been and is considered worthwhile of adding to collections from the time of creation to current retrospectives.

In contrast, anybody who is able to pay the fairly low “minting” fee can upload an artwork to blockchain art market places such as Hic et Nunc, making their creations public in an attempt to get attention and sell. The Historical broadening of the parameter space goes in lockstep with the fraction of noted creatives growing faster than world population in the last five centuries [53]. It is broadly established knowledge in art history that new technologies and concepts, from pigments to theories of perception [54], were harnessed by said creatives. Examples include the emergence of more affordable blue pigment alternatives to the rare and expensive azurite and lapis lazuli, or (color) photography, which put traditional pictorial conventions of depiction into question. Another striking difference between the Historical and the Contemporary NFTterm dataset becomes visible in Figs. 2.A-B versus C-D when we focus on the range of colors in the single-pixel reductions of the artworks. The digital NFTterm images appear darker and more saturated, as they are using the full RGB color space, while the dominant color of Historical artworks tends to remain in the range of “natural” pigments, which one could buy in a physical art supply store.

Since we have information on transactions in the Hic et Nunc dataset (as of the data collection time, 22 August 2021), successful sales are shown as inset heatmaps (E, F) in Fig. 2.D. The heatmaps show the fraction of sales across the first and second principal components respectively. About half the objects in the Hic et Nunc sample in total were sold off by their authors during our observation period, with some areas — dark red in the insets — being clearly more conductive to sales, while others do not sell at all.

Even qualitatively, one can see revealing patterns, such as the mass-minting of initially non-selling NFTterm portrait images starting around day 110 in mid 2021. These can be described as simple, typically procedurally generated, mugshot or portrait-style images depicting various human, humanoid or cartoon characters. At the height of the NFTterm boom, the perhaps more widely known examples of this trend on other platforms included the “CryptoPunks” and “Bored Ape Yacht Club” series [51]. On Hic et Nunc, such series are titled for example “AI Pokemon”, “Dino Dudes”, and “NFT-People”. An emergent quality of these mass-produced images is that their texture and detail complexity (PC1term·var, Fig. 2C/E, day 100-150) is substantially lower than the all preceding art, putting them more in the realm of icons or brand logos. At the same time their overall compressibilityterm (PC2term·var, Fig. 2D/F) is not only systematically lower, but also subject to less variance. This could potentially indicate low effort attempts at production of these simple images with hopes of fast monetary gain in the marketplace. The narrowness of the mass-produced NFTterm series also expresses itself in their skew towards highly saturated primary dominant colors. In at least one case, this indeed seemed to work, where sales follow in the wake of a strong minting burst, mostly consisting of the “NFT-People” and “NFTterm Kids” series (cf. the rightmost vertical blue line in Fig. 2.E, followed by a light red wake).

These initial observations could of course be augmented with more systematic statistical or predictive modeling in future research. As an example, we trained a simple classifier, Linear Discriminant Analysis (see Evaluation section under Methods) on the sales data, predicting whether an NFTterm art piece was sold or not, based on the values in the compression vectors. Using training sets of size 20k per class and separate test sets of 5k (and replicating the model 500 times), the model predicts sales at an average accuracy of 58% (or a 17% kappa, given the 50-50 baseline). This is despite containing no information on the prestige or reach of the artists, past sales, the depicted content, nor trends of the market of the respective time. A linear regression model fitted to 23370 sold items predicting log price (excluding zero-price giveaways) by all the compression variables describes about 6% of variance (adjusted \(R^{2}\)); allowing for interaction with the time variable improves this to 8%. While these are all fairly low scores in absolute terms, we consider this a promising result for future research, likely improved by combining our aestheticsterm·def model with the aforementioned variables of author properties, sales history and past trends [44, 52], to predict future trends in evolving art markets.

2.2 Quantifying temporal resemblanceterm in artistic careers In the previous section, we took a look into art history as a whole. We can also use compression ensemblesterm·def to investigate how the oeuvres of individual artists progress and are situated in their eras. Tracing “the lives of the artists” has been a foundational and central direction in the historiography of art since the 1550 book by Giorgio Vasari which initiated the genre [55], followed by a great number of artist monographs and critical catalogs. More recently, multidisciplinary science has tackled the issue using methods of network science and quantitative measures of success, making use of data such as demographic and migration records [53, 56, 57], museum, exhibition and art market price information [58, 59], but also visual aestheticterm·def aspects using information theory or machine learning [7, 12, 60].

We introduce “temporal resemblanceterm”, a simple metric to summarize and compare artistic careers (Fig. 3). This could be applied to any numeric space (including deep learningterm embeddings) that includes temporal metadata, but its interpretation of course depends on the space. Here, it represents resemblance in the compression ensembleterm approximated aesthetic complexityterm space.

Figure 3.A provides an illustration, using the oeuvre of Piet Mondrian: the rows are transformationsterm; the columns his works, arranged diachronically. For this example, the compression ratioterm·var values are z-scored using the mean and standard deviation of his era. This means that the blue to red scale is interpretable as “higher or lower than contemporaries”, and white as being close to the mean. Mondrian’s departure from the era’s mainstream is quite clear from the increase of darker reds and blues. The transformationsterm provide insight as to which areas are most contrasting (labels on the dendrogram in 3.A).

The temporal resemblanceterm method generalizes this comparison. Given the vector space of the Historical set (decorrelated using PCA), we can calculate the nearest neighbors for each artwork vector (like the columns in 3.A). We use cosine similarity and the top closest 100 neighbors (excluding works by the same artist). The median temporal distance between these neighbors and the target work indicates if it resembles the past or anticipates some yet unseen future. This allows us to group artists who are traditionalist or historicist, those who stay current, and those ahead of their time. It is necessary to adjust the median time distances to account for the boundedness and density bias of the dataset: the metric reported here is derived from the residuals of a generalized additive regression model (GAM), still on the same yearly timescale (see Additional file 1 for technical details of the adjustment). Figure 3.B again depicts Mondrian’s works, with temporal resemblanceterm now on the vertical axis.

This metric is relative to the point in time of each work, and all measures are relative to all other works. Therefore, curves that stay close to the zero line in Figs. 3.B/C should be interpreted as artists who produce works that are similar to other artworks made in the same years, in terms of aesthetic complexityterm (and thus aspects of their style — but we are not quantifying the subjects they depict). That does not preclude changes in their style, if the changes in the artist and their era correlate. Staying around the zero may also indicate that a given artist is surrounded by a handful of prolific contemporaries with very similar output, who as a group may not be representative of the mainstream. Descending curves can indicate an artist who becomes more traditional, the world catching up to an artist’s style, or the world adopting other new styles.

Figure 3.C depicts the careers of 20 artists, grouped by career trend similarity, revealing different modes of artistic existence, similar yet not identical to the narrative types of Vonnegut [61]. To trained art historians (as represented among the authors of this paper) these results are intuitively correct — but of course the career comparisons discussed here only refer to artworks that are present and dated in our dataset. Some such as Piet Mondrian or Mark Rothko, “rise above the flock”, starting out in the mainstream, growing into their own distinct style, with works that could be considered ahead of their time. Paul Cezanne and Mary Cassatt instead become “constant innovators”, starting out by producing conventional, retrospective works, but growing and remaining innovative throughout the rest of his careers. Albert Bierstadt and Camille Corot represent “mainstream artists”, appearing more narrow in their practice, and remaining consistent with the current of their peers. There are also those who “rise and fall” (see James Mcneill Whistler or William Merritt Chase), growing to their moment in history, then becoming more conventional again over the course of their careers. The metric highlights Eastman Johnson, who was predominantly drawing inspiration from the past, even at the height of his career. But even innovative careers may include revivals on occasion; e.g. Paul Cezanne also has works resembling the complexity profiles of art preceding his own by 100-200 years.

As a static graph, Fig. 3 just exemplifies how compression ensemblesterm·def (or other embeddings) can be used to filter and cluster artistic trajectories. Figure S5 provides an alternative version of Fig. 3.B/C with larger thumbnails. Interactive versions of such plots could function as a research instrument for qualitative experts, to investigate the quantitative model and dataset biases, and compare artists between different datasets. In a related project [62], we developed an interactive web interface titled Collection Space Navigator, which allows for on-the-fly visualization of large collections, and operations such as zooming, filtering, and hovering for more information. Its online demo also features a large subset of the Historical dataset used here, including functions to operate with compression ensemblesterm·def (link in the Availability of data and materials section below).

3 Discussion Products of human culture, such as art, language and music are all subject to ongoing change, complex dynamics, and cumulative evolution [63–66]. And even though complexity could emerge from a simple generating mechanism in principle, a single unidimensional measure would likely prove insufficient to capture the polymorphic complexity of human cultural interaction and cultural products [67]. Here, we have demonstrated the utility of explainable compression ensemblesterm·def to quantify polymorphic visual aesthetic complexityterm. We showed how the approach can recover and reveal meaningful patterns in datasets of historical and contemporary art, and, in the methods section, we evaluated the cognitive plausibility of our approach, tested its viability at author, date, style, genre, and medium detection tasks. Given the increasing availability of cultural datasets in machine-readable form, this operationalization opens up new avenues to study the dynamics of visual art aestheticsterm·def at scale, over long time spans and almost in real time. As such, the approach may help to transcend the still considerable specialization and bifurcation (by artist, period, style, etc.) of qualitative art historical scholarship. Our approach could be used to fill a similar niche in art history as computational corpus linguistics does in relation to the qualitative study of literature.

3.1 Cultural evolutionterm and aesthetic valueterm While we focus on complexity, the same approach could be used on other related phenomena. For example, Sinclair et al. [68] raise the concept of “aesthetic valueterm” or “attractiveness” of a given cultural product, to discuss whether art and music indeed could be considered as products of cumulative cultural evolutionterm [66] or not, as “cumulative” would allude to objective improvement over time [69]. From the art historical perspective, a style that builds on or grows out of another style may not be necessarily objectively better, but may better meet the preferences of its consumers in a given time, place, or ecological niche. This is not unlike the concept of communicative need in language: a structure or lexical configuration might not be better in some absolute evolutionary terms, but can be more optimal or efficient given the usage tendencies or needs of a given language community [70, 71].

Our method goes beyond discrete categories and facilitates studying visual culture using a continuous form of aestheticterm·def representation to examine such questions, as exemplified in the temporal resemblanceterm section above. Naturally, the extent that need or preference can be studied depends on available data. E.g. the Historical set represents only a rough estimate of a (primarily Western, biased, somewhat dated) preference consensus, while the Hic et Nunc data includes artist, collector, trade and price info, which could be (carefully) interpreted as preference, as well as linked with the (social) media activity of the sellers and buyers.

3.2 Family resemblanceterm and connoisseurshipterm The vector space of the ensemble allows for flexible operationalization and visualization, e.g. a single figure (e.g. 3) can summarize careers of several artists. This is not entirely dissimilar to the intuition of an human connoisseur trained on a given corpus of art. As each transformationterm in an ensemble represents a tangible visual aspect e.g. abundance of detail or colorfulness, as a whole, it constitutes an estimate of the philosophical and cognitive concept of polymorphic family resemblanceterm, originally used to characterize similarity of games such as chess and soccer, later extended to polymorphic visual perception [72–74]. The recognition of visual family resemblanceterm is arguably foundational and intrinsically mastered by trained human art connoisseurs, yet “exists at an unarticulated level, easy to invoke but difficult to explicate” [3]. Such recognition skills are also required of other visual experts e.g. radiologists, detecting health issues in medical imaging. Deep learningterm models have made headway in solving the latter among other object recognition tasks, but are not very good at explaining why or how they recognize something either (though cf. [29]).

Our explorations of the Historical dataset yield results that meaningfully reflect the art historical scholarship underlying the dataset (Figs. 2, 3). The model captures enough family resemblanceterm to cluster together similar styles or works by the same artist (as verified in Methods), demonstrating the explanatory power of using an ensemble of multiple transparent transformationsterm, effectively addressing what Friedländer in his foundational art connoisseurshipterm book [75] called “the visible in its manifoldness and unity, bristling against conceptual segmentation, so that the boundaries between the species of images get into flow” or get “blurred” (p. 60; our translation).

As an interesting byproduct, the continuous multidimensional ensemble space of compression ratiosterm also allows for mathematical vector operations (not unlike in word embeddings [76]) and explainable latent space exploration. Adding the vectors of Example 4 and 6 of Fig. 1.B, an etching or woodcut print plus the “Garden of earthly delights”, yields a vector where the closest neighbors are fittingly prints of trees and nature (cf. Figure S3). Multiplying a Mondrian vector of Example 1 with an averaged vector of all landscape paintings nets an abstract landscape. Exploring these operations could be an interesting venue of future research.

3.3 A window to cultural meaning space We used three kinds of vector spaces: the full multidimensional ensemble space of compression ratiosterm, the decorrelated multidimensional space of associated PCA components, and a dimension-reduced UMAPterm space providing a proxy topography. These can also be understood as subspaces of more general cultural meaning spaces, and interpreted though or used in various other approaches to culture, briefly exemplified below, with potential to be developed further in future work on quantitative aestheticsterm·def. In Cassirer’s most general reference framework they would be “spaces of geometric intuition” [77–79], also later referred to in art history as “iconologic” aspects, complementing the associated contextual information including “iconographic” aspects [80]. They resonate with the conceptual spaces theory of Gärdenfors [81, 82], as well as with the notion of information space [83]. Future work could also look into resonance between our and the recent deep learningterm driven “distributed information bottleneck” proposal [29] which also involves visual transformationsterm in the case of images.

3.4 Extensions to other visual media, audio, video and text Here we focused on static, 2D art such as paintings and digital drawings. However, there is no reason the same methodology could not be applied to quantify other visual media such as photographs, maps [11, 17], websites [84] or natural patterns [27] to assess their aesthetic complexityterm (and by proxy, style) in a transparent, explainable framework. Multi-frame visual media such as film and animation could be split up by frame or shot, and represented in a compression ensembleterm as ordered sets of vectors, or alternatively, transformed using video filters and compressed directly using video compression algorithms. Similarly, the aesthetic complexityterm of sound and music [85, 86] could be inferred by either applying the same visual transformationsterm to spectrograms, or by using audio filters as the transformationsterm followed by audio compression. 3D objects such as sculptures, architecture, or clothing can be operationalized by systematically scanning them from multiple angles, or using 3D versions of transformationsterm and compressions (voxels instead of pixels). For written text, an ensemble of byte pair encoding [87] models (with variable parameters or trained on different genres) could be used as the transformationsterm.

3.5 Combining compression ensemblesterm·def with other vector spaces to study culture at scale For multi-modal media, multiple ensembles or embeddings can be concatenated, provided a principled way to weigh or normalize their contribution [88]. If both feature similarity and aesthetic complexityterm matter in a given application, a compression ensembleterm could be horizontally aligned and concatenated with a suitable deep learningterm embedding [42], an approach shown to be fruitful in NLP [89]. A scene in a film or a recorded theater play could be represented by the concatenation of a visual compression ensembleterm, an audio compression ensembleterm, an image embeddingterm, and a language model embedding [90] of the spoken dialogue. A compression ensembleterm could also be combined with the larger apparatus of art history, in the form of socio-cultural context information from relevant databases and knowledge graphs [91] or any other visual feature vectors [13, 16, 92]. Furthermore, features or objects (e.g. humans) could be extracted using a deep learningterm classifier, followed by a compression ensembleterm of these sub-images, producing e.g. an aestheticterm·def vector space of human pose, effectively a further operationalization of Aby Warburg’s Mnemosyne [93, 94].

Understanding cultural products at scale is not only relevant just because of the growing body of born-digital culture and digitization efforts of non-digitized culture. We stand at the threshold of an AI revolution, where the fully automated generation of photo-realistic, artistic and otherwise previously primarily human-produced visual content (and soon likely multimedia too) has suddenly become feasible, accessible and affordable, using e.g. models like Dall-E or Stable Diffusion [95]. This is likely to transform multiple entire industries, but the functionally near-infinite content quantity will require curation and understanding to be made efficient use of. Pretrained deep learningterm embeddings can be used to calculate and cluster similar items in a feature space, or be trained to predict preset objects, styles or human preferences. Our explainable compression ensemblesterm·def are however well-positioned to make sense of such spaces and navigate aestheticsterm·def, without requiring any “training” — indeed, consisting of already meaningful values, they are not constrained by the need to predict anything specific to be functional.

4 Methods 4.1 Constructing a vector space of algorithmic distanceterm As discussed in the Introduction, compression as such has been used to estimate visual and aesthetic complexityterm before. In some applications, it has also consisted of or included combination with limited visual transformationsterm [5, 24, 25, 27–29, 40, 44]. However, the fairly large number of transformationsterm is key to our approach, with the following rationale.

Consider two algorithmically similar uncompressed images A and B, for example two versions of the same famous view of Rouen cathedral by Claude Monet (of which the artist painted more than 30 in 1892/93). These two images will yield similar compressed sizes for the same compression algorithm because the “algorithm” that generated them (being a function of Monet’s perspective, style, and execution) is similar. Another artwork C, e.g. a late, abstract work by Piet Mondrian will, due its lack of detail, likely have a much smaller compression size. However it is entirely conceivable that a work D that is stylistically very different to Monet’s Rouen cathedral, e.g. a surrealist painting by Salvador Dali, might by chance have a very similar compression size. The “algorithms” used by Monet and Dali differ greatly, and an equal compression size does not imply that they are of equal algorithmic complexityterm either, as the efficiency of the compression algorithm itself will differ depending on the detailed characteristics of the images.

However, now consider an image transformationterm T (e.g. Gaussian blur), which we apply to the uncompressed versions of our four images A, B, C, and D before compressing them. The compressed sizes of \(T(A)\) and \(T(B)\) are still likely to be very similar, as the algorithms that generated the original images are very similar, and the transformationterm and compression algorithms are identical. \(T(C)\) is very likely to still be very different to \(T(A)\) and \(T(B)\). While the compressed size of D was similar to A and B by chance, it is much more unlikely that \(T(D)\) is also similar to \(T(A)\) and \(T(B)\), as the interaction between the transformationterm T and the generative algorithm of D would have to change the compressibilityterm in the same way as the interaction of T and A/B. Put more intuitively, a Gaussian blur is very likely to affect the compressibilityterm of a Monet very differently from the compressibilityterm of a Dali. Thus, more generally speaking, two images with similar compressed sizes are much less likely to still yield similar compressed sizes by chance after a transformationterm unless they are algorithmically similar to start with in which case the combined algorithms of generation and transformationterm (and their interaction with the compression algorithm) remain similar. If we now consider the application of N different transformationsterm of an uncompressed image A, each applied before a subsequent compression, the compressed sizes (including of the untransformed image) \(c(A)\), \(c(T_{1}(A)),c(T_{2}(A)), \dots, c(T_{N}(A))\) form a vector \({\mathbf{v}}(A)\) of length \(N+1\). It follows from the above argument about coincidental proximity that it becomes increasingly unlikely for two algorithmically dissimilar images to remain close together as N increases. Thus the resulting vector space of compressed sizes provides an indication of algorithmic distanceterm between images.

4.2 Data processing In practice, we use normalized compression lengths. The compression size of the original image without transformationsterm is divided by the size of the original bitmap image. Compressions of transformationsterm are divided by the size of the original compression. In most applications discussed in this paper, it also makes sense to rescale the vector space components (we use z-scoring), to put the compression ratiosterm and the additional statistical transformationsterm (fractal dimension, colorfulness metrics, etc) on a comparable scale. For more technical details on the processing pipeline, list of the transformationsterm and implementation, see Additional file 1.

Both the Historical and Contemporary Hic et Nunc dataset are preprocessed the same way, downscaling images to 160,000 pixel bitmaps (400 × 400 in the case of a perfect square) while retaining aspect ratio. Smaller images up to 50% of that size are allowed (but not upscaled), smaller images are discarded. Another option would be to resize all images to identical squares, but that would distort the composition of wide or tall artworks. The aspect differences, size differences resulting from integer division of the 160,000 and the inclusion of smaller images, are all controlled for in the next step. The assigned file size of a compressed image (or its transformationterm) is actually the mean of two compressions, of the original and its 90 degree rotation. The compression ratiosterm are calculated in terms of the respective downscaled bitmaps. Furthermore, one of our visual transformationsterm is the Fast Fourier Transform; given its square-shaped output components, the transform is applied twice, on the original and its rotation, and the resulting components are also additionally rotated for compression.

4.3 Data limitations and biases This approach to homogenizing the images is far from perfect, as the size of the originals that these photographs and scans represent may well range from the size of a postcard to that of an altar piece. Not only that, but the latter may well be represented by a lower resolution image than the former, with better or worse color grading, etc. The dataset contains sparse metadata on original size and we have no way to systematically quantify this issue at scale, which remains a limitation of the current study. However, in a sense, our approach is not very different from making art historical inferences by going through and looking at large visual resource collections, much like students of art history examining art historical survey literature, or an art connoisseur training their eye using a large comprehensive 35 mm slide collection of a library of photos, which historically served exactly this very purpose.

Since we are interested in making comparisons over time, the Historical dataset was also filtered for items with an identifiable creation date. We carried out some preprocessing of the date metadata, retrieving four-digit years from descriptions that included them. However, much of earlier art is tagged with heterogeneous and approximate descriptions such as “early XVI century”. Discarding these made the earlier end of this dataset even smaller, which is why we limit some analyses to the 19-20th century.

Our Historical dataset is also likely biased in a number of ways. It features primarily Western art, most of the data is concentrated in the 20th century, the metadata quality varies and is of unidentifiable origin, the sampling mechanisms are unknown but likely biased by archival and selection practices of the various museums and collections in which these reproductions originate and the websites that house them. Still, from an art historical standpoint the dataset provides a reasonable and sufficient proxy benchmark to show the feasibility of our approach. Known biases of the Historical dataset include reliance on partially dated literature, including a corresponding gap of 18th century art, and very likely some variation in terms of reproduction quality due to the broad variety of the crowdsourced images, either found in the public domain or taken from a great variety of literature and online sources on the basis of fair use. Digitizing larger amounts of visual cultural heritage in high resolution, consistent quality, and minimal bias is a generational challenge. While the Historical dataset is sufficient for our proof of concept, as more data in better quality becomes available, descriptions based on our method are expected to also become more precise and representative.

4.4 Evaluation We evaluate the compression ensembleterm approach extensively using three datasets and two methodologies, (1) examining correlations of our model predictions with human judgments of visual complexityterm, (2) using the model to perform authorship and style attribution. We show that our model performs very well on the first task and with fair accuracy on the second task (despite not being trained for the specific purpose). The second experiment also demonstrates explicit connections between specific dimensions in the vector space of compression ratiosterm and particular aspects of the corresponding artworks. For example, the compression ratioterm·var of edge-filter transformationsterm are informative regarding the genre of the work (portraiture versus landscape), while color-affecting transforms can help predict the medium (drawing vs oil painting).

4.4.1 Human complexity norms We assess the cognitive plausibility of the compression ensembleterm approach by comparing its predictions of visual complexityterm with human judgment norms from two datasets. The first dataset, MultiPic [96] consists of 750 colored pictures of concrete concepts, and human judgments on various aspects of visual perception, including complexity, based on experiments with 620 participants from six language communities (British English, Spanish, French, Dutch, Italian, German; see Fig. 4.A). The dataset includes means for each image for a given language sample. The second dataset, Fractals [26] consists of 400 abstract fractals and related norms, again as mean judgments of visual complexityterm, by 512 German-speaking participants (Fig. 4.B). Previous research has engaged in analogous exercises of evaluations against human complexity judgements [24, 28]. We use the datasets described here as they are both publicly available while representing fairly large pools of participants.

We generate the compression ensembleterm vectors separately for each of the two datasets, then carry out repeated out-of-sample evaluation where we train a linear regression model on a set of vectors to predict human scores, then test its accuracy on a separate test set. The results are very good, with median absolute error ranging from 0.19 (Multipic English) to 0.23 (Multipic Flemish) on a scale of 0 to 5. To put this in perspective, this is smaller than the differences between languages in this dataset (the median standard deviation of complexity scores per image across languages is 0.24). In Fractals, median absolute error is 0.46 on the same scale of 0 to 5. The linear regression model with compression ratiosterm as predictors describes most of the variance (measured as adjusted \(R^{2}\)) in human visual complexityterm ratings: 73% (Multipic Italian) to 83% (Multipic Flemish), and 32% in Fractals. By comparison, using gif compression alone describes just \(37-44\%\) (Multipic) and 10% (Fractals). These results provide us with confidence that the approach is cognitively valid, correlating with what the human eye would consider visually complex.

4.4.2 Artist, date, style, genre, and medium classification The second evaluation involves the Historical dataset, in the form of a number of retrieval or classification experiments. We generate the compression ensembleterm vectors for the entire dataset, and extract the following subsets, where each included class has at least 1100 unique examples: 13 style periods as per metadata (5 of which are exemplified in see Fig. 4.C), 7 centuries, drawings vs oil paintings, landscape paintings vs human portraits, and 91 artists with at least 110 artworks each (3 of which are exemplified in see Fig. 4.D).

We perform out-of-sample evaluation where we repeatedly train a classifier for each subset, on a randomly sampled set of vectors from each class in the subset to predict the relevant class labels such as style period (\(n= 1000\) per class, except 100 for authors due to limited data), then test its accuracy on a separate test set (\(n= 100\) per class, except \(n= 10\) per author). We use Linear Discriminant Analysis — a simple, computationally lightweight supervised machine learning model that straightforwardly generalizes to multi-label classification. To probe how well the ensembles work on this task given different amounts of data and number of transforms, we carry this out in a step-wise manner, as depicted in Fig. 4.E-I. Each classifier is trained on 10, 100 and 1000 examples of each class, and employing an increasing number of transforms, starting from the baseline of gif compression (ratio to raw bitmap file size). The rest of the features are ordered by a rough estimate of variable importance (derived from repeatedly training binomial logistic regression classifiers on all possible pairs of classes and averaging the t-statistics of the variables).

Even with a handful of examples and a couple of the most informative transforms, the simple classifier is able to detect above chance the creator, the date, style, genre, and medium of a given artwork. With a 100 examples and the full ensemble of transforms, author (\(n= 91\)) detection accuracy is 38%, which is much higher than the accuracy of 1.1% that random attribution would achieve by chance. Provided 1000 examples per class, oil paintings are distinguished from drawings about 86% of the time, same for landscapes vs human portraits (both have 50% random chance baseline), style period 34% (baseline \(\sim 8\%\)) and century 44% (baseline \(\sim 14\%\)).

The ranking of the transforms beyond the compression baseline (as depicted in Fig. 4.E-I) is also informative. Some of the aspects represented by the transformationsterm are more useful than others for the prediction task; for example, gray-scaling distinguishes pencil drawings from colorful oil paintings, because this is one of the primary aspects they differ in. Turning this around, the explainable features of the compression ensembleterm can be used to describe how any two images (or sets of images) differ, by looking into which transformationterm dimensions describe the most variance.

Inspecting the relevant confusion matrices reveals the errors are fairly systematic and intuitive, as classification errors are more likely between adjacent style periods and artists. In the set of 91 artists, Thomas Lawrence and George Romney are most often confused with each other by the model — and indeed, both are portrait artists from roughly the same period (see Fig. 4.D). Conversely, artists in a distinguishable style or genre are easy to identify, for example the 19th century engraver Charles Turner is detected at 97%. Rococo, also known as Late Baroque, is correctly labeled in 47% of the tests, while 16% of it is misclassified as Baroque. Impressionism is easiest to identify (53% correct) — but confused with Post-Impressionism (14%). Expressionism is by far the hardest to put a finger on at 12% (cf. Figure S4 for the confusion matrix of style periods). These error structures are interesting in themselves, and could be investigated in future research.

It is important to be clear about the purpose of the experiments here: these are to verify that the compression ensemblesterm·def approach, given a sufficient number of transformationsterm, is capable of delineating art historically interesting aspects that may differ in aesthetic complexityterm. The results indicate this to be the case, and lends confidence to explorative findings in the Results section.

Deep learningterm models, which typically involve lengthy pre-training on large image databases, can also be tuned to perform similar tasks [9, 42, 97]. Our method is primarily a general zero-shot complexity estimation algorithm and does not involve pre-training; but indeed its output is informative enough to perform some such downstream tasks with reasonable accuracy. The purpose of this exercise here however is not to compete with these approaches, but to show that a compression ensembleterm — despite consisting of no features other than file size ratios and statistical transformationsterm, and containing no pre-trained baseline — still captures and disambiguates enough family resemblanceterm to place stylistically similar artworks close together and dissimilar ones apart, with a non-random error structure.

Nevertheless, below are some analogous results, to give a sense of machine learning accuracy in similar classification tasks using similar art corpora. These are however not directly comparable to ours due to training and test set differences. Mao et al. [42] report a 39% accuracy for style period and 30% for author retrieval; Tan et al. [41] report 55% for style and 76% for artist (but that is between just 23 artists with the most training data). If for example authorship attribution was the goal of a given application, we envision that its accuracy could likely be improved by concatenating image embeddingsterm with compression ensemblesterm·def, as mentioned in the Discussion.

Availability of data and materials The datasets supporting the conclusions of this article are available through publicly available databases, as detailed in Results and Methods sections, in particular these sources: https://deepart.hkust.edu.hk/ART500K/art500k.html (art500k), https://www.bcbl.eu/databases/multipic (Multipic stimuli) and https://osf.io/ckfmv (fractals stimuli). The R code to run the compression ensembleterm models as presented here is available at https://github.com/andreskarjus/compression_ensembles. See the code repository for details on running the code. The code is based on R and ImageMagick. An optimized, more efficient and modular implementation of the compression ensembleterm algorithm is available here: https://github.com/Collection-Space-Navigator/compression_ensembles. It is based on Python, and uses OpenCV and PIL instead of ImageMagick. An interactive web demo that includes a compression ensembleterm embedding of a subset of the Historical art dataset is available here: https://collection-space-navigator.github.io.

Abbreviations non-fungible token normalized compression distanceterm Principal Component Analysisterm Uniform Manifold Approximation and Projection generalized additive regression model

Interpretive notes.
• Highlighted spans are tagged entities: persName (author), title (venue), placeName (place), date (year), and term (a key concept: domain / ai / method).
• Eponymous or retrospective terms (e.g. “Nash equilibrium”, “segregation”) do not appear in the original source and so are not highlighted — a deliberate choice (see Report 4).
• Some entries begin with a word in capitals. EVIDENCE CORRECTED means the finding still stands and it was our quotation that was wrong — it has been replaced. RETRACTED means the entry itself was wrong; it stays on the page, marked, with its reason, rather than being deleted. WITHDRAWN AND REPLACED means a corrected version of it appears in the entries below. Each mark carries its own reason, because the reasons differ from one entry to the next. An entry we have WITHDRAWN is removed from this page and kept in the record, with its reason. A line reading Audit and a date is a later re-reading of the entry against its whole sentence: DOUBTFUL means it was kept, and the reason says what is loose about it.
• Quotation marks inside the tagger's sentence. Where a tag is the tagger's own sentence, a phrase in quotation marks inside it is borrowed from the paper — the tagger's wording around it is not. The paper's own sentence is the evidence quote shown on the same row, so the borrowing can be checked against the thing borrowed from without leaving this page. Nothing inside quotation marks anywhere on this page is ours: if it is quoted, it is the paper's. Whose words a concept carries. A concept entry records a term the paper itself uses, so the term, the sense given for it, and its evidence are the paper's own words, quoted where the paper fixes them. This is the opposite of a sense entry in the tag table, which is the tagger's sentence about how the paper uses a term. Where a concept entry could not be grounded in the paper's words, the entry says so on its own row.
• Counts: 1 work · 1 date.
Meta-Tagging Project · record epjds2023-compression-ensembles.
© 2026 Shir Sivroni