{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T01:56:34Z","timestamp":1760147794179,"version":"build-2065373602"},"reference-count":29,"publisher":"MDPI AG","issue":"3","license":[{"start":{"date-parts":[[2023,3,1]],"date-time":"2023-03-01T00:00:00Z","timestamp":1677628800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"Communaut\u00e9 d\u2019agglom\u00e9ration de La Rochelle (France)"},{"name":"R\u00e9gion Nouvelle-Aquitaine (France) and the ECOMOB project"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Entropy"],"abstract":"<jats:p>Predicting how an individual will perceive the visual complexity of a piece of information is still a relatively unexplored domain, although it can be useful in many contexts such as for the design of human\u2013computer interfaces. We propose here a new method, called Information Complexity Ranking (ICR) to rank objects from the simplest to the most complex. It takes into account both their intrinsic complexity (in the algorithmic sense) with the Kolmogorov complexity and their similarity to other objects using the work of Cilibrasi and Vitanyi on the normalized compression distance (NCD). We first validated the properties of our ranking method on a reference experiment composed of 7200 randomly generated images divided into 3 types of pictorial elements (text, digits, and colored dots). In the second step, we tested our complexity calculation on a reference dataset composed of 1400 images divided into 7 categories. We compared our results to the ground-truth values of five state-of-the-art complexity algorithms. The results show that our method achieved the best performance for some categories and outperformed the majority of the state-of-the-art algorithms for other categories. For images with many semantic elements, our method was not as efficient as some of the state-of-the-art algorithms.<\/jats:p>","DOI":"10.3390\/e25030439","type":"journal-article","created":{"date-parts":[[2023,3,2]],"date-time":"2023-03-02T03:06:43Z","timestamp":1677726403000},"page":"439","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Information Complexity Ranking: A New Method of Ranking Images by Algorithmic Complexity"],"prefix":"10.3390","volume":"25","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2005-9387","authenticated-orcid":false,"given":"Thomas","family":"Chambon","sequence":"first","affiliation":[{"name":"Laboratoire Informatique, Image et Interaction (L3i), La Rochelle University, 23 Avenue Albert Einstein, 17000 La Rochelle, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4615-1563","authenticated-orcid":false,"given":"Jean-Loup","family":"Guillaume","sequence":"additional","affiliation":[{"name":"Laboratoire Informatique, Image et Interaction (L3i), La Rochelle University, 23 Avenue Albert Einstein, 17000 La Rochelle, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jeanne","family":"Lallement","sequence":"additional","affiliation":[{"name":"Laboratoire Usages du Numerique Pour le Developpement Durable (NUDD), La Rochelle University, 39 rue de Vaux De Foletier, 17000 La Rochelle, France"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2023,3,1]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"1523","DOI":"10.1109\/TIT.2005.844059","article-title":"Clustering by compression","volume":"51","author":"Cilibrasi","year":"2005","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"194","DOI":"10.1093\/bioinformatics\/15.3.194","article-title":"Transformation distances: A family of dissimilarity measures based on movements of segments","volume":"15","author":"Delahaye","year":"1999","journal-title":"Bioinformatics"},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"159","DOI":"10.3233\/AF-150052","article-title":"Estimating the algorithmic complexity of stock markets","volume":"4","author":"Brandouy","year":"2015","journal-title":"Algorithmic Financ."},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1002\/cplx.20388","article-title":"Image characterization and classification by physical complexity","volume":"17","author":"Zenil","year":"2012","journal-title":"Complexity"},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"420","DOI":"10.1016\/j.elerap.2012.06.004","article-title":"Aesthetic design of e-commerce web pages\u2014Webpage Complexity, Order and preference","volume":"11","author":"Deng","year":"2012","journal-title":"Electron. Commer. Res. Appl."},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"270","DOI":"10.1016\/j.jbusres.2019.07.018","article-title":"Effects of background complexity on consumer visual processing: An eye-tracking study","volume":"111","author":"Wang","year":"2020","journal-title":"J. Bus. Res."},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1002\/j.1538-7305.1948.tb01338.x","article-title":"A Mathematical Theory of Communication","volume":"27","author":"Shannon","year":"1948","journal-title":"Bell Syst. Tech. J."},{"key":"ref_8","first-page":"35","article-title":"Mesurer la Complexit\u00e9 des Objets Num\u00e9riques","volume":"1","author":"Delahaye","year":"2013","journal-title":"Bull. Soc. Inform. Fr."},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"350","DOI":"10.1147\/rd.214.0350","article-title":"Algorithmic Information Theory","volume":"21","author":"Chaitin","year":"1977","journal-title":"IBM J. Res. Dev."},{"key":"ref_10","first-page":"3","article-title":"Three Approaches to Information","volume":"1","author":"Kolmogorov","year":"1965","journal-title":"Probl. Peredachi Informatsii"},{"key":"ref_11","doi-asserted-by":"crossref","unstructured":"Li, M., and Vit\u00e1nyi, P. (2019). An Introduction to Kolmogorov Complexity and Its Applications, Springer. Texts in Computer Science.","DOI":"10.1007\/978-3-030-11298-1"},{"key":"ref_12","unstructured":"Ferbus-Zanda, M., and Grigorieff, S. (2010). Kolmogorov Complexity in perspective. Part I: Information Theory and Randomnes. arXiv."},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"230","DOI":"10.1112\/plms\/s2-42.1.230","article-title":"On Computable Numbers, with an Application to the Entscheidungsproblem","volume":"s2-42","author":"Turing","year":"1937","journal-title":"Proc. Lond. Math. Soc."},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0019-9958(64)90223-2","article-title":"A formal theory of inductive inference. Part I and Part II","volume":"7","author":"Solomonoff","year":"1964","journal-title":"Inf. Control"},{"key":"ref_15","unstructured":"Grunwald, P., and Vitanyi, P. (2004). Shannon Information and Kolmogorov Complexity. arXiv."},{"key":"ref_16","unstructured":"Tsukiyama, T., Kondo, Y., Kakuse, K., Saba, S., Ozaki, S., and Itoh, K. (1986). Method and System for Data Compression and Restoration. (US4586027A), U.S. Patent."},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"3250","DOI":"10.1109\/TIT.2004.838101","article-title":"The similarity metric","volume":"50","author":"Li","year":"2004","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_18","unstructured":"Ferbus-Zanda, M. Kolmogorov Complexity in perspective. Part II: Classification, Information Processing and Duality. Synthese, 43."},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"1407","DOI":"10.1109\/18.681318","article-title":"Information distance","volume":"44","author":"Bennett","year":"1998","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_20","unstructured":"Grunert, K.G., Bolton, L.E., and Raats, M.M. (2012). Transformative Consumer Research for Personal and Collective Well-Being, Routledge."},{"key":"ref_21","unstructured":"Saraee, E., Jalal, M., and Betke, M. (2018). SAVOIAS: A Diverse, Multi-Category Visual Complexity Dataset. arXiv."},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"1231","DOI":"10.2307\/1961757","article-title":"Condorcet\u2019s Theory of Voting","volume":"82","author":"Young","year":"1988","journal-title":"Am. Political Sci. Rev."},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1167\/7.2.17","article-title":"Measuring visual clutter","volume":"7","author":"Rosenholtz","year":"2007","journal-title":"J. Vis."},{"key":"ref_24","doi-asserted-by":"crossref","first-page":"603","DOI":"10.1109\/34.1000236","article-title":"Mean shift: A robust approach toward feature space analysis","volume":"24","author":"Comaniciu","year":"2002","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"ref_25","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1016\/j.dsp.2014.04.003","article-title":"No reference image quality classification for JPEG-distorted images","volume":"30","author":"Corchs","year":"2014","journal-title":"Digit. Signal Process. A Rev. J."},{"key":"ref_26","first-page":"2687","article-title":"A malware detection framework based on kolmogorov complexity","volume":"7","author":"Deng","year":"2011","journal-title":"J. Comput. Inf. Syst."},{"key":"ref_27","unstructured":"Bennett, C.H. (1988). A Half-Century Survey on the Universal Turing Machine, Oxford University Press, Inc."},{"key":"ref_28","doi-asserted-by":"crossref","first-page":"602","DOI":"10.1016\/S0019-9958(66)80018-9","article-title":"The definition of random sequences","volume":"9","year":"1966","journal-title":"Inf. Control"},{"key":"ref_29","first-page":"49","article-title":"Organized Complexity: Is Big History a Big Computation?","volume":"17","author":"Delahaye","year":"2016","journal-title":"Am. Philos. Assoc. Newsl. Philos. Comput."}],"container-title":["Entropy"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1099-4300\/25\/3\/439\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T18:45:31Z","timestamp":1760121931000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1099-4300\/25\/3\/439"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,3,1]]},"references-count":29,"journal-issue":{"issue":"3","published-online":{"date-parts":[[2023,3]]}},"alternative-id":["e25030439"],"URL":"https:\/\/doi.org\/10.3390\/e25030439","relation":{},"ISSN":["1099-4300"],"issn-type":[{"type":"electronic","value":"1099-4300"}],"subject":[],"published":{"date-parts":[[2023,3,1]]}}}