Image Segmentation Based on Representative Colors Detection and Region Merging

  • Giuliana Ramella
  • Gabriella Sanniti di Baja
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7914)

Abstract

We present a color image segmentation algorithm, RCRM, based on the detection of Representative Colors and on Region Merging. The 3D color histogram of the RGB input image is built. Colors are processed in decreasing frequency order and a grouping process is accomplished to gather in the same cluster all colors that are close enough to the current color. Colormapping is done to originate a preliminary image segmentation. Segmentation regions having small size undergo a merging process. Merging is actually accomplished only for adjacent regions whose colors do not significantly differ. The parameters involved by the algorithm are set automatically by taking into account color distribution in the input image and geometrical features of the regions into which the image is partitioned. The algorithm has been tested on a large number of RGB color images originating satisfactory results.

Keywords

RGB color images 3D histogram color quantization image segmentation 

References

  1. 1.
    Cheng, H.D., Jiang, X.H., Sun, Y., Wang, J.: Color image segmentation: advances and prospects. Pattern Recognition 34, 2259–2281 (2001)MATHCrossRefGoogle Scholar
  2. 2.
    Busin, L., Vandenbroucke, N., Macaire, L.: Color spaces and image segmentation. In: Advances in Imaging and Electron Physics, ch. 2, JCR Science Edition, Orlando, FL, USA, vol. 1, pp. 65–168 (2008)Google Scholar
  3. 3.
    Bhattacharyya, S.: A Brief Survey of Color Image Preprocessing and Segmentation Techniques. J. of Pattern Recognition Research 1, 120–129 (2011)Google Scholar
  4. 4.
    Ramella, G., Sanniti di Baja, G.: Color histogram-based image segmentation. In: Real, P., Diaz-Pernil, D., Molina-Abril, H., Berciano, A., Kropatsch, W. (eds.) CAIP 2011, Part I. LNCS, vol. 6854, pp. 76–83. Springer, Heidelberg (2011)CrossRefGoogle Scholar
  5. 5.
    Lloyd, S.P.: Least squares quantization in PCM. IEEE Trans. Information Theory 28(2), 129–136 (1982)MathSciNetMATHCrossRefGoogle Scholar
  6. 6.
    Berkhin, P.: Survey of clustering data mining techniques. Accrue Software, San Jose, CA. Technical Report (2002)Google Scholar
  7. 7.
    Zhang, H., Fritts, J., Goldman, S.: An entropy-based objective evaluation method for image segmentation. In: Proceedings of SPIE 5307 Storage and Retrieval Methods and Applications for Multimedia, pp. 38–49 (2004)Google Scholar
  8. 8.
    Rehrmann, V., Priese, L.: Fast and robust segmentation of natural color scenes. In: Chin, R., Pong, T.-C. (eds.) ACCV 1998. LNCS, vol. 1351, pp. 598–606. Springer, Heidelberg (1997)CrossRefGoogle Scholar
  9. 9.
    Comaniciu, D., Meer, P.: Mean Shift: A Robust Approach Toward Feature Space Analysis. IEEE Trans. Pattern Anal. Machine Intell. 24(5), 603–619 (2002)CrossRefGoogle Scholar
  10. 10.
    Tilton, J.: D-dimensional formulation and implementation of recursive hierarchical segmentation, Disclosure of Invention and New Technology: NASA Case No. GSC 15199-1 (2006)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2013

Authors and Affiliations

  • Giuliana Ramella
    • 1
  • Gabriella Sanniti di Baja
    • 1
  1. 1.Istituto di Cibernetica "E.Caianiello", CNRPozzuoliItaly

Personalised recommendations