期刊文献+

基于级联随机森林与活动轮廓的3D MR图像分割 被引量:8

Combining Concatenated Random Forests and Active Contour for the 3D MR Images Segmentation
下载PDF
导出
摘要 针对医学磁共振(Magnetic resonance, MR)图像三维分割中随机森林(Random forest, RF)方法难以获得具有几何约束的结果以及活动轮廓模型(Active contour model, ACM)不能自动分割发生信号混叠的组织结构的问题,提出了一种整合了级联随机森林与活动轮廓模型的磁共振图像三维分割方法.该方法首先从多模态磁共振体数据中提取图像多尺度局部鲁棒统计信息,以此驱动级联随机森林对磁共振图像进行迭代的体素分类,从而获得对组织结构的初步分割结果,进一步将此结果作为初始轮廓与形状先验,整合进一个尺度可调的活动轮廓模型中,将独立的体素分类转化为轮廓曲线演化,最终得到具有几何约束的精确分割结果.在公开数据集上的实验结果表明,本文的自动化分割方法在分割精度和鲁棒性等方面,相比其他同类方法具有较大的性能提升. Since it is difficult for the random forest(RF) method to achieve geometrically constrained result and the active contour model(ACM) can not segment tissue structures with overlapped signals automatically, when segmenting medical magnetic resonance(MR) images in three dimensions, a combined concatenated random forests and active contour model approach is proposed in this work for the 3D segmentation of medical magnetic resonance images. The multiscale local robust statistics image information is extracted from the multimodal magnetic resonance volumetric data, and then is used to drive the random forest to perform voxel classification iteratively. As a consequence, the initial segmentation result for the tissue structure is achieved. Furthermore, the initial result is integrated into a scale scalable active contour model as the initial contour and shape prior. In this way, the independent voxel classification is reformulated as contour evolution, and the final accurate and geometrically constrained segmentation result is achieved. Experimental results on publicly available datasets demonstrate that, compared to several related methods, the proposed automated segmentation method has considerable improvement in terms of segmentation accuracy and robustness.
作者 马超 刘亚淑 骆功宁 王宽全 MA Chao;LIU Ya-Shu;LUO Gong-Ning;WANG Kuan-Quan(School of Computer Science and Technology, Harbin Institute of Technology, Harbin 150001;College of Engineeringand Technology, Northeast Forestry University, Harbin 150040)
出处 《自动化学报》 EI CSCD 北大核心 2019年第5期1004-1014,共11页 Acta Automatica Sinica
基金 国家自然科学基金(61571165)资助~~
关键词 医学图像分割 随机森林 活动轮廓模型 三维分割 形状先验 Medical image segmentation random forest(RF) active contour model 3D segmentation shape prior
  • 相关文献

参考文献2

二级参考文献40

  • 1Jayadevappa D, Kumar S S, Murty D S. Medical image segmentation algorithms using deformable models: a review. IETE Technical Review, 2011, 28(3): 248-255.
  • 2Caselles V, Kimmel R, Sapiro G. Geodesic active contours. In: Proceedings of the 1995 International Conference on Computer Vision. Massachusetts, USA: IEEE, 1995. 694-699.
  • 3Caselles V, Kimmel R, Sapiro G. Geodesic active contours. International Journal of Computer Vision, 1997, 22(1): 61-79.
  • 4Li C M, Xu C Y, Gui C F, Fox M D. Level set evolution without re-initialization: a new variational formulation. In: Proceedings of the 2005 IEEE Conference on Computer Vision and Pattern Recognition. San Diego, USA: IEEE, 2005. 430 - 436.
  • 5Zhu G P, Zhang S Q, Zeng Q S, Wang C H. Boundary-based image segmentation using binary level set method. Optical Engineering, 2007, 46(5): 0505011-0505013.
  • 6Li C M, Xu C Y, Gui C F, Fox M D. Distance regularized level set evolution and its application to image segmentation. IEEE Transactions on Image Processing, 2010, 19(12): 3243-3254.
  • 7Mumford D, Shah J. Optimal approximations by piecewise smooth functions and associated variational problems. Communications on Pure and Applied Mathematics, 1989, 42(5): 577-685.
  • 8Chan T F, Vese L A. Active contours without edges. IEEE Transactions on Image Processing, 2001, 10(2): 266-277.
  • 9Vese L A, Chan T F. A multiphase level set framework for image segmentation using the Mumford and Shah model. International Journal of Computer Vision, 2002, 50(3): 271-293.
  • 10Lie J, Lysaker M, Tai X C. A binary level set model and some applications to Mumford-Shah image segmenta- tion. IEEE Transactions on Image Processing, 2006, 15(5): 1171-1181.

共引文献33

同被引文献83

引证文献8

二级引证文献27

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部