Skip to main content

Unsupervised Image Clustering Using the Information Bottleneck Method

  • Conference paper
  • First Online:
Pattern Recognition (DAGM 2002)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2449))

Included in the following conference series:

Abstract

A new method for unsupervised image category clustering is presented, based on a continuous version of a recently introduced information theoretic principle, the information bottleneck (IB). The clustering method is based on hierarchical grouping: Utilizing a Gaussian mixture model, each image in a given archive is first represented as a set of coherent regions in a selected feature space. Images are next grouped such that the mutual information between the clusters and the image content is maximally preserved. The appropriate number of clusters can be determined directly from the IB principle. Experimental results demonstrate the performance of the proposed clustering method on a real image database.

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. S. Belongie, C. Carson, H. Greenspan, and J. Malik. Color and texture-based image segmentation using em and its application to content based image retrieval. In Proc. of the Int. Conference on Computer Vision, pages 675–82, 1998.

    Google Scholar 

  2. J. Chen, C.A. Bouman, and J.C. Dalton. Hierarchical browsing and search of large image databases. IEEE transactions on Image Processing, 9(3):442–455, March 2000.

    Article  Google Scholar 

  3. T. M. Cover and J. A. Thomas. Elements of Information Theory. John Wiley and Sons, 1991.

    Google Scholar 

  4. A. Dempster, N. Laird, and D. Rubin. Maximum likelihood from incomplete data via the em algorithm. J. Royal Statistical Soc. B, 39(1):1–38, 1997.

    MathSciNet  Google Scholar 

  5. L. Hermes, T. Zoller, and J. M. Buhmann. Parametric distributional clustering for image segmentation. In Proceedings of ECCV02, volume III, pages 577–591, 2002.

    Google Scholar 

  6. S. Krishnamachari and M. Abdel-Mottaleb. Hierarchical clustering algorithm for fast image retrieval. In IS&T/SPIE Conference on Storage and Retrieval for Image and Video databases VII, pages 427–435, San-Jose, CA, Jan 1999.

    Google Scholar 

  7. N. Slonim and N. Tishby. Agglomerative information bottleneck. In In Proc. of Neural Information Processing Systems, pages 617–623, 1999.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Goldberger, J., Greenspan, H., Gordon, S. (2002). Unsupervised Image Clustering Using the Information Bottleneck Method. In: Van Gool, L. (eds) Pattern Recognition. DAGM 2002. Lecture Notes in Computer Science, vol 2449. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45783-6_20

Download citation

  • DOI: https://doi.org/10.1007/3-540-45783-6_20

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-45783-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics