We present a new image complexity metric. Existing complexity metrics cannot distinguish meaningful content from noise, and give a high score to white noise images, which contain no meaningful information. We use the minimum description length principle to determine the number of clusters and designate certain points as outliers and, hence, correctly assign white noise a low score. The presented method is a step towards humans’ ability to detect when data contain a meaningful pattern. It also has similarities to theoretical ideas for measuring meaningful complexity. We conduct experiments on seven different sets of images, which show that our method assigns the most accurate scores to all images considered. Additionally, comparing the different levels of the hierarchy of clusters can reveal how complexity manifests at different scales, from local detail to global structure. We then present ablation studies showing the contribution of the components of our method, and that it continues to assign reasonable scores when the inputs are modified in certain ways, including the addition of Gaussian noise and the lowering of the resolution. Code is available at https://github.com/Lou1sM/meaningful_image_complexity.
en
dc.language.iso
en
-
dc.publisher
ELSEVIER SCI LTD
-
dc.relation.ispartof
Pattern Recognition
-
dc.rights.uri
http://creativecommons.org/licenses/by/4.0/
-
dc.subject
Meaningful complexity
en
dc.subject
Clustering
en
dc.subject
Image complexity
en
dc.subject
Minimum description length
en
dc.subject
Machine learning
en
dc.subject
Information theory
en
dc.title
Minimum description length clustering to measure meaningful image complexity
en
dc.type
Article
en
dc.type
Artikel
de
dc.rights.license
Creative Commons Namensnennung 4.0 International
de
dc.rights.license
Creative Commons Attribution 4.0 International
en
dc.identifier.url
https://doi.org/10.1016/j.patcog.2023.109889
-
dc.contributor.affiliation
University of Edinburgh, United Kingdom of Great Britain and Northern Ireland (the)