6533b7dafe1ef96bd126d8eb
RESEARCH PRODUCT
Hidden Markov random field model and Broyden–Fletcher–Goldfarb–Shanno algorithm for brain image segmentation
Dominique MichelucciEl-hachemi GuerroutSamy Ait-aoudiaRamdane Mahiousubject
Dice coefficient criterionComputer scienceBrain image segmentation02 engineering and technologyMR-images[INFO.INFO-AI]Computer Science [cs]/Artificial Intelligence [cs.AI]Theoretical Computer Science03 medical and health sciences0302 clinical medicineArtificial Intelligence0202 electrical engineering electronic engineering information engineering[INFO]Computer Science [cs]SegmentationBrain magnetic resonance imagingHidden Markov modelRandom fieldbusiness.industryBroyden-Fletcher-Goldfarb-Shanno algorithmPattern recognitionImage segmentationhidden Markov random fieldMinimization3. Good healthHomogeneousBroyden–Fletcher–Goldfarb–Shanno algorithm020201 artificial intelligence & image processingAutomatic segmentationArtificial intelligenceHidden Markov random fieldbusiness030217 neurology & neurosurgerySoftwaredescription
International audience; Many routine medical examinations produce images of patients suffering from various pathologies. With the huge number of medical images, the manual analysis and interpretation became a tedious task. Thus, automatic image segmentation became essential for diagnosis assistance. Segmentation consists in dividing the image into homogeneous and significant regions. We focus on hidden Markov random fields referred to as HMRF to model the problem of segmentation. This modelisation leads to a classical function minimisation problem. Broyden-Fletcher-Goldfarb-Shanno algorithm referred to as BFGS is one of the most powerful methods to solve unconstrained optimisation problem. In this paper, we investigate the combination of HMRF and BFGS algorithm to perform the segmentation operation. The proposed method shows very good segmentation results comparing with well-known approaches. The tests are conducted on brain magnetic resonance image databases (BrainWeb and IBSR) largely used to objectively confront the results obtained. The well-known Dice coefficient (DC) was used as similarity metric. The experimental results show that, in many cases, our proposed method approaches the perfect segmentation with a Dice Coefficient above .9. Moreover, it generally outperforms other methods in the tests conducted.
year | journal | country | edition | language |
---|---|---|---|---|
2018-05-28 | Journal of Experimental & Theoretical Artificial Intelligence |