Abstract
Normalized Information Distance, based on Kolmogorov complexity, is an emerging metric for image similarity. It is approximated by the Normalized Compression Distance (NCD) which generates the relative distance between two strings by using standard compression algorithms to compare linear strings of information. This relative distance quantifies the degree of similarity between the two objects. NCD has been shown to measure similarity effectively on information which is already a string: genomic string comparisons have created accurate phylogeny trees and NCD has also been used to classify music. Currently, to find a similarity measure using NCD for images, the images must first be linearized into a string, and then compared. To understand how linearization of a 2D image affects the similarity measure, we perform four types of linearization on a subset of the Corel image database and compare each for a variety of image transformations. Our experiment shows that different linearization techniques produce statistically significant differences in NCD for identical spatial transformations.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Cilibrasi, R.: Statistical Inference Through Data Compression. PhD thesis, Universiteit van Amsterdam (2007)
Cilibrasi, R., Cruz, A.L., de Rooij, S., Keijzer, M.: CompLearn home, http://www.complearn.org/
Cilibrasi, R., Vitanyi, P., de Wolf, R.: Algorithmic clustering of music. Arxiv preprint cs.SD/0303025 (2003)
Cilibrasi, R., Vitanyi, P.M.B.: Clustering by compression. IEEE Transactions on Information theory 51(4), 1523–1545 (2005)
Yeo, B.L., Yeung, M., Craver, S.: Multi-Linearization data structure for image browsing. In: Storage and Retrieval for Image and Video Databases VII, San Jose, California, January 26-29, p. 155 (1998)
Dafner, R., Cohen-Or, D., Matias, Y.: Context-based space filling curves. In: Computer Graphics Forum, vol. 19, pp. 209–218. Blackwell Publishers Ltd., Malden (2000)
Gondra, I., Heisterkamp, D.R.: Content-based image retrieval with the normalized information distance. Computer Vision and Image Understanding 111(2), 219–228 (2008)
Itani, A., Manohar, D.: Self-Describing Context-Based pixel ordering. LNCS, pp. 124–134 (2002)
Lamarque, C.H., Robert, F.: Image analysis using space-filling curves and 1D wavelet bases. Pattern Recognition 29(8), 1309–1322 (1996)
Li, M., Chen, X., Li, X., Ma, B., Vitanyi, P.M.B.: The similarity metric. IEEE Transactions on Information Theory 50, 12 (2004)
Li, M., Sleep, R.: Melody classification using a similarity metric based on kolmogorov complexity. In: Sound and Music Computing (2004)
Li, M., Vitanyi, P.: An Introduction to Kolmogorov Complexity and its Applications, 1st edn. Springer, New York (1993)
Tran, N.: The normalized compression distance and image distinguishability. In: Proceedings of SPIE, vol. 6492, p. 64921D (2007)
Pennsylvania State University. Corel Image Database, http://wang.ist.psu.edu/docs/related/
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Mortensen, J., Wu, J.J., Furst, J., Rogers, J., Raicu, D. (2009). Effect of Image Linearization on Normalized Compression Distance. In: Ślęzak, D., Pal, S.K., Kang, BH., Gu, J., Kuroda, H., Kim, Th. (eds) Signal Processing, Image Processing and Pattern Recognition. SIP 2009. Communications in Computer and Information Science, vol 61. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-10546-3_14
Download citation
DOI: https://doi.org/10.1007/978-3-642-10546-3_14
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-10545-6
Online ISBN: 978-3-642-10546-3
eBook Packages: Computer ScienceComputer Science (R0)