期刊文献+

基于最优值搜索框架的CT序列图像肝脏分割 被引量:7

Liver Segmentation by Using an Optimal Framework for CT Images
下载PDF
导出
摘要 显式模型下建立的肝脏分割算法受适用条件的限制,不能有效地控制分割进程,制约了算法鲁棒性和泛化能力的提高.针对这一问题,该文提出了一个新的方法,将肝脏分割问题转化为隐式函数最优值搜索,依据图像实际数据和先验形状信息有效地控制分割进程,以迭代搜索策略得到肝脏的最优分割结果.每一个迭代步骤由两部分组成:首先,利用MRF(Markov Random Field)实现已有肝脏轮廓邻域的局部再分割,重新调整肝脏轮廓;然后,利用先验形状稀疏表示调整后的形状,有效地修正噪声、边界模糊等因素引起的错误分割,并将修正后的肝脏轮廓用于下一轮局部再分割.肝脏分割结果在迭代过程中不断逼近真实值.为了提高形状稀疏表示的计算精度和速度,该文改进了相关技术细节,提出了动态字典生成策略,并利用混合粒子群算法求解稀疏表示方程.与金标准相比,该文所提算法在边界模糊、对比度低、存在大量其他干扰组织区域等不利因素的情景中,其分割精度(Volume Overlap Percentage,VOE)可达到90%以上. Liver segmentation methods based on explicit model is restricted by many applying factors and can’t control the segmentation process in many cases,which limit the algorithm performance of the robustness and generalization.To this end,a novel method is proposed in this work,where the liver segmentation is transformed into the optimization of implicit function.In our work,the segmentation process is managed by image data and shape priors,and the optimal liver segmentation result is obtained through iteration steps.There are two parts for every iteration.Firstly,a new liver contour is gained by re-segmenting the liver within the neighbor of the contour points based on MRF.And then,for correcting the segmentation errors caused by edge fuzzy and noise,et al.,the new liver shape which is obtained in the previous step is adjusted by sparse shape representation based on shape priors.The revised liver contour is transferred into next iteration step.The liver segmentation get closed to the ground truth during the iteration process.Moreover,in order to improve the accuracy and speed of the sparse shape representation process,dynamic shape dictionary and HPSO (Hybrid Particle Swarm Optimization)are used fornbsp;sparse shape representation solution.Comparing with the Ground Truth,the segmentation accuracy (VOE,Volume Overlap Percentage)reaches as high as 90% under the interference of fuzzy edge,low-contrast,noisy,and other adverse factors.
出处 《计算机学报》 EI CSCD 北大核心 2016年第7期1477-1489,共13页 Chinese Journal of Computers
基金 国家自然科学基金(61201441 61471226) 山东省自然科学杰出青年基金(JQ201516)资助
关键词 肝脏分割 最优值搜索 稀疏表示 马尔可夫随机场 混合粒子群 liver segmentation optimization sparse representation Markov Random Field HPSO
  • 相关文献

参考文献10

二级参考文献96

  • 1李炳宇,萧蕴诗,吴启迪.一种基于粒子群算法求解约束优化问题的混合算法[J].控制与决策,2004,19(7):804-807. 被引量:48
  • 2李爱国.多粒子群协同优化算法[J].复旦学报(自然科学版),2004,43(5):923-925. 被引量:398
  • 3[1]Kennedy J,Eberhart R.Particle swarm optimization [ A ].Proceedings of the IEEE International Conference on Neural Networks[C].1995.1942~1948.
  • 4[2]Eberhart R,Kennedy J.A new optimizer using particle swarm theory [ A ].Proceedings of the 6th International Symposium on Micro Machine and Human Science [ C].1995.39~43.
  • 5[3]Reynolds C.Flocks,herds,and schools:a distributed behavioral model [ J].Computer Graphics,1987,21 (4):25~34.
  • 6[4]Nelder J A,Mead A.A simplex method for function minimization[J].Computer Journal,1965,7:308~313.
  • 7Zhang Y. Advances in Image and Video Segmentation. Her- shey, PA; IRM Press, 2006.
  • 8Osher S, Sethian J A. Fronts propagating with curvature- dependent speed: Algorithms based on Hamilton-Jacobi for- mulation. Journal of Computational Physics, 1988, 79 (1) : 12-49.
  • 9Osher S, Fedkiw R. Level Set Methods and Dynamics Im- plicit Surfaces. New York: Springer, 2003.
  • 10Kass M, Witkin A, Terzopoulos D. Snakes: Active contour models. International Journal of Computer Vision, 1988: 1(4): 321-331.

共引文献359

同被引文献37

引证文献7

二级引证文献42

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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