|
|
|
| Left Ventricle MRI Image Segmentation by Unifying Statistic Model and Curves Evolving |
| ZHOU ZeMing1,2,CHEN Qiang2, Pheng Ann Heng3 , XIA DeShen2 |
1.Meteorology College, PLA University of Science and Technology, Nanjing 211101
2.Department of Computer, Nanjing University of Science and Technology, Nanjing 210094
3.Department of Computer Science and Engineering, Chinese University of HongKong, HongKong |
|
|
|
|
Abstract An MRI image segmentation algorithm is proposed by unifying region statistic model and image gradient information. Due to cardiac deformation and blood flowing, weak edges, local gradient maximum regions and artifacts often can be found in the MRI images. The level set method which constructs stopping term with image gradient intensity cannot segment those cardiac MRI images accurately. A twostage algorithm is thus proposed to address the difficulties. Firstly, incorporating prior knowledge about the cardiac MRI and the image histogram, the populations of pixels are given. The prior probabilities of those classes and the parameters of the Gaussian distributions are estimated with Maximumlikelihood principle. With the posterior probability of pixel belonging to ROI, the velocity function of level set is constructed to search for the rough boundary of ROI. Next, another velocity function based on the gradient vector flow is designed to locate the edges accurately. The experimental results demonstrate the effectiveness of the segmentation algorithm.
|
|
Received: 05 October 2004
|
|
|
|
|
|
[1] Lin Y, Tian J. A Review on Segmentation Methods of Medical Images. Pattern Recognition and Artificial Intelligence, 2002, 15(2):192-204 (in Chinese)
(林 瑶,田 捷.医学图像分割方法综述.模式识别与人工智能, 2002, 15(2): 192-204)
[2]Kass M, Witkin A, Terzopoulos D. Snake: Active Contour Models. International Journal of Computer Vision, 1988, 1(4): 321-331
[3]Osher S, Sethian J A. Fronts Propagating with Curvature Dependent Speed: Algorithms Based on the Hamilton-Jacobi Formulations. Journal of Computational Physics, 1988, 79(1): 12-49
[4]Paragios N, Deriche R. Coupled Geodesic Active Regions for Image Segmentation: A Level Set Approach. In: Proc of the 6th European Conference on Computer Vision. Dublin, Ireland, 2000, Ⅱ: 224-240
[5] Caselles V, Kimmel R, Sapiro G. Geodesic Active Contours. International Journal of Computer Vision, 1997, 22 (1): 61-79
[6] Malladi R, Sethian J A, Vemuri B C. Shape Modeling with Front Propagation: A Level Set Approach. IEEE Trans on Pattern Analysis and Machine Intelligence, 1995, 17(2): 158-175
[7]Wang Z, Yang X, Li J, Shi P F. An Interactive Model for Segmentation of Medical Image. Pattern Recognition and Artificial Intelligence, 2002, 15(4): 392-396 (in Chinese)
(王 峥,杨 新,李 俊,施鹏飞.基于水平集人机交互模型的医学图像分割.模式识别与人工智能,2002,15(4): 392-396)
[8]Deng J W, Tsui H T. A Fast Level Set Method for Segmentation of Low Contrast Noisy Biomedical Images. Pattern Recognition Letters, 2002, 23(1-3): 161-169
[9]Suri J S. Leaking Prevention in Fast Level Sets Using Fuzzy Models: An Application in MR Brain. In: Proc of the International Conference on Information Technology and Applications in Biomedicine. Arlington, USA, 2000, 220-225
[10] Zhu F P , Tian J, et al. Medical Image Segmentation Based on Level Set Method. Journal of Software, 2002, 13(9): 1866-1871 (in Chinese)
(朱付平,田 捷,等.基于Level Set方法的医学图像分割.软件学报, 2002,13(9): 1866-1871)
[11] Sethian J A. Level Set Methods: Evolving Interfaces in Geometry, Fluid Mechanics, Computer Vision and Materials Sciences. Cambridge, UK: Cambridge University Press, 1996
[12] Moon T K. The Expectation Maximization Algorithm. IEEE Signal Processing Magazine, 1996, 13(6): 47-60
[13] Xu C, Prince J L. Snakes, Shapes and Gradient Vector Flow. IEEE Trans on Image Processing, 1998, 7(3): 359-369
[14] Adalsteinsson D, Sethian J A. A Fast Level Set Method for Propagating Interfaces. Journal of Computational Physics, 1995, 118(2): 269-277
[15] Adalsteinsson D, Sethian J A. The Fast Construction of Extension Velocities in Level Set Methods. Journal of Computational Physics, 1999,148 (1): 2-22
[16] Tsai Y H R. Rapid and Accurate Computation of the Distance Function Using Grids. Journal of Computational Physics, 2002, 178(1): 175-195 |
|
|
|
2006, Vol. 19 
