Brain tissue segmentation in MR images based on a hybrid of MRF and social algorithms

详细信息	查看全文 | 推荐本文 |

• 作者：Sahar Yousefi^a ; ^{sahar_yousefi@ymail.com} ; Reza Azmi^b ; ^{azmi@alzahra.ac.ir} ; Morteza Zahedi^a ; ^{zahedi@shahroodut.ac.ir}
• 关键词：Magnetic resonance image (MRI) ; Brain segmentation ; Markov random field (MRF) ; Ant colony optimization (ACO) ; Gossiping algorithm
• 刊名：Medical Image Analysis
• 出版年：2012
• 期刊代码：90_13618415
• 类别：cp
• 出版时间：May, 2012
• 卷：16
• 期：4
• 页码：840-848
• 文件大小：1248 K

摘要

Effective abnormality detection and diagnosis in Magnetic Resonance Images (MRIs) requires a robust segmentation strategy. Since manual segmentation is a time-consuming task which engages valuable human resources, automatic MRI segmentations received an enormous amount of attention. For this goal, various techniques have been applied. However, Markov Random Field (MRF) based algorithms have produced reasonable results in noisy images compared to other methods. MRF seeks a label field which minimizes an energy function. The traditional minimization method, simulated annealing (SA), uses Monte Carlo simulation to access the minimum solution with heavy computation burden. For this reason, MRFs are rarely used in real time processing environments. This paper proposed a novel method based on MRF and a hybrid of social algorithms that contain an ant colony optimization (ACO) and a Gossiping algorithm which can be used for segmenting single and multispectral MRIs in real time environments. Combining ACO with the Gossiping algorithm helps find the better path using neighborhood information. Therefore, this interaction causes the algorithm to converge to an optimum solution faster. Several experiments on phantom and real images were performed. Results indicate that the proposed algorithm outperforms the traditional MRF and hybrid of MRF-ACO in speed and accuracy.