Automatic analysis of artistic paintings using information-based measures

作者:

Highlights:

• We perform a direct comparison between state-of-the-art unsupervised probabilistic and algorithmic information measures to specify each measure’s strengths and weaknesses.

• We show that hidden patterns and relationships present in artistic paintings can be identified by analysing their complexity.

• We show an efficient stylistic descriptor by combining the Normalized Compression and a measure of the paintings’ roughness.

• We propose a new descriptor of the artists’ style, artistic influences, and shared techniques.

• We show that average local complexity describes how each author typically composes and distributes the elements across the canvas and, therefore, how their work is perceived.

• We demonstrate that these measures can serve as useful auxiliary features capable of improving current methodologies in the classification of artistic paintings.

摘要

•We perform a direct comparison between state-of-the-art unsupervised probabilistic and algorithmic information measures to specify each measure’s strengths and weaknesses.•We show that hidden patterns and relationships present in artistic paintings can be identified by analysing their complexity.•We show an efficient stylistic descriptor by combining the Normalized Compression and a measure of the paintings’ roughness.•We propose a new descriptor of the artists’ style, artistic influences, and shared techniques.•We show that average local complexity describes how each author typically composes and distributes the elements across the canvas and, therefore, how their work is perceived.•We demonstrate that these measures can serve as useful auxiliary features capable of improving current methodologies in the classification of artistic paintings.

论文关键词:Image analysis,Data compression,BDM,Artistic paintings,Algorithmic information theory

论文评审过程:Received 18 June 2020, Revised 5 November 2020, Accepted 24 January 2021, Available online 1 February 2021, Version of Record 8 February 2021.

论文官网地址:https://doi.org/10.1016/j.patcog.2021.107864