6 views

Uploaded by Raji Prasad

- Writing Problem and Hypothesis Statements for Medical Research(2)
- Probabilistic Neural Network Assisted Cell Tracking and Classification
- Paper Icpram 2016
- Medical Image Segmentation Using Image Mining Concepts
- Caillette Phd Thesis
- 0511_Reynolds1
- 10.1.1.83
- IJERD (www.ijerd.com) International Journal of Engineering Research and Development IJERD : hard copy of journal, Call for Papers 2012, publishing of journal, journal of science and technology, research paper publishing, where to publish research paper, journal publishing, how to publish research paper, Call For research paper, international journal, publishing a paper, how to get a research paper published, publishing a paper, publishing of research paper, reserach and review articles, IJERD Journal, How to publish your research paper, publish research paper, open access engineering journal, Engineering journal, Mathemetics journal, Physics journal, Chemistry journal, Computer Engineering, how to submit your paper, peer review journal, indexed journal, reserach and review articles, engineering journal, www.ijerd.com, research journals, yahoo journals, bing journals, International Journal of Engineering Research and Development, google journals, journal of engineering, online Submis
- another paper.pdf
- 05647676
- maddydavisonscientistinterview
- Superiority of Graph Based Visual Saliency Gvs Over Other Image Segmentation Methods
- Li - Rhythmic Brushstrokes for Van Gogh Distinguish - PAMI - 2011
- Image Proc_Term Paper Report
- Articulo de Segmentacion de Fotos
- Basic principles of MRI
- [6]_Image Description and Representation
- ijcttjournal-v1i2p20
- [RGBD] Navigation Assistance for the Visually Impaired Using RGB-D Sensor With Range Expansion
- Scott Acton

You are on page 1of 9

KEHONG YUAN1,2, LIANWEN WU1, CHAO CHEN3, QIANSHENG CHENG1**, SHANGLIAN BAO2, HONGJIE ZHANG4

1. LM AM, School of Mathematics Sciences, Peking University, Beijing 100871, China 2. The Research Center for Tumor Diagnosis and Therapeutical Physics, Peking University, Beijing 100871, China 3. School of Computer Science, Heilongjiang University, Harbin, 150080, China 4. Navy General Hospital of PLA; Beijing, 100037, China

Abstract The accurate and effective algorithm for segmenting image is very useful in many fields, especially in

medical image. In this paper we introduced a novel method that focus on segmenting the brain MR Image that is important for neural diseases. Because of many noises embedded in the acquiring procedure, such as

eddy currents, susceptibility artifacts, rigid body motion, and intensity inhomogeneity, segmenting the brain MR image is a difficult work. In this algorithm, we overcame the inhomogeneity shortage, by modifying the objective function with compensating its immediate neighborhood effect using Gaussian smooth method for decreasing the influence of the inhomogeneity and increasing the segmenting accuracy. With simulate image and the clinical MRI data, the experiments shown that our proposed algorithm is effective.

Key Words: FCM Cluster, brain MRI, image segmentation, whiter matter. 1. Introduction Recently, many people use the MRI data to research the relation between white matter development and neural diseases , especially, the anatomy image is fusing with those images from diffusion tensor imaging, and using the white matter to lead the fibre tack [1-2], the accuracy of segmenting white matter is key problem. Attention deficit hyperactivity disorder(ADHD) [3] is also needed to segment white matter. In spite of many algorithms for segmenting MRI of data[4-8], such as watershed algorithm, eSneke algorithm, generic algorithm. In addition, those algorithms are based on the homogeneity of image. In fact, intensity inhomogeneity is impact on every image and we have to solve the problem with new method. Wells

[9]

algorithm, but the results are too dependent on the initial values, extremely consuming the time and just

1

**

Supported by the National Natural Science Foundation of China (Grant Nos. 69872003 and 40035010) To whom correspondence should be addressed: E-mail: qcheng@pku.edu.cn

looking for local maximum point. Ahmed[10] formulated by modifying the objective function of the standard FCM algorithm to compensate for such inhomogeneities. The method is outperformed, but because the average of immediate neighborhood is influenced localized measurements, and it is no good for accuracy segmentation of WM. In this paper, we used for reference Ahmed[10] and modified the objective function of FCM employed the Gaussian smoothing to compensate immediate neighborhood influence, estimated the inhomogeneities. The simulating image and real MRI data for help us to verify the algorithm and results were good consistent and our methods were verified.

2. Methods 2.1 Model of fuzzy c-mean method(FCM) The standard FCM is an iterative, unsupervised clustering algorithm, initially developed by FCM algorithm ,introduced by Bezdek[11]. The following model of FCM is described by Ahmed[10]. The Observed MRI signal is modeled as a product of the true signal generated by the underlying anatomy, and a spatially varying factor called the gain field

Yk = X k Gk

k {1, 2, , N }

(1)

groups the values X k , Yk and Gk are the true intensity, observed intensity and the gain field at the kth voxel, respectively.

The application of a logarithmic transformation to the intensities allows the artifact to be modeled as an additive bias field

yk = xk + k

where

k {1, 2, , N }

(2)

xk and yk are the true and observed log-transformed intensities at the kth voxel, respectively, and

k is the bias field at the kth voxel. If the gain field is known, then it is relatively easy to estimate the

tissue class by applying a conventional intensity-based segmentation to the corrected data. The following

discussion is based the model of (2) and estimation of the gain field k . 2.2 Modified FCM algorithm(M-FCM) In the followings, we will introduce some modifications to this algorithm. The evaluation of the method for localized measurements, such as the impact on tumor boundary or volume determinations also needs further work.

Jm =

i =1

uikp P yk k vi P2 + uikp (

k =1 i =1 k =1

y rN k

w( yk , yr ) || yr r vi ||2 )

(3)

Where

yr N k

w( yk , yr ) = , 0 < 1 , k {1, 2, , N } w( yk , yr ) =

especially, when

ui ,k ,vi , k

min J m

(4)

The objective function can be calculated as the BCFCM algorithm. Taking the first derivatives of

Jm

with respect to

uik , vi , k , and setting them to zero results in three necessary but not sufficient

conditions for J m to be at a local maximum. In the following sections, we derive these estimating results and propose the algorithm.. A. Membership Evaluation

* uik =

1 D + j =1 Dik + ik ij ij

c

1/( p 1)

(5)

where

v =

* i

N k =1

p uki ( yk k ) + y N w( yk , yr )( yr r )

r k

k =1 ukip (1 + y N w( yk , yr ))

N

r k

(6)

C. Bias-Field Estimation

= yk

* k

i =1 i c i =1

p p v uik + y N w( yk , yr )uir

p p uik + y N w( yk , yr )uir

r k

(7)

w( yk , yr ) 0 and

yr N k

E. M-FCM Algorithm

The M-FCM algorithm for correcting the bias field and segmenting the image into different clusters can be summarized in the following steps. Step 1: Select the Weighting function, in general,

w( yk yr ) = e

where

yk yr

(8)

0 < 1, 1 ;

c

vi = log(255* (2i 1)

2c

c i =1

Set

Step 3: Update the partition matrix using (5). Step 4: The prototypes of the clusters are obtained in the form of weighted averages of the patterns using (6). Step 5: Estimate the bias term using (7). Repeat Steps 3)5) till termination. The termination criterion is as follows:

where

(9)

is the Euclidean norm, V is a vector of cluster centers, and is a small number that can

3. Results In this section, we describe the application of the M-FCM segmentation on synthetic images corrupted with multiplicative gain and real T1 brain MR images. For compared with the BCFCM algorithm, we created the simulating image used by Ahmed[10]. Simulating image is a T1-weighted phantom with in-plane high resolution, Gaussian noise with 6.0, and three-dimensional linear shading 7% in each direction[2]. There are many advantages for using digital phantoms rather than real image including in prior knowledge of the true tissue types and control over image parameters such as mean intensity values, noise and intensity inhomogeneities. We also employed the fast algorithm[12] for improving calculational effect , because its consumed time is 1/4 of the traditional algorithm. For compare our new method with BCFCM [10] with low SNR images, according to the reference, the parameters (the neighbors effect) for BCFCM are 0.85, 2, 9 (a 3 X 3 window centered around each pixel) and 0.01. Fig. 1 display the simulating image (a) and the segmentation results. It is difficult to correct using standard FCM approaches in Fig. 1(b). while the BCFCM and M-FCM algorithms have succeeded in correcting and classifying WM from the image as shown in Fig. 1(c) and (d) (

=0 9 = .0 ,

1 5 .2

). The both estimated the bias fields and received the similar results, but M-

FCM outperformed beyond the BCFCM. We employed the true ratio (TR) to evaluate the differences.

(a)

(b)

(c)

(d)

Fig. 1. Comparison of segmentation results on simulated T1 MR image (a) Original image, (b) FCM, (c) BCFCM, and (d) M-FCM.

TR (A ) =

(10)

Where the TR is the percent of divided segmentation umbers of WM pixels by number of original all the WM pixels. Table 1 display TR that can explain the performance of those algorithms with different noise level.

Table 1: Segmentation accuracy-TR of different methods with different noise for simulated image TR FCM BCFCM M-FCM none 89.24 96.76 98.20 5db 85.46 91.10 96.23 SNR 10db 79.30 84.32 91.57 13db 75.46 82.10 90.46

The none column is without noise. The FCM, BCFCM and M-FCM are 89.24%, 96.76% and 98.20% respectively. In addition, the M-FCM is more robust for noise, In table 1, other columns except none can explain this point.

(a)

(b)

(c)

(d)

Fig. 2. Comparison of segmentation results on real brain MRI, T1 weighted image (a) Original image, (b) FCM, (c) BCFCM, and (d) M- FCM.

The real MRI image is T1-weighted MR images of human brains in the axial plane on a GE 1.5T scanner in the Navy General Hospital of PLA with image matrix size of 256 X 256 pixels, FOV of 20 cm, TR of 400 ms, and TE of 25 ms. Fig. 2 shown the clinical T1 MR Imaging , because of the space limit, we just show one image with segmentation results. The standard FCM is no good algorithm, both BCFCM and M-FCM are acceptable. But BCFCM is sensitive to noise and the result is also accompany with more noises. In the leaves of particular branches, the M-FCM is better. In addition, we segmented 32 T1 brain MR images using BCFCM and M-FCM respectively, then we invited the experts to select better one from every image. There are twenty nine images from thirty two better images are our results of M-FCM algorithm. Although the conclusion is personality, M-FCM is better algorithm.

4. Conclusion and discussion In this paper, we have described an unsupervised fuzzy segmentation method, based on new objective function, which seems well adapted and efficient for functional MRI data segmentation. The proposed segmentation method is more robust than the FCM algorithm and BCFCM. When the real data are fuzzy, such as functional MRI brain data, the use of M-FCM segmentation is always more effective than the use of the other one. Further quantitative validation on more accuracy and stability of the method is still necessary, using realistic phantoms and a large number of clinical scans. The results presented in this paper are preliminary and further clinical evaluation is required. There are also need new methods for preprocessing the original image, including denoising and enhancing to increase the SNR. How to combine segmenting with preprocessing procedure is our work in future.

References :

connectivity: statistical fibre tracking and virtual dissection, NeuroImage,

2003,19:545-554 2. A. F. Goldszal, C. Davatzikos, D. L. Pham, M. X. H. Yan, et al, An image processing system for qualitative and quantitative volumetric analysis of brain images, J. Comput. Assist. Tomogra., 1998,22(5): 827837 3. M.C. Davidson, K. M. Thomas. and B. J. Casey, Imaging the developing brain with fMRI, Mental Retardation and developmental disabilities research reviews, 2003,9 :161-165. 4. V. A. Grau, U. J. Mewes, M. Alcaniz, Improved watershed transform for medical image segmentation using prior information, IEEE Trans. on Medical Imaging, 2004, 23(4): 447-458 5. H Lv., K. H. Yuan, S. L. Bao, An eSnake model for medical imaging segmentation, Progress in Natural Science, 2005, 15(5), 424-429. 6. D. L. Pham and J. L. Prince, Adaptive fuzzy segmentation of magnetic resonance images, IEEE Trans. Med. Imag., 1999, 18: 737752 A. F. Goldszal, C. Davatzikos, D. L. Pham, M. X. H. Yan, et al, An image processing system for qualitative and quantitative volumetric analysis of brain images, J. Comput. Assist. Tomogra., 1998,22(5): 827837. 7. Arnold J.B., Liow, J.-S., Schaper, K.A., et al., Qualitative and quantitative evaluation of six algorithms for correcting intensity nonuniformity effects. NeuroImage, 2001,13:931. 8. R. Moller., R. Zeipelt. Automatic segmentation of 3D-MRI data using a genetic algorithmMedical Imaging and Augmented Reality, 2001. Proceedings. International Workshop on, 10-12 June 2001:278 281. 9. W. M.Wells, III,W. E. L. Grimson, R. Kikinis. Adaptive segmentation of MRI data, IEEE Trans. Medical Imaging , 1996, 15:429442. 10. M. N. Ahmed, S. M. Yamany, A Modified Fuzzy C-Means Algorithm for Bias Field Estimation and Segmentation of MRI Data, IEEE Trans. On Medical Imaging, 2002, 21(3):193-199. 11. J. C. Bezdek, and S. K. Pal, Fuzzy Models for Pattern Recognition, New York: IEEE Press, 1992. 12. L. Szilagri, Z. Benyo, S.M. Szilagyi, et al MR Brain Image Segmentation Using an Enhanced Fuzzy C-Means Algorithm , Proceedings of the 25th ,Annual International Conference of the IEEE EMBS, Cancun, Mexico, Sep.17-21, 2003:724-726.

- Writing Problem and Hypothesis Statements for Medical Research(2)Uploaded by柯泰德 (Ted Knoy)
- Probabilistic Neural Network Assisted Cell Tracking and ClassificationUploaded byIRJET Journal
- Paper Icpram 2016Uploaded byaitaoudia
- Medical Image Segmentation Using Image Mining ConceptsUploaded byIJMTER
- Caillette Phd ThesisUploaded byMuhammet Pakyürek
- 0511_Reynolds1Uploaded byAlbertina Diana
- 10.1.1.83Uploaded byMegha Nair
- IJERD (www.ijerd.com) International Journal of Engineering Research and Development IJERD : hard copy of journal, Call for Papers 2012, publishing of journal, journal of science and technology, research paper publishing, where to publish research paper, journal publishing, how to publish research paper, Call For research paper, international journal, publishing a paper, how to get a research paper published, publishing a paper, publishing of research paper, reserach and review articles, IJERD Journal, How to publish your research paper, publish research paper, open access engineering journal, Engineering journal, Mathemetics journal, Physics journal, Chemistry journal, Computer Engineering, how to submit your paper, peer review journal, indexed journal, reserach and review articles, engineering journal, www.ijerd.com, research journals, yahoo journals, bing journals, International Journal of Engineering Research and Development, google journals, journal of engineering, online SubmisUploaded byIJERD
- another paper.pdfUploaded byKranthirekha Chennaboina
- 05647676Uploaded bySaurabh Sharma
- maddydavisonscientistinterviewUploaded byapi-242544199
- Superiority of Graph Based Visual Saliency Gvs Over Other Image Segmentation MethodsUploaded byIJSTR Research Publication
- Li - Rhythmic Brushstrokes for Van Gogh Distinguish - PAMI - 2011Uploaded byouifou
- Image Proc_Term Paper ReportUploaded byArun Dixit
- Articulo de Segmentacion de FotosUploaded bysunpit
- Basic principles of MRIUploaded byAinun Nur Arifah
- [6]_Image Description and RepresentationUploaded byTrieuPhan
- ijcttjournal-v1i2p20Uploaded bysurendiran123
- [RGBD] Navigation Assistance for the Visually Impaired Using RGB-D Sensor With Range ExpansionUploaded byAhmad Nizam
- Scott ActonUploaded byAbhishek Pandey
- Gab OrUploaded byfreddy_d85
- KnowledgeUploaded bykeerthana1234
- LINK MINING PROCESSUploaded byLewis Torres
- Abstract ResearchUploaded byKharis Mochammad Nur
- Artificial Neural Network Based Cancer Cell ClassificationUploaded byAlexander Decker
- tumor boards 121614Uploaded byapi-276410902
- Tortuasity by DiffusionUploaded byShamsUlislam
- jospt%2E2013%2E4523Uploaded bykevin0631
- 10.1.1.640.6787.pdfUploaded byRadhia Saidane
- central nervous system lymphomaUploaded byapi-375618177

- Business Logistics-Importance and Some Research Opportunities.Uploaded byAmay Eksac Rahmi Fadhila
- WekaUploaded byvaibhav solanki
- IJESAT_2012_02_SI_01_12Uploaded byIjesat Journal
- CiteSpacePracticalGuide Nova Sample1 50ppUploaded byShakil Ahmad Khan
- DBSCANUploaded bynilabjyaghosh
- Group purchasing organization design: a clustering approachUploaded byArcane_Cowboy
- Machine Learning With SparkUploaded byGeorgeSidiras
- List of Selected Papers for the PublicationUploaded bySrinivas Bodapati
- a Network Intrusion Detection Model Based on K-means Algorithm and Information EntropyUploaded byAndi Muhammad Nurhidayat
- Temporal Data Clustering using weighted aggregate functionUploaded byijsret
- Uncertain Information Fusion in Active Object RecognitionUploaded byq23487
- Survey of Clustering Based Detection using IDS TechniqueUploaded byIRJET Journal
- Improved Clustering using Hierarchical ApproachUploaded byseventhsensegroup
- Integrated Data Tracker Using Tree-View AnalysisUploaded byInternational Journal of Innovative Science and Research Technology
- What is Apache Mahout.pdfUploaded byshivabhairavm
- CPEE Big Data Analytics and Optimization CurriculumUploaded byKaushik Madaka
- Multi JerarquicoUploaded byCesario Gillas
- Temporal Data Clustering ViaUploaded byAarthi Janakiraman
- A Hybrid Neural Network Model for Noisy Data RegressionUploaded byAinaa Aliah
- Concept Factorization With Adaptive Neighbors for Document ClusteringUploaded byLeMenizInfotech
- Word Sense Disambiguation - FINAL by Workineh Tesema GudisaUploaded bysenaa
- A Review on Time Series Data MiningUploaded byTri Kurniawan Wijaya
- b 0992073213Uploaded bysaman
- Spss Base User's Guide 12.0Uploaded bySheepCat
- (Monographs on Statistics and Applied Probability 113) Lang Wu-Mixed Effects Models for Complex Data-CRC Press (2010)Uploaded byJeferson Martins
- Grays OnUploaded byPrithiShiya
- Finding Motif Sets in Time Series.pdfUploaded bylerhlerh
- Mining of Massive DatasetsUploaded byshnugy
- Hybridization Between Iterative Simulated Annealing and Modified Great Deluge for Medical Clustering ProblemsUploaded byWorld of Computer Science and Information Technology Journal
- Check All That Apply CATAUploaded byFernanda0518