Segmentation of brain MR images through a hidden Markov random field model and the expectation-maximization algorithm

被引:5045
作者
Zhang, YY [1 ]
Brady, M
Smith, S
机构
[1] Univ Oxford, John Radcliffe Hosp, FMRIB Ctr, Oxford OX3 9DU, England
[2] Univ Oxford, Dept Engn Sci, Robot Res Grp, Oxford OX1 3PJ, England
基金
英国工程与自然科学研究理事会;
关键词
bias field correction expectation-maximization; hidden Markov random field; MRI; segmentation;
D O I
10.1109/42.906424
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
The finite mixture (FM) model is the most commonly used model for statistical segmentation of brain magnetic resonance (MR) images because of its simple mathematical form and the piecewise constant nature of ideal brain MR images. However, being a histogram-based model, the FM has an intrinsic limitation-no spatial information is taken into account. This causes the FM model to work only on well-defined images with low levels of noise; unfortunately, this is often not the the case due to artifacts such as partial volume effect and bias field distortion. Under these conditions, FM model-based methods produce unreliable results. In this paper, we propose a novel hidden Markov random held (HMRF) model, which is a stochastic process generated by a MRF whose state sequence cannot be observed directly but which can be indirectly estimated through observations. Mathematically, it can be shown that the FM model is a degenerate version of the HMRF model. The advantage of the HMRF model derives from the way in which the spatial information is encoded through the mutual influences of neighboring sites. Although MRF modeling has been employed in MR image segmentation by other researchers, most reported methods are limited to using MRF as a general prior in an FM model-based approach. To fit the HMRF model, an EM algorithm is used, We show that by incorporating both the HMRF model and the Ehl algorithm into a HMRF-EM framework, an accurate and robust segmentation can be achieved. More importantly, the HMRF-EM framework can easily be combined with other techniques. As an example, we show how the bias held correction algorithm of Guillemaud and Brady (1997) can be incorporated into this framework to achieve a three-dimensional fully automated approach for brain MR image segmentation.
引用
收藏
页码:45 / 57
页数:13
相关论文
共 21 条
[1]  
BESAG J, 1974, J ROY STAT SOC B MET, V36, P192
[2]  
BESAG J, 1986, J R STAT SOC B, V48, P259
[3]  
Bishop C. M., 1995, NEURAL NETWORKS PATT
[4]  
BRUMMER ME, 1992, P SOC PHOTO-OPT INS, V1808, P299, DOI 10.1117/12.131086
[5]   MAXIMUM LIKELIHOOD FROM INCOMPLETE DATA VIA EM ALGORITHM [J].
DEMPSTER, AP ;
LAIRD, NM ;
RUBIN, DB .
JOURNAL OF THE ROYAL STATISTICAL SOCIETY SERIES B-METHODOLOGICAL, 1977, 39 (01) :1-38
[6]   STOCHASTIC RELAXATION, GIBBS DISTRIBUTIONS, AND THE BAYESIAN RESTORATION OF IMAGES [J].
GEMAN, S ;
GEMAN, D .
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 1984, 6 (06) :721-741
[7]   Estimating the bias field of MR images [J].
Guillemaud, R ;
Brady, M .
IEEE TRANSACTIONS ON MEDICAL IMAGING, 1997, 16 (03) :238-251
[8]   Markov random field segmentation of brain MR images [J].
Held, K ;
Kops, ER ;
Krause, BJ ;
Wells, WM ;
Kikinis, R ;
Muller-Gartner, HW .
IEEE TRANSACTIONS ON MEDICAL IMAGING, 1997, 16 (06) :878-886
[9]  
KAPUR T, 1998, LECT NOTES COMPUTER, V1496, P148
[10]   RECOGNITION OF HANDWRITTEN WORD - 1ST AND 2ND ORDER HIDDEN MARKOV MODEL BASED APPROACH [J].
KUNDU, A ;
HE, Y ;
BAHL, P .
PATTERN RECOGNITION, 1989, 22 (03) :283-297