Skip to main content

Entropy Regularization, Automatic Model Selection, and Unsupervised Image Segmentation

  • Conference paper
  • 1802 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 4426))

Abstract

In region-based image retrieval, the key problem of unsupervised image segmentation is to automatically determine the number of regions for each image in a database. Though we can solve this kind of model selection problem with some statistical criteria such as the minimum description length (MDL) through implementing the EM algorithm, the process of evaluating these criteria may incur a large computational cost. From competitive learning perspective, some more efficient approaches such as rival penalized competitive learning (RPCL) have also been developed for unsupervised image segmentation. However, the segmentation results are not satisfactory and the object of interest may be merged with other regions, since the RPCL algorithm is sensitive to the rival learning rate. In order to solve such problems, we then propose an iterative entropy regularized likelihood (ERL) learning algorithm for unsupervised image segmentation based on the finite mixture model, which can make automatic model selection through introducing entropy regularization into maximum likelihood (ML) estimation. Some segmentation experiments on the Corel image database further demonstrate that the iterative ERL learning algorithm outperforms the MDL based EM (MDL-EM) algorithm and the RPCL algorithm, and leads to some promising results.

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   169.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

Learn about 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(10), 877–886 (2005)

    Article  Google Scholar 

  2. Dai, M., et al.: Image Segmentation by a Dynamic Thresholding Using Edge Detection Based on Cascaded Uniform Filters. Signal Processing 52(1), 49–63 (1996)

    Article  MATH  Google Scholar 

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

    Article  Google Scholar 

  4. Yap, K.-H., Wu, K.: A Soft Relevance Framework in Content-Based Image Retrieval Systems. IEEE Transactions on Circuits and Systems for Video Technology 15(12), 1557–1568 (2005)

    Article  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  6. Govaert, G., Nadif, M.: Comparison of the Mixture and the Classification Maximum Likelihood in Cluster Analysis with Binary Data. Computational Statistics & Data Analysis 23(1), 65–81 (1996)

    Article  MATH  Google Scholar 

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

    Article  Google Scholar 

  8. Rissanen, J.: Modeling by Shortest Data Description. Automatica 14, 465–471 (1978)

    Article  MATH  Google Scholar 

  9. Carson, C., et al.: Blobworld: Image Segmentation Using Expectation-Maximization and Its Application to Image Querying. IEEE Transactions on Pattern Analysis and Machine Intelligence 24(8), 1026–1038 (2002)

    Article  Google Scholar 

  10. Xu, L., Krzyzak, A., Oja, E.: Rival Penalized Competitive Learning for Clustering Analysis, RBF Net, and Curve Detection. IEEE Transactions on Neural networks 4(4), 636–648 (1993)

    Article  Google Scholar 

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

    MATH  MathSciNet  Google Scholar 

  12. Lu, Z.: Entropy Regularized Likelihood Learning on Gaussian Mixture: Two Gradient Implementations for Automatic Model Selection. Neural Processing Letters 25(1), 17–30 (2007)

    Article  MATH  Google Scholar 

  13. Lu, Z., Ma, J.: A Gradient Entropy Regularized Likelihood Learning Algorithm on Gaussian Mixture with Automatic Model Selection. In: Wang, J., et al. (eds.) ISNN 2006. LNCS, vol. 3971, pp. 464–469. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  14. Lu, Z.: A Regularized Minimum Cross-Entropy Algorithm on Mixtures of Experts for Time Series Prediction and Curve Detection. Pattern Recognition Letters 27(9), 947–955 (2006)

    Article  Google Scholar 

  15. Martin, D., et al.: A Database of Human Segmented Natural Images and Its Application to Evaluating Segmentation Agorithms and Measuring Ecological Statistics. In: Proceedings of the 8th International Conference on Computer Vision, pp. 416–423 (2001)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Zhi-Hua Zhou Hang Li Qiang Yang

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer Berlin Heidelberg

About this paper

Cite this paper

Lu, Z., Lu, X., Ye, Z. (2007). Entropy Regularization, Automatic Model Selection, and Unsupervised Image Segmentation. In: Zhou, ZH., Li, H., Yang, Q. (eds) Advances in Knowledge Discovery and Data Mining. PAKDD 2007. Lecture Notes in Computer Science(), vol 4426. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-71701-0_19

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-71701-0_19

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-71700-3

  • Online ISBN: 978-3-540-71701-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics