Skip to main content

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

Abstract

Colour quantisation algorithms are essential for displaying true colour images using a limited palette of distinct colours. The choice of a good colour palette is crucial as it directly determines the quality of the resulting image. Colour quantisation can also be seen as a clustering problem where the task is to identify those clusters that best represent the colours in an image. In this paper, we use a rough c-means clustering algorithm for colour quantisation of images. Experimental results on a standard set of images show that this rough image quantisation approach performs significantly better than other, purpose built colour quantisation algorithms.

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. Heckbert, P.S.: Color image quantization for frame buffer display. ACM Computer Graphics (ACM SIGGRAPH 1982 Proceedings) 16(3), 297–307 (1982)

    Article  Google Scholar 

  2. Gervautz, M., Purgathofer, W.: A simple method for color quantization: Octree quantization. In: Glassner, A. (ed.) Graphics Gems, pp. 287–293 (1990)

    Google Scholar 

  3. Dekker, A.: Kohonen neural networks for optimal colour quantization. Network: Computation in Neural Systems 5, 351–367 (1994)

    Article  MATH  Google Scholar 

  4. Scheunders, P.: A genetic c-means clustering algorithm applied to color image quantization. Pattern Recognition 30(6), 859–866 (1997)

    Article  Google Scholar 

  5. Nolle, L., Schaefer, G.: Color map design through optimization. Engineering Optimization 39(3), 327–343 (2007)

    Article  Google Scholar 

  6. Lingras, P., West, C.: Interval set clustering of web users with rough k-means. Journal Intell. Inform. Syst. 23, 5–16 (2004)

    Article  MATH  Google Scholar 

  7. Pawlak, Z.: Rough sets. Int. Journal Inform. Comput. Sci. 11, 145–172 (1982)

    MathSciNet  Google Scholar 

  8. Yao, Y., Li, X., Lin, T., Liu, Q.: Representation and classification of rough set models. In: 3rd Int. Workshop on Rough Sets and Soft Computing, pp. 630–637 (1994)

    Google Scholar 

  9. Peters, G.: Some refinements of rough k-means clustering. Pattern Recognition 39, 1481–1491 (2006)

    Article  MATH  Google Scholar 

  10. Zhang, X., Wandell, B.: Color image fidelity metrics evaluated using image distortion maps. Signal Processing 70(3), 201–214 (1998)

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Schaefer, G., Zhou, H., Hu, Q., Hassanien, A.E. (2009). Rough Image Colour Quantisation. In: Sakai, H., Chakraborty, M.K., Hassanien, A.E., Ślęzak, D., Zhu, W. (eds) Rough Sets, Fuzzy Sets, Data Mining and Granular Computing. RSFDGrC 2009. Lecture Notes in Computer Science(), vol 5908. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-10646-0_26

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-10646-0_26

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-10645-3

  • Online ISBN: 978-3-642-10646-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics