20 September 2001 Edge detection and image segmentation based on K-means and watershed techniques
Author Affiliations +
Proceedings Volume 4552, Image Matching and Analysis; (2001) https://doi.org/10.1117/12.441511
Event: Multispectral Image Processing and Pattern Recognition, 2001, Wuhan, China
In this paper, we present a method that incorporates k-means and watershed segmentation techniques for performing image segmentation and edge detection tasks. Firstly we used k-means techniques to examine each pixel in the image and assigns it to one of the clusters depending on the minimum distance to obtain primary segmented image into different intensity regions. We then employ a watershed transformation technique works on that image. This includes: First, Gradient of the segmented image. Second, Divide the image into markers. Third, Check the Marker Image to see if it has zero points (watershed lines) then delete the watershed lines in the Marker Image created by watershed algorithm. Fourth, Create Region Adjacency Graph (RAG) and the Region Adjacency Boundary (RAB) between two regions from Marker Image and finally; Fifth, Region Merging according to region average intensity and edge strength (T1, T2), where all the regions with the same merged label belong to one region. Our approach was tested on remote sensing and brain MR medical images and the final segmentation is one closed boundary per actual region in the image.
© (2001) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Nassir H. Salman, Nassir H. Salman, Chongqing Liu, Chongqing Liu, } "Edge detection and image segmentation based on K-means and watershed techniques", Proc. SPIE 4552, Image Matching and Analysis, (20 September 2001); doi: 10.1117/12.441511; https://doi.org/10.1117/12.441511

Back to Top