Please use this identifier to cite or link to this item:
https://ptsldigital.ukm.my/jspui/handle/123456789/513202
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.advisor | Khairuddin Omar, Prof. Dr. | |
dc.contributor.author | Waleed Khamees Ali Alomoush (P56199) | |
dc.date.accessioned | 2023-10-16T04:34:41Z | - |
dc.date.available | 2023-10-16T04:34:41Z | - |
dc.date.issued | 2014-08-03 | |
dc.identifier.other | ukmvital:81998 | |
dc.identifier.uri | https://ptsldigital.ukm.my/jspui/handle/123456789/513202 | - |
dc.description | Fuzzy C-Mean (FCM) is a part of Fuzzy clustering algorithms which also falls under unsupervised machine learning. FCM has the advantages of considering the overlapping clusters since it is a common problem in MRI brain tumor images segmentation to determine normal and abnormal tissue. However, there are two main issues plague FCM algorithms: initialization sensitivity of cluster centres and an unknown number of actual clusters in a given dataset. Previous studies have considered metaheuristic-based clustering approach such as Firefly Algorithm (FA) because of its feasibility and practical searching solution. However, Firefly algorithm has some disadvantage such as getting trapped into local optima. Firefly algorithm parameters are set fixed and they do not change with the time. In addition Firefly algorithm has weaknesses on optimizing high-dimensional problems. Besides that, it does not memorize or remember history of situation for each firefly and this causes them to move regardless of its previous situation, and they may end up missing their situations. Next, the automatic MRI brain image segmenting is a difficult and complicated process due to pattern diversity in tumour tissue appearance, overlapping tissues and partial volume effects. First is to improve the performance of MRI brain image segmenting, the FA has been enhanced by introducing Firefly Photinus Algorithm (FPA). An FPA is proposed by initializing mate list and new absorption parameters to solve problems of trapped into local optima, remember history of situation, and change the parameters with the time. FPA is done simultaneously in order to produce significant partitioning of the given dataset. Here, FPA is evaluated and compared to FA using ten benchmark problems. The outcome shows that the proposed FPA outperformed FA. Secondly is to propose fuzzy clustering algorithms based on firefly photinus called (FPFCM) algorithm to solve challenges of selecting the initial cluster centers and compute the neighborhood term of per iteration. The proposed FPFCM have been evaluated by MRI brain images such as simulated data. The experimental results shows significant improvements compared to other state of the art approaches in the same domain. Thirdly, is to propose Dynamic FCM based on firefly photinus Algorithms called (DCFPA). Overall, DCFPA algorithm will give better performance in terms of accuracy by finding an optimal number of clusters and suitable location of cluster centroids. The proposed DCFPA have been evaluated by MRI brain images such as simulated, real brain data and synthetic images. The experimental results show significant improvements compared to other state of the art approaches in the same domain.,Ph.D | |
dc.language.iso | eng | |
dc.publisher | UKM, Bangi | |
dc.relation | Faculty of Information Science and Technology / Fakulti Teknologi dan Sains Maklumat | |
dc.rights | UKM | |
dc.subject | MRI brain tumor | |
dc.subject | Firefly algorithm | |
dc.subject | Image segmentation | |
dc.title | Dynamic fuzzy c-mean based firefly photinus search algorithm for MRI brain tumor image segmentation | |
dc.type | Theses | |
dc.format.pages | 174 | |
dc.identifier.callno | TA1638.4 .A466 2015 3 | |
dc.identifier.barcode | 001586 | |
Appears in Collections: | Faculty of Information Science and Technology / Fakulti Teknologi dan Sains Maklumat |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
ukmvital_81998+SOURCE1+SOURCE1.0.PDF Restricted Access | 3.1 MB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.