Professional Documents
Culture Documents
_________________________________________________________________________________________________
IJIRIS: Impact Factor Value – SJIF: Innospace, Morocco (2016): 4.651
Indexcopernicus: (ICV 2016): 88.20
© 2014- 18, IJIRIS- All Rights Reserved Page -26
International Journal of Innovative Research in Information Security (IJIRIS) ISSN: 2349-7017
Issue 05, Volume 5 (July 2018) www.ijiris.com
In this method, the filter determines a median value from a group of values that have been sorted in ascending order.
The median group always comprises the values and window size on odd numbers. The size of the median window
which also called the mask has fixed sizes 3 x 3, 5 x 5 and 7 x 7 [26]. The median filter is a filter based a statistical
sort, the principle is that pixels in the genuine image at the point(I, J)The sorting and counting all the values in the
neighboring of (I, J) and will be in the middle of the values matrix as (I, J)of the 8th neighboring of values were: 101,
69, 0, 56, 255, 87, 123, 96, 157, Statistics sort: 0, 56, 69, 87, 96, 101, 123, 157, 255. The middle point in the matrix is
96 that are (I, J) value point median filter method response [26].The median filter algorithm could be summarized
as follows.
Algorithm A: Noise Removal Algorithm.
Input: MRI image.
Output: Filtered image.
Step 1. Read the MRI cerebral tissues image.
Step 2.Partition the original image into blocks of 3 x 3 pixels.
Step 2.1. Sort the values of the pixel in ascending order.
Step 2.2. Choose the middle value.
Step 2.3. Change the target pixel with the middle value.
Step 3. Repeat Step2 until the process is completed for the entire image.
Step 4. End
II. CLUSTERING ALGORITHM
Data clustering is a statistical method for analyzing data in many fields, such as image clustering, pattern
recognition, image analysis, data mining, bioinformatics, and machine learning [27]. The FCM algorithm can be used
to create grouping by partitioning data points into groups with the most significant similarity in data objective, with
the maximum or minimum similarity of data points among different groups [28].
2.1 FUZZY C-MEANS
FCM clustering is one of the essential methods that can be used to create clustering for a medical image. FCM is
widely used in image segmentation [29]. The standard FCM algorithm provides a partition of medical images. The
FCM technique is utilized to create the cluster. Each pixel of a dataset corresponds to the distance between the
cluster center and a data point. This algorithm is frequently used in pattern recognition and was developed in 1973
by Dunn and improved in 1983 by Bezdek [30]. The FCM algorithm provides a segmentation of medical images.
Tissue classification, including the quantification of volume tissues, the discovery of pathology, and computer-
integrated surgery, is a necessary step in medical imaging implementation. FCM partitions a set of n objects
X = {x , x , … , x } in dimensional space, where c is (1 < c < n) fuzzy clusters with C = {c , c , … , c } cluster centers
or centroids. The fuzzy clustering objects are given in Eq. (1) by n rows and c columns with fuzzy matrix µ, in which
c is the number of clusters and n is a number of data objects. μ is the value in the ith row and jth column in μ that
indicates the degree of the membership function of the ith object with the jh cluster [27, 31].
J = μ d (1)
where ( > 1) is any real number, is the row and number of data objects, is the columns and the number of
clusters, is the degree of the membership function of the th object with the th cluster, and the is given in Eq.
(5). The minimization of the following objective function and the characteristics of must satisfy the following
three conditions.
The range of membership value between 0 and 1 is given in Eq. (2) as follows:
∈ [0,1] , ∀ = 1,2, … , , ∀ = 1,2, … , (2)
The summation value of the membership for each data point being equal to 1 is given in Eq. (3).
= 1 ∀ = 1,2, … , (3)
The summation value of all membership in the cluster being smaller than the number of data objects is
given in Eq. (4).
(4)
0< < 1 ∀ = 1,2, … ,
= − (5)
_________________________________________________________________________________________________
IJIRIS: Impact Factor Value – SJIF: Innospace, Morocco (2016): 4.651
Indexcopernicus: (ICV 2016): 88.20
© 2014- 18, IJIRIS- All Rights Reserved Page -27
International Journal of Innovative Research in Information Security (IJIRIS) ISSN: 2349-7017
Issue 05, Volume 5 (July 2018) www.ijiris.com
where is the norm ||*|| for any standard expressing the similarity between the center and any measured data.
is the th d-dimension center of the cluster, and is the th of d-dimensional measured data. is greater than 1,
and is a scalar that describes the weighting exponent and controls the fuzziness of the resulting clusters. is the
Euclidian distance from object to cluster center , and is the centroid of the th cluster [31, 32].
∑
= (6)
∑
1 (7)
=
∑
This method works by allocating membership to every data value corresponding to every cluster center on the
basis of the distance between the data value and the cluster center. The data value that is near the cluster center
has the most membership toward the particular cluster center. Clearly, the collection of membership of every data
value must be equal to 1. Afterward, cluster centers and every iteration membership are updated according to Eq.
(7) [32, 33]. The FCM algorithm can be summarized as follows.
Algorithm B: Fuzzy C-mean (FCM) Algorithm
Input: Filtered image.
Output: MRI image with initial boundaries of cerebral tissues.
Step 1.Read MRI cerebral tissue image.
Step2.Define cluster numbers to be equal to , where < ≤ 3.
Step3. Select where is greater than 1. The values of the membership function are initializing , =
, ,…, ; = , ,…, .
Step4.Computing the cluster center , = , , … , , according to Eq. (6).
Step5.Computing Euclidian distance , = 1, 2, … , ; = 1, 2, … , , according Eq. (5).
Step 6. The membership function is updating where , = , , … , ; = , , … , according to Eq. (7).
Step 7. If converged, addition by 1 where = + and go back to step 2.
Step 8. End.
2.2 SEGMENTATION WITH THE LEVEL SET METHOD
The level set algorithm for segmenting a cerebral tissue image is implemented. The medical image shapes are
grayscale. Assume that = ( , ) is the medical image, where ∈ [1, ]and ∈ [1, ], while is the number of
image pixels. = ( , )is the point of the medical image in the front and develops over time, such that ( ) is the
position over time. Each point ( ) of time is on the highest surface of Eq. (8).
∅ ( ( ), ) = 0 (8)
This method depends on a PDE function ∅ ( , , ) [30, 34], and evaluation is possible by approximating the active
contours by tracking zero level set ( ), as shown in Figure 1, which explains Eq. (9).
∅( , , ) < 0, ( , ) ( )
( )= ∅( , , ) = 0, ( , ) ( ) (9)
∅( , , ) > 0, ( , ) ( )
∅( ( ), )
=0
∅
∅ ( ) ∅
+ =0 (10)
( )∅
∅
+ ∅ = 0
( )
In particular, the development of initial function ∅ is completely determined by the numerical level set equation.
∂∅
+ f|∇∅| = 0 (11)
∂t
∅(0, x, y) = ∅ (x, y)
where |∇∅| shows the natural direction, ∅ (X, Y), and F represents the initial contour of the casing, including the
power engineering internal interface (e.g., the mean curvature along the contour and area) and gradient synthetic
image of artificial momentum by external forces [34, 36]. The progress requiresF to be regularized by an edge
indicator function g in order to stop level set evolution near the optimal solution.
1
g= (12)
1 + |∇(Gσ ∗ I)|
whereGσ ∗ I stands for the convolution of medical image I with Gaussian noise Gσ , ∇ denotes the operation for the
medical image gradient, and the function g is around zero in variation boundaries [19]. A popular formulation for
level set segmentation is
∂∅ ∇∅
= |∇∅| div (13)
∂∅ |∇∅|
Below the clustered image has been segmented using the fuzzy level set segmentation (FLSS) algorithm to achieve
MRI cerebral tissue segmentation of the image. The required steps have been followed.
Algorithm C: Level Set Algorithm
Input: MRI image with initial boundaries of cerebral tissues.
Output: MRI cerebral tissue segmentation.
Step1. Create a loop for reading the first cluster of MRI image with initial boundaries of cerebral tissues.
Step2.If∅ (t, x, y) > 0 then go inside the cluster image.
Else if∅ (t, x, y) = 0 then go the boundary of the cluster image.
Else∅ (t, x, y) < 0 go the outside the cluster image, according Eq. (9).
Step3.Initializefunction ∅ of the level set matches the initial contour with chain rule by Eq. (10).
Step4. Evaluate the function ∅ is entirely by the numerical level set by using Eq. (11).
Step5. If the function g is near 0 in a boundary, go to Eq. (12), and go to the below formula to create the MRI
cerebral tissue segmentation by Eq. (13).
Step6.If there is remaining clusters return back to step1 otherwise finish the loop.
Step7. End.
IV. EXPERIMENT RESULT AND DISCUSSION
Performance evaluation and experiments are implemented on cerebral tissue image segmentation for medical
images, including an MRI image of the human brain. The images contain a variety of cerebral diseases, which exist in
different shapes, sizes, and locations in the brain. The dataset is utilized to evaluate the method, and the output of
each step is presented and discussed. Afterward, a comparison is carried out with recently related methods in the
literature. Our proposed method requires experiments for MRI brain image analysis. In this process, we select MRI
cerebral tissue images, as shown in Figure 2, and compare the performance of the proposed method with that of
using the median filter in terms of removing the impact of Gaussian noise in each MRI image. Given that this method
has the highest computational complexity and is time-consuming, the technique of searching window to window is
used in the comparison. FCM is applied to create cerebral tissue clusters for the human brain, as shown in Figure 3.
_________________________________________________________________________________________________
IJIRIS: Impact Factor Value – SJIF: Innospace, Morocco (2016): 4.651
Indexcopernicus: (ICV 2016): 88.20
© 2014- 18, IJIRIS- All Rights Reserved Page -29
International Journal of Innovative Research in Information Security (IJIRIS) ISSN: 2349-7017
Issue 05, Volume 5 (July 2018) www.ijiris.com
Fig.2.(a, b and c) are original MRI medical image, and (d, e and f) are filtered image.
This algorithm is determined by assigning membership to every data image value corresponding to the center of
every cluster on the basis of the distance between the cluster center and data point. The proposed method is applied
on parts of white and gray matter in the initial and final cluster centers of Cases 1 to 3. A detailed comparison is
performed between DFCM [6] and the proposed MFFLs for each part of white matter (WM) and gray matter (GM) in
the brain images according to the initial or final cluster center. Our method provides good valuations for the cluster
centers and demonstrates better practical convergence to the final cluster centers than DFCM [6].The values of the
initial and final cluster centers in DFCM are lower than those in the proposed method, as shown in Tables 1 and 2
with Figures 4and5.
Fig.3.The results of MRI medical images (a,b and c) are cluster images for gray matter, and (d, e and f) are cluster
images for white matter.
TABLE 1. DFCM AND OUR METHOD COMPARISON BETWEEN FINAL CLUSTER CENTER AND INITIAL CLUSTER
CENTER BASED ON A NUMBER OF ITERATIONS FOR WHITE MATTER.
_________________________________________________________________________________________________
IJIRIS: Impact Factor Value – SJIF: Innospace, Morocco (2016): 4.651
Indexcopernicus: (ICV 2016): 88.20
© 2014- 18, IJIRIS- All Rights Reserved Page -30
International Journal of Innovative Research in Information Security (IJIRIS) ISSN: 2349-7017
Issue 05, Volume 5 (July 2018) www.ijiris.com
TABLE 2.DFCM AND OUR METHOD COMPARISON BETWEEN FINAL CLUSTER CENTER AND INITIAL CLUSTER
CENTER BASED ON A NUMBER OF ITERATIONS FOR GRAY MATTER.
Comparison Method Initial Cluster Center Final Cluster Center Number of
Case1 Case2 Case3 Case1 Case2 Case3 Iterations
DFCM 1.1 2.5 3.8 1.100 97.667 146.569 13
MFFLs 2.0062 3.4427 5.1138 88.7257 99.3391 159.8158 15
(a) (b)
Fig.4. DFCM and our method comparison between final and initial cluster center based on number of iterations: (a)
initial cluster center for white matter, (b) final cluster center for white matter.
(a) (b)
Fig. 5. DFCM and the current proposed method comparison between final and initial cluster center based on
number of iterations: (a) initial cluster center for gray matter, (b) final cluster center for gray matter.
The implementation of a fuzzy level set algorithm to apply a part of WM and GM of the human brain utilizing
dynamic variation limits. In this experiment the biggest number of iterations is 15, where the iteration number
affects the output quality of an image; however, the Implementation time is increased. It is appropriate to unify the
forces for medical image segmentation. This study explains several cases of MRI cerebral tissue segmentation for
white matter and gray matter. The fuzzy level set formulation is configured as α = 0.5, β = 0.6, λ1 = 0.2 and λ2= 0.4
are utilized, and the amount of reprimand imposed on the integrals outside and inside the contour is different. In
addition, the equality of λ1 and λ2 demonstrate fair competition outside and inside the boundary during the
evolution.
_________________________________________________________________________________________________
IJIRIS: Impact Factor Value – SJIF: Innospace, Morocco (2016): 4.651
Indexcopernicus: (ICV 2016): 88.20
© 2014- 18, IJIRIS- All Rights Reserved Page -31
International Journal of Innovative Research in Information Security (IJIRIS) ISSN: 2349-7017
Issue 05, Volume 5 (July 2018) www.ijiris.com
The both of alpha (α) and beta (β) which is used in this experimental are increasing alpha and decreasing value of
beta correspond to the dependency of a location of the initial contour while decreasing values corresponds to a
more accurate location of the object boundaries. By using a correntropy standard, MFFLs can successfully extract
the desired objects, in spite of the presence and weak boundaries extreme noise. Figures 6 and 7 in the rows (a, b)
show the final evolution of a fuzzy level set of white matter and gray matter segmentation, at the end of the process
as shown in Figures 6 and 7 in the row (c) to the extracted region of final segmentation.
Fig. 6.MRI cerebral tissue segmentation based on fuzzy level set for white matter: row (a) stared segmentation, row
(b) final segmentation after 3, 9 and 15 iterations, respectively, with α = 0.5, β = 0.6, λ1 = 0.2 and λ2= 0.4 and
row(c) extracted region of final segmentation.
Fig.7. MRI cerebral tissue segmentation based on fuzzy level set for gray matter: row (a) stared segmentation, row
(b) final segmentation after 3, 9, and 15 iterations, respectively, with α = 0.5, β = 0.6, λ1 = 0.2 and λ2= 0.4 and
row(c) extracted region of final segmentation.
The results of Figures 6 and 7 were quantitative comparison the accuracy of that MRI cerebral tissue segmentation
the part of white and gray matters were given in Tables3 and 4 with Figure 8. It discovers that our MFFLs
segmentation algorithm achieves not only the best accuracy in all three cases of MRI images but also the highest
robustness to noise. This experiment explains again the proposed algorithm that had a better ability to resist the
impact of noise in medical images. The size of medical image patches is an essential parameter in our median filter
with the fuzzy level set segmentation algorithm. It determines how benefit medical image information will be used
and the limitation of spatial smoothness.
_________________________________________________________________________________________________
IJIRIS: Impact Factor Value – SJIF: Innospace, Morocco (2016): 4.651
Indexcopernicus: (ICV 2016): 88.20
© 2014- 18, IJIRIS- All Rights Reserved Page -32
International Journal of Innovative Research in Information Security (IJIRIS) ISSN: 2349-7017
Issue 05, Volume 5 (July 2018) www.ijiris.com
TABLE 3.A NUMBER OF ITERATIONS AND CLUSTER CENTER OF THE PROPOSED ALGORITHM FOR WHITE
MATTER
Medical Image Initial Cluster Center Final Cluster Center Number of Iteration Time Steps
Case1 2.0064 88.7257 3 8.447
Case2 3.4427 99.3391 9 2.21
Case3 5.1138 159.8158 15 5.912
TABLE 4.A NUMBER OF ITERATIONS AND CLUSTER CENTER OF THE PROPOSED ALGORITHM FOR GRAY MATTER
Medical Image Initial Cluster Center Final Cluster Center Number of Iteration Time Steps
Case1 3.7634 102.5521 3 12.15
Case2 4.1807 103.4951 9 11.3
Case3 5.6449 163.4565 15 8.584
We evaluate the performance of MFFLs algorithm, then the comparison among algorithms such as LBF, LGDF, LCK,
LCFCM_S, LCFCM_S1, and MFFLs for segmentation of medical images [2]. The study successfully applied a proposed
method of MFFLs to record for optimizing the performance of the similar premise then edge clear for medical image
segmentation and better than another algorithm as shown in Figures 6 and 7 in rows a and b are presented in
Tables 5.
TABLE 5. MFFLS METHOD AND ANOTHER METHODS COMPARISON WITH A NUMBER OF ITERATIONS AND
COMPUTATIONAL TIME (S) FOR WHITE MATTER AND GRAY MATTER IMAGES
White Matter Cluster Image Gray Matter Cluster Image
Comparison Method
Case1 Case2 Case3 Case1 Case2 Case3
Iteration 180 200 300 180 200 300
LBF
Time 31.51 5.2 21.79 31.51 5.2 21.79
Iteration 1250 300 240 1250 300 240
LGDF
Time 99.52 12.47 9.33 99.52 12.47 9.33
Iteration 300 580 260 300 580 260
LCK
Time 43.73 21.16 78.87 43.73 21.16 78.87
Iteration 170 360 160 170 360 160
LCFCM_S
Time 33.75 21.06 54.25 33.75 21.06 54.25
Iteration 170 360 160 170 360 160
LCFCM_S1
Time 22.31 10.66 15.08 22.31 10.66 15.08
Iteration 3 9 15 3 9 15
MFFLs
Time 8.447 2.21 5.912 12.15 11.3 8.584
V. CONCLUSION
Treating image noise and homogeneities while retaining edges and feature detail requires the selection of the
correct position of the initial cluster as the FCM is sensitive and needs to be dealt with accurately because incorrect
calculation causes the algorithm to stick at sub-optimal solutions. FCM works in the search area and must be moved
from one point to another until it reaches its final destination peak. We proposed median filter with fuzzy level set
algorithm is presented for fuzzy segmentation of MRI cerebral tissue images. Our proposed algorithms have been
applied for 80 MRI medical images in order to validate the efficiency method. A results of our MFFLs method
showed that the clustering to optimize the performance of the same premise, then edge clear of image segmentation
and better than DFCM especially for initial cluster center.
ACKNOWLEDGMENT
The Authors would like to thank Huazhong University of Science and Technology (China), EdithCowan University
(Australia), Chinese Scholarship Council, and the Science and Technology Program of Shenzhen of China under
Grant Nos. JCYJ20170307160458368 and JCYJ20170818160208570
REFERENCES
[1] J. Umamaheswari and G. Radhamani, “A fusion technique for medical image segmentation,”in Devices, Circuits
and Systems (ICDCS), 2012 International Conference on, 653–657, IEEE (2012).
_________________________________________________________________________________________________
IJIRIS: Impact Factor Value – SJIF: Innospace, Morocco (2016): 4.651
Indexcopernicus: (ICV 2016): 88.20
© 2014- 18, IJIRIS- All Rights Reserved Page -33
International Journal of Innovative Research in Information Security (IJIRIS) ISSN: 2349-7017
Issue 05, Volume 5 (July 2018) www.ijiris.com
[2] X.-L. Jiang, Q. Wang, B. He, et al., “Robust level set image segmentation algorithm using local correntropy-based
fuzzy c-means clustering with spatial constraints,” Neurocomputing 207, 22–35 (2016).
[3] M. Sato-Ilic, Innovations in fuzzy clustering: Theory and applications, vol. 205, Springer Science & Business
Media (2006).
[4] J. K. Udupa and S. Samarasekera, “Fuzzy connectedness and object definition: theory, algorithms, and
applications in image segmentation,” Graphical models and image processing 58(3), 246–261 (1996).
[5] W. Cai, S. Chen, and D. Zhang, “Fast and robust fuzzy c-means clustering algorithms incorporating local
information for image segmentation,” Pattern recognition 40(3), 825–838 (2007).
[6] F. Z. Benchara, M. Youssfi, O. Bouattane, et al., “A new scalable, distributed, fuzzy cmeans algorithm-based
mobile agents scheme for hpc: Spmd application,” Computers 5(3), 14 (2016).
[7] G. Ilango and R. Marudhachalam, “New hybrid filtering techniques for removal of Gaussian noise from medical
images,” ARPN Journal of Engineering and Applied Sciences 6(2), 8–12 (2011).
[8] M. Habib, A. Hussain, S. Rasheed, et al., “Adaptive fuzzy inference system based directional median filter for
impulse noise removal,” AEU-International Journal of Electronics and Communications 70(5), 689–697 (2016).
[9] A. Diaz-Sanchez, J. Lemus-Lopez, J. M. Rocha Perez, et al., “Ultra low-power analog median filters.,”
Radioengineering 22(3) (2013).
[10] A. Makandar and B. Halalli, “Image enhancement techniques using highpass and lowpass filters,” International
Journal of Computer Applications 109(14) (2015).
[11] X. Kang, M. C. Stamm, A. Peng, et al., “Robust median filtering forensics based on the autoregressive model of
median filtered residual,” in Signal and Information Processing Association Annual Summit and Conference
(APSIPA ASC), 2012 Asia-Pacific, 1–9, IEEE (2012).
[12] F. Khateb, T. Kulej, and M. Kumngern, “0.5-v dtmos median filter,” AEU-International Journal of Electronics and
Communications 69(11), 1733–1736 (2015).
[13] A. Norouzi, M. S. M. Rahim, A. Altameem, et al., “Medical image segmentation methods, algorithms, and
applications,” IETE Technical Review 31(3), 199–213 (2014).
[14] S. Osher and J. A. Sethian, “Fronts propagating with curvature-dependent speed: algorithms based on hamilton-
jacobi formulations,” Journal of computational physics 79(1), 12–49 (1988).
[15] C. Li, C.-Y. Kao, J. C. Gore, et al., “Minimization of region-scalable fitting energy for image segmentation,” IEEE
transactions on image processing: a publication of the IEEE Signal Processing Society 17(10), 1940 (2008).
[16] L. Wang and C. Pan, “Robust level set image segmentation via a local correntropy-based k-means clustering,”
Pattern Recognition 47(5), 1917–1925 (2014).
[17] L. Khelifi and M. Mignotte, “Efa-bmfm: A multi-criteria framework for the fusion of colour image segmentation,”
Information Fusion 38, 104–121 (2017).
[18] Y.-T. Chen, “A novel approach to segmentation and measurement of medical image using level set methods,”
Magnetic resonance imaging 39, 175–193 (2017).
[19] M. Sadaaki, I. Hidetomo, and H. Katsuhiro, “Algorithms for fuzzy clustering: methods in c-means clustering with
applications,” German: Springer (2008).
[20] S. Krinidis and V. Chatzis, “A robust fuzzy local information c-means clustering algorithm,” IEEE transactions on
image processing 19(5), 1328–1337 (2010).
[21] S. S. Kumar, R. S. Moni, and J. Rajeesh, “Automatic segmentation of liver tumour using a possibilistic alternative
fuzzy c-means clustering,” International Journal of Computers and Applications 35(1), 6–12 (2013).
[22] H. Shamsi and H. Seyedarabi, “A modified fuzzy c-means clustering with spatial information for image
segmentation,” International Journal of Computer Theory and Engineering 4(5), 762 (2012).
[23] X. Yang, S. Zhan, D. Xie, et al., “Hierarchical prostate MRI segmentation via level set clustering with shape prior,”
Neurocomputing 257, 154–163 (2017).
[24] Y.-F. Tsai, I.-J. Chiang, Y.-C. Lee, et al., “Automatic mri meningioma segmentation using estimation
maximization,” in Engineering in Medicine and Biology Society, 2005. IEEEEMBS 2005. 27th Annual
International Conference of the, 3074–3077, IEEE (2005).
[25] V. Bhateja, K. Rastogi, A. Verma, et al., “A non-iterative adaptive median filter for image denoising,” in Signal
Processing and Integrated Networks (SPIN), 2014 International Conference on, 113–118, IEEE (2014).
[26] A. Kaur, R. Malhotra, and R. Kaur, “Performance evaluation of non-iterative adaptive median filter,” in Advance
Computing Conference (IACC), 2015 IEEE International, 1117–1121, IEEE (2015).
[27] T. Altameem, E. Zanaty, and A. Tolba, “A new fuzzy c-means method for magnetic resonance image brain
segmentation,” Connection Science 27(4), 305–321 (2015).
[28] Y. Ding and X. Fu, “Kernel-based fuzzy c-means clustering algorithm based on genetic algorithm,”
Neurocomputing 188, 233–238 (2016).
_________________________________________________________________________________________________
IJIRIS: Impact Factor Value – SJIF: Innospace, Morocco (2016): 4.651
Indexcopernicus: (ICV 2016): 88.20
© 2014- 18, IJIRIS- All Rights Reserved Page -34
International Journal of Innovative Research in Information Security (IJIRIS) ISSN: 2349-7017
Issue 05, Volume 5 (July 2018) www.ijiris.com
[29] M. Balafar, A. Ramli, S. Mashohor, et al., “Compare different spatial based fuzzy-c mean (fcm) extensions for mri
image segmentation,” in Computer and Automation Engineering (ICCAE), 2010 The 2nd International
Conference on, 5, 609–611, IEEE (2010).
[30] D. J. Hemanth, J. Anitha, and V. E. Balas, “Performance improved modified fuzzy c-means algorithm for image
segmentation applications,” Informatica 26(4), 635–648 (2015).
[31] C. Nath, J. Talukdar, and P. Talukdar, “Robust fuzzy c-mean algorithm for segmentation and analysis of
cytological images,” International Journal 1(1) (2012).
[32] S. Yazdani, R. Yusof, A. Karimian, et al., “Image segmentation methods and applications in mri brain images,”
IETE Technical Review 32(6), 413–427 (2015).
[33] R. Suganya and R. Shanthi, “Fuzzy c-means algorithm-a review,” International Journal of Scientific and Research
Publications 2(11), 1 (2012).
[34] T. Friedrich, T. K¨otzing, M. S. Krejca, et al., “The compact genetic algorithm is efficient under extreme gaussian
noise,” IEEE Transactions on Evolutionary Computation 21(3), 477–490 (2017).
[35] R. B. Ali, R. Ejbali, and M. Zaied, “Gpu-based segmentation of dental x-ray images using active contours without
edges,” in Intelligent Systems Design and Applications (ISDA), 2015, 15th International Conference on, 505–
510, IEEE (2015).
[36] Y. Chen, H. D. Tagare, S. Thiruvenkadam, et al., “Using prior shapes in geometric active contours in a variational
framework,” International Journal of Computer Vision 50(3), 315–328 (2002).
_________________________________________________________________________________________________
IJIRIS: Impact Factor Value – SJIF: Innospace, Morocco (2016): 4.651
Indexcopernicus: (ICV 2016): 88.20
© 2014- 18, IJIRIS- All Rights Reserved Page -35