Please use this identifier to cite or link to this item:
|Title:||Masseter segmentation using an improved watershed algorithm with unsupervised classification|
|Citation:||Ng, H.P., Ong, S.H., Foong, K.W.C., Goh, P.S., Nowinski, W.L. (2008-02). Masseter segmentation using an improved watershed algorithm with unsupervised classification. Computers in Biology and Medicine 38 (2) : 171-184. ScholarBank@NUS Repository. https://doi.org/10.1016/j.compbiomed.2007.09.003|
|Abstract:||The watershed algorithm always produces a complete division of the image. However, it is susceptible to over-segmentation and sensitivity to false edges. In medical images this leads to unfavorable representations of the anatomy. We address these drawbacks by introducing automated thresholding and post-segmentation merging. The automated thresholding step is based on the histogram of the gradient magnitude map while post-segmentation merging is based on a criterion which measures the similarity in intensity values between two neighboring partitions. Our improved watershed algorithm is able to merge more than 90% of the initial partitions, which indicates that a large amount of over-segmentation has been reduced. To further improve the segmentation results, we make use of K-means clustering to provide an initial coarse segmentation of the highly textured image before the improved watershed algorithm is applied to it. When applied to the segmentation of the masseter from 60 magnetic resonance images of 10 subjects, the proposed algorithm achieved an overlap index (κ) of 90.6%, and was able to merge 98% of the initial partitions on average. The segmentation results are comparable to those obtained using the gradient vector flow snake. © 2007 Elsevier Ltd. All rights reserved.|
|Source Title:||Computers in Biology and Medicine|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Jul 14, 2018
WEB OF SCIENCETM
checked on Jul 4, 2018
checked on Jun 1, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.