Skip to main content

CLUSTERING METHOD FOR FAST CONTENTBASED IMAGE RETRIEVAL

  • Chapter
Computer Vision and Graphics

Part of the book series: Computational Imaging and Vision ((CIVI,volume 32))

Abstract

When very large image families are involved in query processes, methods of content-based image retrieval must be optimized with a goal function determining a computing complexity. A clustering method which at the image retrieval stage ensure minimal number of comparisons of a query image and images from image database is proposed. Clustering can be fulfilled in feature or signal space. Pointwise set maps are used as the tools to find required partitions.

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 259.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

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. A. K. Jain and R. C. Dubes. Algorithms for Clustering Data, (Prentice Hall, New York, 1998).

    Google Scholar 

  2. M. Flickner, H. Sawhney, W. Niblack, J. Ashley, Q. Huang, B. Dom, M. Gorkani, J. Hafner, D. Lee, D. Petkovic, D. Steele and P. Yanker, Query by image and video content: the QBIC system, IEEE Computer, 28(9), 23–30, (1995).

    Google Scholar 

  3. Q. Iqbal, and J.K. Aggarwal, Applying perceptual grouping to content-based image retrieval: Building images, Proc of the IEEE International Conference on Computer Vision and Pattern Recognition, 1,42–48, (1999).

    Google Scholar 

  4. H.D. Wactlar, T. Kanade, M.A. Smith and S.M. Stevens, “Intelligent Access to Digital Video: Informedia Project,” IEEE Computer, 29(5), 46–52, (1996).

    Google Scholar 

  5. P. Berman and L. G. Shapiro, A Flexible Image Database System for Content-Based Retrieval, Computer Vision and Image Understanding, 75(1–2), 175–195, (1999).

    Google Scholar 

  6. A. Del Bimbo and P. Pala, Visual Image Retrieval by Elastic Matching of User Sketches, IEEE Trans, on Pattern Analysis and Machine Intelligence, 19(2), 121–132, (1997).

    Google Scholar 

  7. S. Derrode, M. Daoudi, and Faouzi Ghorbel, Invariant content-based image retrieval using a complete set of Fourier-Mellin descriptors, International Conference on Multimedia Computing and Systems, 2, 877–881, (1999).

    Google Scholar 

  8. C. Schmid and R. Mohr, Local gray-value invariants for image retrieval, IEEE Trans, on Pattern Analysis and Machine Intelligence, 19(5), 530–535, (1997).

    Article  Google Scholar 

  9. E. Celebi, and A. Alpkocak, Clustering of Texture Features for Content Based Image Retrieval, Lecture Notes in Computer Science, Springer-Verlag, Heidelberg, 1909, 216–225, (2000).

    Google Scholar 

  10. Q. Tian, N. Sebe, M.S. Lew, E. Loupias, T.S. Huang, Image Retrieval using Wavelet-based Salient Points, Journal of Electronic Imaging, 10(4), 835–849, (2001).

    Article  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

About this chapter

Cite this chapter

Kinoshenko, D., Mashtalir, V., Yegorova, E. (2006). CLUSTERING METHOD FOR FAST CONTENTBASED IMAGE RETRIEVAL. In: Wojciechowski, K., Smolka, B., Palus, H., Kozera, R., Skarbek, W., Noakes, L. (eds) Computer Vision and Graphics. Computational Imaging and Vision, vol 32. Springer, Dordrecht. https://doi.org/10.1007/1-4020-4179-9_138

Download citation

  • DOI: https://doi.org/10.1007/1-4020-4179-9_138

  • Publisher Name: Springer, Dordrecht

  • Print ISBN: 978-1-4020-4178-5

  • Online ISBN: 978-1-4020-4179-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics