An Information-Theoretic Framework for Image Complexity

In this paper, we introduce a new information-theoretic approach to study the complexity of an image. The new framework we present here is based on considering the information channel that goes from the histogram to the regions of the partitioned image, maximizing the mutual information. Image complexity has been related to the entropy of the image intensity histogram. This disregards the spatial distribution of pixels, as well as the fact that a complexity measure must take into account at what level one wants to describe an object. We define the complexity by using two measures which take into account the level at which the image is considered. One is the number of partitioning regions needed to extract a given ratio of information from the image. The other is the compositional complexity given by the Jensen-Shannon divergence of the partitioned image.

[1]  James P. Crutchfield,et al.  Discovering Noncritical Organization: Statistical Mechanical, Information Theoretic, and Computational Views of Patterns in One-Dimensional Spin Systems , 1998, Entropy.

[2]  C. R. Rao,et al.  On the convexity of some divergence measures based on entropy functions , 1982, IEEE Trans. Inf. Theory.

[3]  Thomas M. Cover,et al.  Elements of Information Theory (Wiley Series in Telecommunications and Signal Processing) , 2006 .

[4]  George David Birkhoff.  The collected mathematical papers , 1909 .

[5]  Abraham A. Moles.  Art et ordinateur , 1970 .

[6]  P. Machado,et al.  Computing Aesthetics , 1998 .

[7]  P. Grassberger.  Toward a quantitative theory of self-generated complexity , 1986 .

[8]  Ramón Román-Roldán,et al.  DECOMPOSITION OF DNA SEQUENCE COMPLEXITY , 1999 .

[9]  Thomas M. Cover,et al.  Elements of Information Theory , 2005 .

[10]  Wentian Li.  The complexity of DNA , 1997 .

[11]  Sanjeev R. Kulkarni,et al.  Learning Pattern Classification - A Survey , 1998, IEEE Trans. Inf. Theory.

[12]  R. Badii,et al.  Complexity: Hierarchical Structures and Scaling in Physics , 1997 .

[13]  Wentian Li,et al.  On the Relationship between Complexity and Entropy for Markov Chains and Regular Languages , 1991, Complex Syst..

[14]  Dana H. Ballard,et al.  Computer Vision , 1982 .

[15]  Richard Alan Peters,et al.  Image Complexity Metrics for Automatic Target Recognizers , 1990 .

[16]  J. Oliver,et al.  Sequence Compositional Complexity of DNA through an Entropic Segmentation Method , 1998 .

[17]  S. Lloyd,et al.  Measures of complexity: a nonexhaustive list , 2001 .

[18]  狷士 後藤,et al.  マックス・ベンゼ『美学』 : あたらしい美学へのてびき, Max Bense, Aesthetica-Einfuhrung in die neue Aesthetik Agis-Verlag, Baden-Baden, 1965 , 1967 .

[19]  I. K. Sethi,et al.  Hierarchical Classifier Design Using Mutual Information , 1982, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[20]  Max Bense,et al.  Aesthetica : Einführung in die neue Aesthetik , 1965 .

[21]  Jeffrey D. Ullman,et al.  Introduction to Automata Theory, Languages and Computation , 1979 .

[22]  Mateu Sbert,et al.  An information theoretic framework for image segmentation , 2004, 2004 International Conference on Image Processing, 2004. ICIP '04..