Edge detection using clustering algorithms

Sirin T., Saglam M. I., Erer I., Gokmen M.

WSEAS Transactions on Computers, vol.4, no.5, pp.417-423, 2005 (Scopus) identifier

  • Publication Type: Article / Article
  • Volume: 4 Issue: 5
  • Publication Date: 2005
  • Journal Name: WSEAS Transactions on Computers
  • Journal Indexes: Scopus
  • Page Numbers: pp.417-423
  • Keywords: Canny, Clustering, Edge detection, GED, K-Means, SOM
  • Istanbul Technical University Affiliated: Yes


Edge detection is an important topic in image processing and a main tool in pattern recognition and image segmentation. Many edge detection techniques are available in the literature. 'A number of recent edge detectors are multiscale and include three main processing steps: smoothing, differentiation and labeling' (Ziau and Tabbone, 1997). This paper, presents a proposed method which is suitable for edge detection in images. This method is based on the use of the clustering algorithms (Self-Organizing Map (SOM), K-Means) and a gray scale edge detector (Canny, Generalized Edge Detector (GED)). It is shown that using the grayscale edge detectors may miss some parts of the edges which can be found using the proposed method.