{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,20]],"date-time":"2026-05-20T04:36:06Z","timestamp":1779251766756,"version":"3.51.4"},"reference-count":33,"publisher":"MDPI AG","issue":"2","license":[{"start":{"date-parts":[[2018,1,31]],"date-time":"2018-01-31T00:00:00Z","timestamp":1517356800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"Romanian Space Agency ROSA","award":["SpaceTech"],"award-info":[{"award-number":["SpaceTech"]}]},{"DOI":"10.13039\/501100006595","name":"UEFISCDI","doi-asserted-by":"publisher","award":["PN-III-P4-IDPCE-2016-0339"],"award-info":[{"award-number":["PN-III-P4-IDPCE-2016-0339"]}],"id":[{"id":"10.13039\/501100006595","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Entropy"],"abstract":"<jats:p>This paper investigates the usefulness of the normalized compression distance (NCD) for image similarity detection. Instead of the direct NCD between images, the paper considers the correlation between NCD based feature vectors extracted for each image. The vectors are derived by computing the NCD between the original image and sequences of translated (rotated) versions. Feature vectors for simple transforms (circular translations on horizontal, vertical, diagonal directions and rotations around image center) and several standard compressors are generated and tested in a very simple experiment of similarity detection between the original image and two filtered versions (median and moving average). The promising vector configurations (geometric transform, lossless compressor) are further tested for similarity detection on the 24 images of the Kodak set subject to some common image processing. While the direct computation of NCD fails to detect image similarity even in the case of simple median and moving average filtering in 3 \u00d7 3 windows, for certain transforms and compressors, the proposed approach appears to provide robustness at similarity detection against smoothing, lossy compression, contrast enhancement, noise addition and some robustness against geometrical transforms (scaling, cropping and rotation).<\/jats:p>","DOI":"10.3390\/e20020099","type":"journal-article","created":{"date-parts":[[2018,1,31]],"date-time":"2018-01-31T12:41:24Z","timestamp":1517402484000},"page":"99","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":15,"title":["On the Use of Normalized Compression Distances for Image Similarity Detection"],"prefix":"10.3390","volume":"20","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1755-0044","authenticated-orcid":false,"given":"Dinu","family":"Coltuc","sequence":"first","affiliation":[{"name":"Faculty of Electrical Engineering, Electronics and Information Technology, Valahia University of Targoviste, T\u00e2rgovi\u0219te 130024, Romania"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mihai","family":"Datcu","sequence":"additional","affiliation":[{"name":"Remote Sensing Technology Institute, German Aerospace Center (DLR), Germany and Research Centre for Spatial Information, Politehnica University of Bucharest, Bucure\u0219ti 060042, Romania"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daniela","family":"Coltuc","sequence":"additional","affiliation":[{"name":"Research Centre for Spatial Information, Politehnica University of Bucharest, Bucure\u0219ti 060042, Romania"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2018,1,31]]},"reference":[{"key":"ref_1","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_2","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_3","doi-asserted-by":"crossref","first-page":"579","DOI":"10.1109\/34.1000234","article-title":"A new pattern representation scheme using data compression","volume":"24","author":"Watanabe","year":"2002","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1093\/bioinformatics\/17.2.149","article-title":"An information-based sequence distance and its application to whole mitochondrial genome phylogeny","volume":"17","author":"Li","year":"2001","journal-title":"Bioinformatics"},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1162\/0148926042728449","article-title":"Algorithmic clustering of music based on string compression","volume":"28","author":"Cilibrasi","year":"2004","journal-title":"Comput. Music J."},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"993","DOI":"10.1109\/TASLP.2015.2416655","article-title":"Identifying Cover Songs Using Information-Theoretic Measures of Similarity","volume":"23","author":"Foster","year":"2015","journal-title":"IEEE\/ACM Trans. Audio Speech Lang. Process."},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"370","DOI":"10.1109\/TKDE.2007.48","article-title":"The Google similarity distance","volume":"19","author":"Cilibrasi","year":"2007","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"538","DOI":"10.1002\/asi.21001","article-title":"A survey of modern authorship attribution methods","volume":"60","author":"Stamatatos","year":"2009","journal-title":"J. Am. Soc. Inf. Sci. Technol."},{"key":"ref_9","doi-asserted-by":"crossref","unstructured":"Bardera, A., Feixas, M., Boada, I., and Sbert, M. (2006, January 9\u201314). Compression-based image registration. Proceedings of the 2006 IEEE International Symposium on Information Theory, Seattle, WA, USA.","DOI":"10.1109\/ISIT.2006.261706"},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"1602","DOI":"10.1109\/TPAMI.2014.2375175","article-title":"Normalized Compression Distance of Multisets with Applications","volume":"37","author":"Cohen","year":"2015","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/1754393.1754394","article-title":"Detecting visually similar web pages: Application to phishing detection","volume":"10","author":"Chen","year":"2010","journal-title":"ACM Trans. Internet Technol."},{"key":"ref_12","first-page":"1253","article-title":"Symmetrical Compression Distance for Arrhythmia Discrimination in Cloud-based Big Data Services","volume":"19","year":"2010","journal-title":"IEEE J. Biomed. Health Inform."},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"1895","DOI":"10.1109\/TIT.2007.894669","article-title":"The normalized compression distance is resistant to noise","volume":"53","author":"Alfonseca","year":"2007","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"75270","DOI":"10.1117\/12.845400","article-title":"A perceptual similarity measure based on smoothing filters and the normalized compression distance","volume":"7257","author":"Tran","year":"2010","journal-title":"Proc. SPIE"},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"1063","DOI":"10.1007\/s00371-011-0651-2","article-title":"Using normalized compression distance for image similarity measurement: An experimental study","volume":"28","author":"Vazquez","year":"2012","journal-title":"Vis. Comput."},{"key":"ref_16","doi-asserted-by":"crossref","unstructured":"Mortensen, J., Wu, J.J., Furst, J., Rogers, J., and Raicu, D. (2009). Effect of image linearization on normalized compression distance. Signal Processing, Image Processing and Pattern Recognition, Springer.","DOI":"10.1007\/978-3-642-10546-3_14"},{"key":"ref_17","doi-asserted-by":"crossref","unstructured":"Pinho, A.J., and Ferreira, P.J.S.G. (2011, January 11\u201314). Image similarity using the normalized compression distance based on finite context models. Proceedings of the IEEE 2011 18th IEEE International Conference on Image Processing (ICIP), Brussels, Belgium.","DOI":"10.1109\/ICIP.2011.6115866"},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"381","DOI":"10.1002\/sam.10093","article-title":"A compression based distance measure for texture","volume":"3","author":"Campana","year":"2010","journal-title":"Stat. Anal. Data Min."},{"key":"ref_19","doi-asserted-by":"crossref","unstructured":"Hu, B., Rakthanmanon, T., Campana, B., Mueen, A., and Keogh, E. (2012, January 26\u201328). Image mining of historical manuscripts to establish provenance. Proceedings of the 2012 SIAM International Conference on Data Mining, Anaheim, CA, USA.","DOI":"10.1137\/1.9781611972825.69"},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"8","DOI":"10.1109\/LGRS.2009.2020349","article-title":"Algorithmic information theory-based analysis of earth observation images: An assessment","volume":"7","author":"Cerra","year":"2010","journal-title":"IEEE Geosci. Remote Sens. Lett."},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1016\/j.jvcir.2011.10.009","article-title":"A fast compression-based similarity measure with applications to content-based image retrieval","volume":"23","author":"Cerra","year":"2012","journal-title":"J. Vis. Commun. Image Represent."},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"980","DOI":"10.1109\/TMM.2014.2306175","article-title":"Image similarity using sparse representation and compression distance","volume":"16","author":"Guha","year":"2014","journal-title":"IEEE Trans. Multimed."},{"key":"ref_23","unstructured":"Gonzales, R.C., and Woods, R.E. (2008). Digital Image Processing, Prentice-Hall."},{"key":"ref_24","doi-asserted-by":"crossref","first-page":"1143","DOI":"10.1109\/TIP.2005.864170","article-title":"Exact Histogram Specification","volume":"15","author":"Coltuc","year":"2006","journal-title":"IEEE Trans. Image Process."},{"key":"ref_25","unstructured":"Coltuc, D., and Bolon, P. (1998, January 8\u201311). An inverse problem: Histogram equalization. Proceedings of the Signal Process, Rhodes, Greece."},{"key":"ref_26","unstructured":"(2018, January 30). Data Compression Programs. Available online: http:\/\/mattmahoney.net\/dc\/."},{"key":"ref_27","doi-asserted-by":"crossref","unstructured":"Cox, I., Miller, M., Bloom, J., Fridrich, J., and Kalker, T. (2007). Digital Watermarking and Steganography, Morgan Kaufmann.","DOI":"10.1016\/B978-012372585-1.50015-2"},{"key":"ref_28","doi-asserted-by":"crossref","first-page":"58","DOI":"10.1109\/79.879339","article-title":"Watermarking schemes evaluation","volume":"17","author":"Petitcolas","year":"2000","journal-title":"IEEE Signal Process. Mag."},{"key":"ref_29","unstructured":"Mahoney, M. (2005). Adaptive Weighting of Context Models for Lossless Data Compression, Florida Institute of Technology. Technical Report CS-2005-16."},{"key":"ref_30","unstructured":"(2018, January 30). Kodak Lossless True Color Image Suite. Available online: http:\/\/www.r0k.us\/graphics\/kodak\/."},{"key":"ref_31","doi-asserted-by":"crossref","unstructured":"Yang, Y., and Newsam, S. (2010, January 2\u20135). Bag-of-visual-words and spatial extensions for land-use classification. Proceedings of the ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, San Jose, CA, USA.","DOI":"10.1145\/1869790.1869829"},{"key":"ref_32","unstructured":"(2018, January 30). UC Merced Land Use Dataset. Available online: http:\/\/weegee.vision.ucmerced.edu\/datasets\/landuse.html."},{"key":"ref_33","unstructured":"(2018, January 30). Face Recognition Technology (FERET), Available online: https:\/\/www.nist.gov\/programs-projects\/face-recognition-technology-feret."}],"container-title":["Entropy"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1099-4300\/20\/2\/99\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T14:53:16Z","timestamp":1760194396000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1099-4300\/20\/2\/99"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,1,31]]},"references-count":33,"journal-issue":{"issue":"2","published-online":{"date-parts":[[2018,2]]}},"alternative-id":["e20020099"],"URL":"https:\/\/doi.org\/10.3390\/e20020099","relation":{},"ISSN":["1099-4300"],"issn-type":[{"value":"1099-4300","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,1,31]]}}}