Universal distance measure for images

作者: Uzi A. Chester , Joel Ratsaby

DOI: 10.1109/EEEI.2012.6377115

关键词: Pattern recognitionArtificial intelligenceMathematicsGrayscaleCluster analysisComputational complexity theoryImage processingString (computer science)Contextual image classificationComputer visionMeasure (mathematics)String searching algorithm

摘要: We introduce an algorithm for measuring the distance between two images based on computing complexity of strings characters that encode images. Given a pair images, our transforms each one into text-based sequence (strings) characters. For string, it computes LZ-complexity and then uses string-distance measure [1] to obtain value The main advantages are is universal, is, neither needs nor assumes any spatial or spectral information about can different sizes, works black white, grayscale color be implemented efficiently embedded computer system. present successful experimental results clustering sizes categories their similarities as measured by algorithm.

参考文章(3)
H. H. Otu, K. Sayood, A new sequence distance measure for phylogenetic tree construction Bioinformatics. ,vol. 19, pp. 2122- 2130 ,(2003) , 10.1093/BIOINFORMATICS/BTG295
A. Lempel, J. Ziv, On the Complexity of Finite Sequences IEEE Transactions on Information Theory. ,vol. 22, pp. 75- 81 ,(1976) , 10.1109/TIT.1976.1055501
R. Cilibrasi, P.M.B. Vitanyi, Clustering by compression international symposium on information theory. ,vol. 51, pp. 1523- 1545 ,(2003) , 10.1109/TIT.2005.844059