Please use this identifier to cite or link to this item:
|Title:||Medical image segmentation using k-means clustering and improved watershed algorithm||Authors:||Ng, H.P.
|Issue Date:||2006||Citation:||Ng, H.P.,Ong, S.H.,Foong, K.W.C.,Goh, P.S.,Nowinski, W.L. (2006). Medical image segmentation using k-means clustering and improved watershed algorithm. Proceedings of the IEEE Southwest Symposium on Image Analysis and Interpretation 2006 : 61-65. ScholarBank@NUS Repository.||Abstract:||We propose a methodology that incorporates kmeans and improved watershed segmentation algorithm for medical image segmentation. The use of the conventional watershed algorithm for medical image analysis is widespread because of its advantages, such as always being able to produce a complete division of the image. However, its drawbacks include over-segmentation and sensitivity to false edges. We address the drawbacks of the conventional watershed algorithm when it is applied to medical images by using K-means clustering to produce a primary segmentation of the image before we apply our improved watershed segmentation algorithm to it. The K-means clustering is an unsupervised learning algorithm, while the improved watershed segmentation algorithm makes use of automated thresholding on the gradient magnitude map and post-segmentation merging on the initial partitions to reduce the number of false edges and over-segmentation. By comparing the number of partitions in the segmentation maps of 50 images, we showed that our proposed methodology produced segmentation maps which have 92% fewer partitions than the segmentation maps produced by the conventional watershed algorithm. © 2006 IEEE.||Source Title:||Proceedings of the IEEE Southwest Symposium on Image Analysis and Interpretation||URI:||http://scholarbank.nus.edu.sg/handle/10635/70910||ISBN:||1424400694|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Sep 8, 2019
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.