Skip to main content
SpringerLink
Log in

Fast computation methods for estimation of image spatial entropy

  • Original Research Paper
  • Published:
Journal of Real-Time Image Processing Aims and scope Submit manuscript

Abstract

Computation of image spatial entropy (ISE) is prohibitive in many applications of image processing due to its high computational complexity. Four fast or computationally efficient methods for estimation of ISE are thus introduced in this paper. Three of these estimation methods are parametric and the fourth one is non-parametric. The reduction in the computational complexity from the original formulation of ISE is made possible by making use of the Markovianity constraint which causes the joint histograms of neighboring pixels to become dense around their main diagonal. It is shown that by tolerating merely 1% estimation error, the order of complexity is significantly reduced and for applications that can tolerate 6% estimation error, the complexity is reduced to that of the classical monkey model entropy.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3

Similar content being viewed by others

References

  1. Razlighi, Q., Kehtarnavaz, N.: A comparison study of image spatial entropy. In: SPIE Proceedings of Visual Communications and Image Processing, San Jose (2009)

  2. Besag, J.: Spatial interaction and the statistical analysis of lattice systems (with discussion). J. R. Stat. Soc. B 36(2), 192–236 (1974)

    MathSciNet  MATH  Google Scholar 

  3. Razlighi, Q., Kehtarnavaz, N., Nosratinia, A.: Computation of image spatial entropy using quadrilateral Markov random field. IEEE Trans. Image Process. 18(12), 2629–2639 (2009)

    Article  MathSciNet  Google Scholar 

  4. Shannon, C.: A mathematical theory of communication. Bell Syst. Tech. J. 27, 379–423, 623–656 (1948)

    Google Scholar 

  5. Li, S.: Markov Random Field Modeling in Image Analysis, 3rd edn. Series: Advances in Pattern Recognition. Springer, Berlin (2009)

    MATH  Google Scholar 

  6. Goutsias, J.: Mutually compatible Gibbs random fields. IEEE Trans. Inf. Theory 35, 1233–1249 (1989)

    Article  MathSciNet  MATH  Google Scholar 

  7. Abend, K., Harley, T., Kanal, L.: Classification of binary random patterns. IEEE Trans. Inf. Theory IT-4, 538–544 (1965)

    Article  MathSciNet  Google Scholar 

  8. Gray, A., Kay, J., Titterington, D.: An empirical study of the simulation of various models used for images. IEEE Trans. Pattern Anal. Mach. Intell. 16, 507–513 (1994)

    Article  Google Scholar 

  9. Cover, T., Thomas, J.: Elements of Information Theory, 2nd edn. Wiley, New York (2006)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Electrical Engineering, University of Texas at Dallas, Richardson, TX, 75080, USA

    Qolamreza R. Razlighi, Mohammad T. Rahman & Nasser Kehtarnavaz

Authors
  1. Qolamreza R. Razlighi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Mohammad T. Rahman
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Nasser Kehtarnavaz
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Qolamreza R. Razlighi.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Razlighi, Q.R., Rahman, M.T. & Kehtarnavaz, N. Fast computation methods for estimation of image spatial entropy. J Real-Time Image Proc 6, 137–142 (2011). https://doi.org/10.1007/s11554-009-0144-y

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11554-009-0144-y

Keywords

Search

Navigation