Skip to main content

Image Segmentation Based on k-Means Clustering and Energy-Transfer Proximity

  • Conference paper
Advances in Visual Computing (ISVC 2011)

Part of the book series: Lecture Notes in Computer Science ((LNIP,volume 6939))

Included in the following conference series:

  • 2812 Accesses

Abstract

In image segmentation, measuring the distances is an important problem. The distance should tell whether two image points belong to a single or, respectively, to two different image segments. Although the Euclidean distance is often used, the disadvantage is that it does not take into account anything what happens between the points whose distance is measured. In this paper, we introduce a new quantity called the energy-transfer proximity that reflects the distances between the points on the image manifold and that can be used in the image-segmentation algorithms. In the paper, we focus especially on its use in the algorithm that is based on k-means clustering. The needed theory as well as some experimental results are presented.

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

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
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.

Similar content being viewed by others

References

  1. MacQueen, J.B.: Some Methods for Classification and Analysis of Multivariate Observations. In: Proceedings of 5th Berkeley Symposium on Mathematical Statistics and Probability, pp. 281–297. University of California Press, Berkeley (1967)

    Google Scholar 

  2. Lloyd, S.P.: Least Squares Quantization in PCM. IEEE Transactions on Information Theory 28(2), 129–137 (1982)

    Article  MathSciNet  MATH  Google Scholar 

  3. Hartigan, J.A., Wong, M.A.: Algorithm AS 136: A K-Means Clustering Algorithm. Journal of the Royal Statistical Society, Series C (Applied Statistics) 28, 100–108 (1979)

    MATH  Google Scholar 

  4. Ravichandran, K.S., Ananthi, B.: Color Skin Segmentation Using K-Means Cluster. International Journal of Computational and Applied Mathematics 4(2), 153–157 (2009)

    Google Scholar 

  5. Asgharbeygi, N., Maleki, A.: Geodesic K-means Clustering. In: Proceedings of 19th International Conference on Pattern Recognition, pp. 1–4 (2008)

    Google Scholar 

  6. Kashima, H., Hu, J., Ray, B., Singh, M.: K-Means Clustering of Proportional Data Using L1 Distance. In: Proceedings of 19th International Conference on Pattern Recognition, pp. 1–4 (2008)

    Google Scholar 

  7. Gaura, J., Sojka, E., Krumnikl, M.: Image Segmentation Based on Electrical Proximity in a Resistor-Capacitor Network. In: Proceedings of Advanced Concepts for Intelligent Vision Systems, pp. 216–227 (2011)

    Google Scholar 

  8. Martin, D., Fowlkes, C., Tal, D., Malik, J.: A Database of Human Segmented Natural Images and its Application to Evaluating Segmentation Algorithms and Measuring Ecological Statistics. In: Proceedings of 8th International Conference of Computer Vision, pp. 416–423 (2001)

    Google Scholar 

  9. Duda, R., Hart, P.: Pattern Classification and Scene Analysis. John Wiley and Sons, New York (1973)

    MATH  Google Scholar 

  10. Luo, M., Yu-Fei, M., Zhang, H.J.: A Spatial Constrained K-Means Approach to Image Segmentation. Information, Communications and Signal Processing, 738–742 (2003)

    Google Scholar 

  11. Hosni, A., Bleyer, M., Gelautz, M.: Image Segmentation Via Iterative Geodesic Averaging. In: Proceedings of the 5th International Conference on Image and Graphics, pp. 250–255 (2009)

    Google Scholar 

  12. Babic, D., Klein, D.J., Lukovits, I., Nikolic, S., Trinajstic, N.: Resistance-Distance Matrix: A Computational Algorithm and its Applications. International Journal of Quantum Chemistry 90, 166–176 (2002)

    Article  Google Scholar 

  13. Comaniciu, D., Meer, P.: Mean Shift: A Robust Approach Toward Feature Space Analysis. IEEE Transactions on Pattern Analysis and Machine Intelligence 24, 1–18 (2002)

    Article  Google Scholar 

  14. Fouss, F., Pirotte, A., Renders, J.M., Saerens, M.: Random-Walk Computation of Similarities between Nodes of a Graph with Application to Collaborative Recommendation. IEEE Transactions on Knowledge and Data Engineering 19, 355–369 (2007)

    Article  Google Scholar 

  15. Joshi, S., Kommaraju, R.V., Phillips, J.M., Venkatasubramanian, S.: Comparing Distributions and Shapes Using the Kernel Distance. In: Proceedings of 27th ACM Symposium on Computational Geometry, pp. 47–56 (2011)

    Google Scholar 

  16. Klein, D.J., Randic, M.: Resistance Distance. Journal of Mathematical Chemistry 12, 81–95 (1993)

    Article  MathSciNet  Google Scholar 

  17. Ling, H.: Diffusion Distance for Histogram Comparison. In: Proceedings of IEEE Conference on Computer Vision and Pattern Recognition, pp. 246–253 (2006)

    Google Scholar 

  18. Lipman, Y., Rustamov, R.M., Funkhouser, T.A.: Biharmonic Distance. ACM Transactions on Graphics 29, 1–11 (2010)

    Google Scholar 

  19. Perona, P., Malik, J.: Scale-Space and Edge Detection Using Anisotropic Diffusion. IEEE Transactions on Pattern Analysis and Machine Intelligence 12(7), 629–639 (1990)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Gaura, J., Sojka, E., Krumnikl, M. (2011). Image Segmentation Based on k-Means Clustering and Energy-Transfer Proximity. In: Bebis, G., et al. Advances in Visual Computing. ISVC 2011. Lecture Notes in Computer Science, vol 6939. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-24031-7_57

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-24031-7_57

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-24030-0

  • Online ISBN: 978-3-642-24031-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics