Image similarity using the normalized compression distance based on finite context models

Proceedings - International Conference on Image Processing, ICIP

Volumn , Issue , 2011, Pages 1993-1996

  Pinho, Armando J ^a   Ferreira, Paulo J S G ^a  

^a UNIVERSITY OF AVEIRO   (Portugal)

Author keywords

image compression; Image similarity; normalized compression distance

Indexed keywords

COMPRESSION ALGORITHMS; CONTEXT MODELS; IMAGE APPLICATIONS; IMAGE COMPRESSION METHODS; IMAGE SIMILARITY; KOLMOGOROV COMPLEXITY; NORMALIZED COMPRESSION DISTANCE; SIMILARITY MEASURE;

IMAGE ANALYSIS; IMAGE COMPRESSION;

ALGORITHMS;

EID: 84856259569     PISSN: 15224880     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICIP.2011.6115866     Document Type: Conference Paper

References (19)

1. I. Gondra and D. R. Heisterkamp, "Content-based image retrieval with the normalized information distance," Computer Vision and Image Understanding, vol. 111, pp. 219-228, 2008.
2. N. Tran, "The normalized compression distance and image distinguishability," in Human Vision and Electronic Imaging XII - Proc. of the SPIE, Jan. 2007, p. 64921D.
3. J. Perkiö and A. Hyvärinen, "Modelling image complexity by independent component analysis, with application to content-based image retrieval," in Proc. of the Int. Conf. on Artificial Neural Networks, ICANN 2009, Limassol, Cyprus, 2009.
4. J. Mortensen, J. J. Wu, J. Furst, J. Rogers, and D. Raicu, "Effect of image linearization on normalized compression distance,"in Signal Processing, Image Processing and Pattern Recognition, D. Slezak, S. K. Pal, B.-H. Kang, J. Gu, H. Kuroda, and T.-H. Kim, Eds. 2009, vol. 61 of Communications in Computer and Information Science, pp. 106-116, Springer Berlin Heidelberg.
5. R. J. Solomonoff, "A formal theory of inductive inference. Part I," Information and Control, vol. 7, no. 1, pp. 1-22, Mar. 1964.
6. R. J. Solomonoff, "A formal theory of inductive inference. Part II," Information and Control, vol. 7, no. 2, pp. 224-254, June 1964.
7. A. N. Kolmogorov, "Three approaches to the quantitative definition of information," Problems of Information Transmission, vol. 1, no. 1, pp. 1-7, 1965.
8. G. J. Chaitin, "On the length of programs for computing finite binary sequences," Journal of the ACM, vol. 13, pp. 547-569, 1966.
9. C. S. Wallace and D. M. Boulton, "An information measure for classification," The Computer Journal, vol. 11, no. 2, pp. 185-194, Aug. 1968.
10. J. Rissanen, "Modeling by shortest data description," Automatica, vol. 14, pp. 465-471, 1978.
11. A. Lempel and J. Ziv, "On the complexity of finite sequences,"IEEE Trans. on Information Theory, vol. 22, no. 1, pp. 75-81, Jan. 1976.
12. G. Gordon, "Multi-dimensional linguistic complexity," Journal of Biomolecular Structure & Dynamics, vol. 20, no. 6, pp. 747-750, 2003.
13. T. I. Dix, D. R. Powell, L. Allison, J. Bernal, S. Jaeger, and L. Stern, "Comparative analysis of long DNA sequences by per element information content using different contexts," BMC Bioinformatics, vol. 8, no. Suppl. 2, pp. S10, 2007.
14. M. Li, X. Chen, X. Li, B. Ma, and P. M. B. Vitányi, "The similarity metric," IEEE Trans. on Information Theory, vol. 50, no. 12, pp. 3250-3264, Dec. 2004.
15. C. H. Bennett, P. Gács, M. Li P. M. B. Vitányi, and W. H. Zurek, "Information distance," IEEE Trans. on Information Theory, vol. 44, no. 4, pp. 1407-1423, July 1998.
16. R. Cilibrasi and P.M. B. Vitányi, "Clustering by compression,"IEEE Trans. on Information Theory, vol. 51, no. 4, pp. 1523-1545, Apr. 2005.
17. A. Mallet, L. Gueguen, and M. Datcu, "Complexity based image artifact detection," in Proc. of the Data Compression Conf., DCC-2008, Snowbird, Utah, 2008, p. 534.
18. T. C. Bell, J. G. Cleary, and I. H. Witten, Text compression, Prentice Hall, 1990.
19. F. Samaria and A. Harter, "Parameterisation of a stochastic model for human face identification," in 2nd IEEE Workshop on Applications of Computer Vision, Sarasota, Florida, Dec. 1994, pp. 138-142.