Using complexity estimates in aesthetic image classification

Abstract

In recent years, the search for computational systems that classify images based on aesthetic properties has gained momentum. Such systems have a wide range of potential applications, including image search, organization, acquisition and generation. This work explores the use of complexity estimates to predict the aesthetic merit of photographs. We use a set of image metrics and two different classifiers. Our approach classifies images gathered from a photography web site, attempting to reproduce the evaluation made by a group of users. For this purpose, we use complexity estimate metrics based on the encoding size and compression error of JPEG and fractal compression, which are applied to the original value channel and to the images resulting from applying Sobel and Canny filters to this channel. By employing these estimates, in conjunction with the average and standard deviation of the value channel, i.e., 20 features, a success rate of 74.59% was attained. Using the three most influential features yields a success rate of 71.34%, which is competitive with the best results reported in the literature, 71.44%, using the same dataset.