0% found this document useful (0 votes)
18 views3 pages

Comparison of Medical Image Segmentation Techniques

This document compares various segmentation techniques in medical image processing, focusing on K-Means, Fuzzy C-Means (FCM), and Penalized Fuzzy C-Means (PFCM). It highlights the advantages and disadvantages of each method, noting that PFCM addresses the noise sensitivity of FCM and improves clustering accuracy. The paper concludes that effective segmentation is crucial in medical applications, and further research is needed to enhance these techniques.

Uploaded by

mesafintbelete1
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
18 views3 pages

Comparison of Medical Image Segmentation Techniques

This document compares various segmentation techniques in medical image processing, focusing on K-Means, Fuzzy C-Means (FCM), and Penalized Fuzzy C-Means (PFCM). It highlights the advantages and disadvantages of each method, noting that PFCM addresses the noise sensitivity of FCM and improves clustering accuracy. The paper concludes that effective segmentation is crucial in medical applications, and further research is needed to enhance these techniques.

Uploaded by

mesafintbelete1
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd

International Journal of Advanced Research in ISSN : 2347 - 8446 (Online)

Computer Science & Technology (IJARCST 2016) Vol. 4, Issue 4 (Oct. - Dec. 2016) ISSN : 2347 - 9817 (Print)

Segmentation Techniques Comparison in Medical


Image Processing
Husanjot Kaur (AP), IIHarmeet Kaur (AP)
I

I,II
Institute of Engineering & Technology, Ropar, Punjab, India

Abstract
In day-to-day life, new technologies are come to fore in the field of Image processing, especially in the world of segmentation. We
present soft computing approaches namely like K-Means, Fuzzy C-Means and Penalized Fuzzy C-Mean Clustering etc., mentioning
its merits as well as the demerits. Some of the techniques are suitable for noisy images. PFCM solves the noise sensitivity defect of
FCM, overcomes the coincident clusters problem of PCM, whereas K-Mean is the simplest technique for segmentation.

Keywords
Medical Image segmentation, Thresholding, PFCM, FCM, K Mean

I. Introduction
Image segmentation is the process of partitioning a digital image
into multiple segments (sets of pixels, also known as super
pixels). The goal of segmentation is to simplify and/or change the
representation of an image into something that is more meaningful
and easier to examine. Segmentation is typically used to locate
objects and boundaries (lines, curves, etc.) in images. The result
of image segmentation is a set of segments that collectively cover
the entire image, or a set of contours extracted from the image
(see edge detection). Each of the pixels in a region are similar
with respect to some characteristic or computed property, such
as colour, intensity or texture.

II. Classification Fig. 1. Various Types of segmentation


Segmentation can be classified as follows:
• Threshold b. K-Mean
• K-Mean K-means is one of the simplest unsupervised learning algorithms
• FCM that solve the well known clustering problem. The procedure
• PFCM follows a simple and easy way to classify a given data set through
The classification is specified in Fig 1 a certain number of clusters fixed a priori. [11]This algorithm
aims at minimizing an objective function, in this case a squared
A. Threshold error function. [7]. The algorithm is composed of the following
Thresholding is the easiest way of segmentation. It is done through steps:
that threshold values which are obtained from the histogram of • Place K points into the space represented by the objects
those edges of the original image [24]. The threshold values are that are being clustered. These points represent initial group
obtained from the edge detected image. So, if the edge detections are centroid.
accurate then the threshold too. Segmentation through thresholding • Assign each object to the group that has the closest
has fewer computations compared to other techniques. [23] centroid.
Segmentation is based on “his ton”. For a particular segment there • When all objects have been assigned, recalculate the positions
may be set of pixels which is termed as “his ton”. Roughness measure of the K centroid. Repeat Steps 2 and 3 until the centroid no
is followed by a thresholding method for image segmentation. longer move.
[18] Segmentation is done through adaptive thresholding. The • This produces a separation of the objects into groups from
gray level points where the gradient is high, is then added to which the metric to be minimized can be calculated. [8]
thresholding surface for segmentation [10] The drawback of this
segmentation technique is that it is not suitable for complex images. Merits & Demerits
The computational results showed that the K means image
segmentation has less accuracy but it provide poor result. The k
means algorithm takes minimum numbers of iterations compare
to C means. The KCM consume more time.

C. FCM
Fuzzy c-means (FCM) is a method of clustering which allows
one piece of data to belong to two or more clusters. This method
(developed by Dunn in 1973 and improved by Bezdek in 1981) is
frequently used in pattern recognition. It is based on minimization

© 2013, IJARCST All Rights Reserved 52 [Link]


ISSN : 2347 - 8446 (Online) International Journal of Advanced Research in
ISSN : 2347 - 9817 (Print) Vol. 4, Issue 4 (Oct. - Dec. 2016) Computer Science & Technology (IJARCST 2016)

of the following objective function: of the 6th WSEAS International Conference on Applied
Jm= ∑i=1n ∑j=1c uijm ││xi-cj││2 Computer Science, Spain, Dec. 2006.
where m is any real number greater than 1, uij is the degree of [4] Mei Yean Choong, Wei YeangKow, YitKwong Chin, “Image
membership of xi in the cluster j, xi is the ith of dimensional segmentation via normalized cuts and clustering algorithm.”
measured data, cj is the d-dimension center of the cluster, and 2012 IEEE international conference on control system
||*|| is any norm expressing the similarity between any measured [5] Nameirakpamdhanachandra, Khumanthemmanglam,
data and the center. “Image segmentation using k-means clustering algorithm
Merits: and subtractive clustering algorithm”. 11th international
FCM yields successful results for robust and effective image multi-conference on information processing-2015(IMCIP-
segmentation of noisy images. Gives best result for overlapped 2015)
data set and comparatively better then k-means algorithm. Unlike [6] Zeng-Wei Ju “Image segmentation based on edge detection
k-means where data point must exclusively belong to one cluster using K-means and an improved ant colony optimization”
center here data point is assigned membership to each cluster IEEE Conf. on Machine Learning and Cybernetics (ICMLC),,
center as a result of which data point may belong to more then 2013, pp 297 – 303.
one cluster center. [7] Shehroz S. Khan, Amir Ahmad,Cluster center initialization
algorithm for K-means clustering, Pattern Recognition
Demerits Letters 25 (2004) 1293-1302
1)  Apriori specification of the number of clusters. [8] Bradley, P.S., Fayyad, U.M., Refining initial points for K
2)  With lower value we get the better result but at the expense Means clustering. In: Sharlik, J. (Ed.), Proc. 15th Internat.
of more number of iteration. Conf. on Machine Learning (ICML98). Morgan Kaufmann,
San Francisco, CA,(1998) 91-99 621
D. PFCM [9] Prof. Dinesh D. Patil, Ms. Sonal G. Deore, ―Medical Image
A novel fuzzy clustering method, called penalized FCM (PFCM) Segmentation: A Review‖, IJCSMC, Vol. 2, Issue 1, January
algorithm is presented for image segmentation. The penalty term 2013, pg.22 – 27.
takes the spatial dependence of the objects into consideration, [10] SD Yanowitz, AM Bruckstein ,”A new method for image
which is inspired by the neighborhood EM (NEM) algorithm [19] segmentation” on Computer Vision, Graphics, and Image,
and is modified according to the criterion of FCM. The PFCM 1989
algorithm is then proposed by minimizing this new objective [11] Sorin Istrail, “An Overview of Clustering Methods”, With
function according to the zero gradient condition, which can Applications to Bioinformatics.
handle both the feature space information and spatial information [12] Otsu, N., “A Threshold Selection Method from GrayLevel
during [Link] model and algorithm that generated Histograms,” IEEE Transactions on Systems, Man, and
both membership and typicality values when clustering unlabeled Cybernetics, Vol. 9, No. 1, 1979, pp. 62-66.
data. PFCM solves the noise sensitivity defect of FCM, overcomes [13] B. R. Jipkate, V.V Gohokar, “A Comparative Analysis of Fuzzy
the coincident clusters problem of PCM and eliminates the row C-Means Clustering and K Means Clustering Algorithms”
sum constraints of FPCM. IJCER May-June 2012 Vol. 2 Issue No.3 737- 739.
Merits and demerits: [14] Keh-Shih Chaung, Hong-Long Tzeng, Sharon (2006),“Fuzzy
PFCM algorithm helps in identifying hidden pattern and providing C-means clustering with spatial information for image
enhanced understanding of the functional genomics in a better segmentation.”
way. [15] Dzung L. Pham, ChenyangXu, and Jerry L. Princ,îCurrent
Methods In Medical Image Segmentation,î Department of
III. Conclusions Electrical and Computer Engineering, The Johns Hopkins
This paper defines the segmentation technique in various fields University,Annu. Rev. Biomed. Eng. 2000. 02:315ñ37.
like in medical images detect Cancer, to brain MRI, to count blood [16] Rajesh Dass, Priyanka, Swapna Devi, “Image Segmentation
cells, in Horticulture for pest detection and many more. With the Techniques”, IJECT Vol.3, Issue 1, Jan-March 2012.
help of various clustering methods, segmentation became very [17] A color image segmentation algorithm based on region
effective. Cluster based segmentation can give effective result so growing.(2010)
further study can be conducted regarding improving clustering [18] Mushrif, M.M., Ray, A.K.: ‘Color image segmentation:
technique in segmentation. Issues in image segmentation are image Rough set theoretic approach’, Pattern Recognit. Lett., 2008,
quality and number of errors. We have to improve these errors 29, (4), pp. 483– 493
[19] C. Ambroise and G. Govaert, “Convergence of an EM-
References type algorithm for spatial clustering”, Pattern Recognition
[1] Taherdangkoo, M “Segmentation of MR brain images using Letters 19, 919–927(1998).
FCM improved by artificial bee colony (ABC) algorithm” [20] UDUPA, J. K., LEBLANC, V. R., ZHUGE, Y., IMIELINSKA,
IEEE Conf. on Information Technology and Applications in C., SCHMIDT, H., CURRIE, L. M., “A framework for
Biomedicine (ITAB), 2010, pp 1 – 5. evaluating image segmentation algorithms,” Computerized
[2] Yu Li “Image Segmentation Using FCM Optimized by Medical Imaging and Graphics, 30:75-87, 2006.
Quantum Immune Clone Algorithm”, IEEE Conf. on [21] H. Narkhede, “Review of image segmentation techniques,”
Intelligent Systems Design and Engineering Applications Int. J. Sci. Mod. Eng, vol. 1, p. 28, 2013.
(ISDEA), 2014, pp 537 – 540. [22] L. Galluccio, O. Michel, P. Comon, and A. O. Hero, “Graph
[3] Miin-Shen Yang, Wen-Liang Hung and Chia-Hsuan Chang, based k-means clustering,” Signal Processing, vol. 92, pp.
“A penalized fuzzy clustering algorithm”, In. Proceedings 1970-1984, 2012.

[Link] 53 © All Rights Reserved, IJARCST 2013


International Journal of Advanced Research in ISSN : 2347 - 8446 (Online)
Computer Science & Technology (IJARCST 2016) Vol. 4, Issue 4 (Oct. - Dec. 2016) ISSN : 2347 - 9817 (Print)

[23] Baradez, M.O., McGuckin, C.P., Forraz, N., Pettengell, R.,


Hoppe, A.: ‘Robust and automated unimodal histogram
thresholding and potential applications’, Pattern Recognit.,
2004, 37, (6), pp. 1131–1148
[24] Karthikeyan, B., Vaithiyanathan, V., Venkatraman,
B., Menaka, M. ,’ Analysis of image segmentation for
radiographic images’ in Indian Journal of Science and
Technology 5 (11) , pp. 3660-3664
[25] Kalpana Shrivastava, India Neelesh Gupta, Neetu
Sharma,”Medical Image Segmentation using Modified K
Means clustering”, International Journal of Computer
Applications (0975 – 8887) Volume 103 – No 16, October
2014
[26] S. Arumugadevi, V. Seenivasagam,”Comparison of clustering
methods for segmenting color images” Indian Journal of
Science and Technology, Vol 8(7), 670–677, April 2015

Author’s Profile

I received my [Link] degree in CSE from


Punjab Technical University Jalandhar in
2013 and [Link] in CSE from Punjabi
University Patiala in [Link] I am
working as a Assistant Professor at IET
Bhaddal, Ropar, India. My research work
includes medical image segmentation using
PFCM and PBO.

© 2013, IJARCST All Rights Reserved 54 [Link]

Common questions

Powered by AI

The main challenges in medical image segmentation include handling the high variability in medical images, noise, and the need for precise boundary detection. Clustering techniques like K-Means, FCM, and PFCM offer different approaches to partition the image into meaningful segments. K-Means is simple but less accurate, especially in noisy conditions . FCM improves on this by allowing soft membership to multiple clusters, making it suitable for overlapped datasets and noise . PFCM further enhances segmentation by accounting for spatial dependencies, effectively tackling noise sensitivity and refining cluster assignments .

K-Means assigns each data point to exactly one cluster based on proximity to the centroid, whereas Fuzzy C-Means (FCM) allows data points to belong to multiple clusters with varying degrees of membership. This is advantageous in scenarios where data overlap among clusters, leading to more nuanced segmentation . FCM tends to provide better results for overlapped data sets and is generally considered more robust for noisy images compared to K-Means .

The objective function in K-Means clustering aims to minimize the squared error function by reducing the distance between data points and their respective cluster centroids, leading to tighter and more cohesive clusters . In contrast, the objective function in Fuzzy C-Means extends this concept by incorporating the degree of membership of each data point in the clusters. It minimizes a fuzzified distance, balancing the data's membership across multiple clusters, which allows more flexible clustering especially useful for handling overlaps and varied data structures .

Penalized Fuzzy C-Means (PFCM) introduces a penalty term that accounts for spatial dependencies among the objects being clustered. This addresses the noise sensitivity issue present in conventional FCM by minimizing the new objective function based on spatial information, thereby producing more robust segmentation outcomes . PFCM helps in resolving the coincident clusters problem of Partitioned Cluster Means (PCM) and removes the row sum constraints of Fuzzy Partitioned Clustering Methods, making it more effective in dealing with noisy images .

The PFCM model contributes to the improved understanding of functional genomics by generating both membership and typicality values, thus handling complex data structures more effectively than traditional clustering methods. PFCM's ability to incorporate spatial and feature space information during segmentation allows it to identify hidden patterns in genomic data, facilitating enhanced analysis of biological functions and interactions . This approach overcomes limitations like noise sensitivity, providing a more detailed and reliable clustering outcome which is crucial for in-depth genomic studies .

Fuzzy C-Means (FCM) clustering provides several advantages for medical image segmentation, such as the ability to handle noisy data effectively and provide robust results for overlapping data sets by allowing data points to belong to multiple clusters . This flexibility leads to more accurate segmentations compared to strict partition methods. However, the disadvantages include the need to pre-specify the number of clusters, which can be challenging without prior knowledge, and increased computational costs due to the requirement for more iterations to converge compared to simpler algorithms like K-Means .

Adaptive thresholding enhances image segmentation by dynamically adjusting the threshold value based on local variations in the image, leading to more precise segmentation in regions with varying contrast . This is particularly useful for images with non-uniform lighting. However, its limitations include inefficiency in handling complex images with intricate details, as the local adjustments may still incorrectly segment parts of the image. The dependency on edge detection accuracy is another critical limitation since inaccurate edges lead to ineffective segmentation results .

The PFCM algorithm utilizes neighborhood information by incorporating spatial dependencies into the clustering process. This is achieved through a penalty term inspired by the neighborhood EM algorithm, which considers the spatial context of pixels. By doing so, PFCM improves segmentation quality by maintaining spatial consistency and reducing noise sensitivity, leading to more coherent and precise segmentation results . The impact is evident in enhanced segmentation of medical images where spatial context is crucial to distinguish between different tissue types .

The concept of 'his ton' in threshold-based segmentation refers to a set of pixels that share similar characteristics in a particular segment of an image. It is integral to defining the threshold values that separate different regions, as it groups pixels and facilitates the simplification of image regions for processing . This leads to the segmentation of the digital image into meaningful parts, making thresholding an computationally efficient approach for image segmentation .

Image segmentation techniques have diverse applications in fields such as medical imaging for cancer detection and brain MRI analysis, horticulture for pest detection, and blood cell counting . Clustering methods enhance these applications by providing a systematic approach to categorize image data into meaningful segments, enabling accurate identification and measurement. Techniques like PFCM and FCM significantly improve the precision of these applications by allowing consideration of spatial and feature information, which is particularly beneficial in complex images where pattern identification is key .

You might also like