Skip to main content

Part of the book series: Studies in Fuzziness and Soft Computing ((STUDFUZZ,volume 119))

  • 970 Accesses

Abstract

Entropic thresholding algorithms are important tools in image processing. In this article, fast iterative methods are derived for the minimum cross entropy thresholding and maximum entropy thresholding algorithms using the one-point iteration scheme. Simulations performed using systhetic generated histograms and a real image show the speed advantage and the accuracy of the iterated methods.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 169.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 219.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. R. M. Haralich and L. G. Shapiro, Computer and Robot Vision, Addison-Wesley, 1992.

    Google Scholar 

  2. J, N. Kapur, P. K. Sahoo and A. K. C. Wong, “A new method for grey-level picture thresholding using the entropy of the histogram”, Computer Vision, Graphics and Image Processing, vol. 29, pp. 273–285, 1995.

    Article  Google Scholar 

  3. S. C. Cheng and W, H. Tsai, “A neural network implementation of the moment-preserving technique and its application to thresholding”, IEEE Trans. Computers, vol. 42, pp. 501–507, 1993.

    Article  Google Scholar 

  4. C. H. Li and C. K. Lee, “Minimum cross entropy thresholding”, Pattern Recognition, vol. 26, pp. 617–625, 1993.

    Article  Google Scholar 

  5. C. H. Li and P. K. S. Tam, “A modular expert network approach to histogram thresholding”, Journal of Electronic Imaging, vol. 26, pp. 617–625, 1997.

    Google Scholar 

  6. K. E. Atkinson, An Introduction to Numerical Analysis, Wiley, 1988.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Li, C.H., Lee, C.K., Tam, P.K.S. (2003). Entropic Thresholding Algorithms and their Optimizations. In: Karmeshu (eds) Entropy Measures, Maximum Entropy Principle and Emerging Applications. Studies in Fuzziness and Soft Computing, vol 119. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-36212-8_10

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-36212-8_10

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-05531-7

  • Online ISBN: 978-3-540-36212-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics