Skip to main content

Unsupervised Image Segmentation Using an Iterative Entropy Regularized Likelihood Learning Algorithm

  • Conference paper
Advances in Neural Networks - ISNN 2006 (ISNN 2006)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 3972))

Included in the following conference series:

Abstract

As for unsupervised image segmentation, one important application is content based image retrieval. In this context, the key problem is to automatically determine the number of regions(i.e., clusters) for each image so that we can then perform a query on the region of interest. This paper presents an iterative entropy regularized likelihood (ERL) learning algorithm for cluster analysis based on a mixture model to solve this problem. Several experiments have demonstrated that the iterative ERL learning algorithm can automatically detect the number of regions in a image and outperforms the generalized competitive clustering.

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight 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. Shih, F.Y., Cheng, S.X.: Automatic Seeded Region Growing for Color Image Segmentation. Image and Vision Computing 23, 877–886 (2005)

    Article  Google Scholar 

  2. Dai, M., Baylou, P., Humbert, L., Najim, M.: Image Segmentation by a Dynamic Thresholding Using Edge Detection Based on Cascaded Uniform Filters. Signal Processing 52, 49–63 (1996)

    Article  MATH  Google Scholar 

  3. Banerjee, M., Kundu, M.K.: Edge Based Features for Content Based Image Retrieval. Pattern Recognition 36, 2649–2661 (2003)

    Article  Google Scholar 

  4. Render, R.A., Walker, H.F.: Mixture Densities, Maximum Likelihood and the EM Algorithm. SIAM Review 26, 195–239 (1984)

    Article  MathSciNet  Google Scholar 

  5. Chinrungrueng, C., Sequin, C.H.: Optimal Adaptive K-Means Algorithm with Dynamic Adjustment of Learning Rate. IEEE Transactions on Neural Networks 6, 157–169 (1995)

    Article  Google Scholar 

  6. Dennis, D.C., Finbarr, O.S.: Asymptotic Analysis of Penalized Likelihood and Related Estimators. The Annals of Statistics 18, 1676–1695 (1990)

    Article  MATH  MathSciNet  Google Scholar 

  7. Vapnik, V.N.: An Overview of Statistical Learning Theory. IEEE Transactions on Neural Networks 10, 988–999 (1999)

    Article  Google Scholar 

  8. Boujeman, N.: Generalized Competitive Clustering for Image Segmentation. In: 19th International Conference of the North American Fuzzy Information Processing Society, pp. 133–137 (2000)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Lu, Z. (2006). Unsupervised Image Segmentation Using an Iterative Entropy Regularized Likelihood Learning Algorithm. In: Wang, J., Yi, Z., Zurada, J.M., Lu, BL., Yin, H. (eds) Advances in Neural Networks - ISNN 2006. ISNN 2006. Lecture Notes in Computer Science, vol 3972. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11760023_72

Download citation

  • DOI: https://doi.org/10.1007/11760023_72

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-34437-7

  • Online ISBN: 978-3-540-34438-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics