CFP last date
20 January 2025
Reseach Article

Comparison of SOM Algorithm and K-Means Clustering Algorithm in Image Segmentation

by S. Ravikumar, A. Shanmugam
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 46 - Number 22
Year of Publication: 2012
Authors: S. Ravikumar, A. Shanmugam
10.5120/7097-9627

S. Ravikumar, A. Shanmugam . Comparison of SOM Algorithm and K-Means Clustering Algorithm in Image Segmentation. International Journal of Computer Applications. 46, 22 ( May 2012), 21-25. DOI=10.5120/7097-9627

@article{ 10.5120/7097-9627,
author = { S. Ravikumar, A. Shanmugam },
title = { Comparison of SOM Algorithm and K-Means Clustering Algorithm in Image Segmentation },
journal = { International Journal of Computer Applications },
issue_date = { May 2012 },
volume = { 46 },
number = { 22 },
month = { May },
year = { 2012 },
issn = { 0975-8887 },
pages = { 21-25 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume46/number22/7097-9627/ },
doi = { 10.5120/7097-9627 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T20:40:19.364810+05:30
%A S. Ravikumar
%A A. Shanmugam
%T Comparison of SOM Algorithm and K-Means Clustering Algorithm in Image Segmentation
%J International Journal of Computer Applications
%@ 0975-8887
%V 46
%N 22
%P 21-25
%D 2012
%I Foundation of Computer Science (FCS), NY, USA
Abstract

Image segmentation becomes simpler when the image is made up of smooth images. Many real world images are made up of a variety of smooth and textures regions, all of which need to identified in the segmentation algorithm. In such cases the existing methods fail to produce meaningful segmentation, successfully segmenting only the smooth or textured regions depending on the features used. The segmentation problem can be informally described as the task of partitioning an image into homogeneous regions. But in the textured images one of the main conceptual difficulties is the definition of a homogeneity measure in mathematical terms with of much complexity. By using a clustering algorithm, we can label the pixels of an image to form homogeneous functions or regions. Different clustering algorithms were commonly used in image segmentation algorithms. There are several issues related to image segmentation that require detailed review. The segmentation doesn't perform well if the grey levels of different objects are quite similar. This result in complex texture based image segmentation to use higher filter. But in future this technique used for dimensionality reduction to improve the speed.

References
  1. T. Pavlidis, Algorithms for graphics and image processing, Springer, Berlin, 1982.
  2. R. B. Ohlander, Analysis of natural scenes, PhD Thesis, Carnegie Institute of Technology, Dept. of Computer Science, Carnegie-Mellon University, Pittsburgh, PA, 1975
  3. M. Cheriet, J. N. Said and C. Y. Suen, A recursive thresholding technique for image segmentation, IEEE Transactions on Image Processing, 1998.
  4. N. Otsu, A threshold selection method from grey level histograms, IEEE Transactions on Systems, Man and Cybernetics,1978.
  5. L. Li, J. Gong and W. Chen, Gray-level image thresholding based on Fisher linear projection of two-dimensional histogram, Pattern Recognition, 1997.
  6. N. Ahuja, A. Rosenfeld and R. M. Haralick, Neighbour gray levels as features in pixel classification, Pattern Recognition, 1980.
  7. J. M. Prager, Extracting and labeling boundary segments in natural scenes, IEEE Transactions on Pattern Analysis and Machine Intelligence, 980.
  8. W. A. Perkins, Area segmentation of images using edge points, IEEE Transactions on Pattern Recognition and Machine Intelligence, 1980.
  9. F. H. Y. Chan, F. K. Lam and H. Zhu, Adaptive thresholding by variational method, IEEE Transactions on Image Processing, 1998.
  10. K. Cho and P. Meer, Image segmentation from consensus information, Computer Vision and Image Understanding, 1997.
  11. M. Yeung, B. L. Yeo and B. Liu, Segmentation of video by clustering and graph analysis, Computer Vision and Image Processing, 1998.
  12. Y. L. Chang and X. Li, Adaptive image region growing, IEEE Transactions on Image Processing,, 1994.
  13. R. Adams and L. Bischof, Seeded region growing, IEEE Transactions on Pattern Analysis and Machine Intelligence, 1994.
  14. Mehnert and P. Jackway, An improved seeded region growing algorithm, Pattern Recognition Letters, 1997.
  15. S. Basu, Image segmentation by semantic method, Pattern Recognition, 1987.
  16. J. P. Gambotto, A new approach to combining region growing and edge detection, Pattern Recognition Letters, 1993.
  17. S. A. Hojjatoleslami and J. Kittler, Region growing: a new approach, CVSSP Technical Report TR-6/95, University of Surrey, Department of Electronic and Electrical Engineering, 1995.
  18. S. W. Lu and H. Xu, Textured image segmentation using autoregressive model and artificial neural network, Pattern Recognition, 1995.
  19. H. He and Y. Q. Chen, Unsupervised texture segmentation using resonance algorithm for natural scenes, Pattern Recognition Letters, 2000.
  20. S. Singh, R. Al-Mansoori, Identification of regions of interest in digital mammograms, Journal of Intelligent Systems, 2000.
Index Terms

Computer Science
Information Sciences

Keywords

Feature Map Self Organizing Map Clustering Neural Networks Segmentation.