A fast interactive segmentation algorithm of image-sequences based on relative fuzzy connectedness is presented. In comparison with the original algorithm, the proposed one, with the same accuracy, accelerates the seg...A fast interactive segmentation algorithm of image-sequences based on relative fuzzy connectedness is presented. In comparison with the original algorithm, the proposed one, with the same accuracy, accelerates the segmentation speed by three times for single image. Meanwhile, this fast segmentation algorithm is extended from single object to multiple objects and from single-image to image-sequences. Thus the segmentation of multiple objects from complex hackground and batch segmentation of image-sequences can be achieved. In addition, a post-processing scheme is incorporated in this algorithm, which extracts smooth edge with one-pixel-width for each segmented object. The experimental results illustrate that the proposed algorithm can obtain the object regions of interest from medical image or image-sequences as well as man-made images quickly and reliably with only a little interaction.展开更多
Convolutional neural networks(CNNs)are prone to mis-segmenting image data of the liver when the background is complicated,which results in low segmentation accuracy and unsuitable results for clinical use.To address t...Convolutional neural networks(CNNs)are prone to mis-segmenting image data of the liver when the background is complicated,which results in low segmentation accuracy and unsuitable results for clinical use.To address this shortcoming,an interactive liver segmentation algorithm based on geodesic distance and V-net is proposed.The three-dimensional segmentation network V-net adequately considers the characteristics of the spatial context information to segment liver medical images and obtain preliminary segmentation results.An artificial algorithm based on geodesic distance is used to form artificial hard constraints to modify the image,and the superpixel piece created by the watershed algorithm is introduced as a sample point for operation,which significantly improves the efficiency of segmentation.Results from simulation of the liver tumor segmentation challenge(LiTS)dataset show that this algorithm can effectively refine the results of automatic liver segmentation,reduce user intervention,and enable a fast,interactive liver image segmentation that is convenient for doctors.展开更多
提出一种基于改进双种群水母搜索(Improved Double Population Jellyfish Search,IDPJS)算法的多阈值图像分割法,以解决随着阈值数目的增加,传统的图像分割计算量呈指数级增长,分割时间消耗多的问题.首先,初始化两个水母种群P和P,执行...提出一种基于改进双种群水母搜索(Improved Double Population Jellyfish Search,IDPJS)算法的多阈值图像分割法,以解决随着阈值数目的增加,传统的图像分割计算量呈指数级增长,分割时间消耗多的问题.首先,初始化两个水母种群P和P,执行基本的JS算法.在P中引入组合变异策略,两个种群进行交流学习以提高算法的收敛速度.接着,对当前最好解采用动态反向学习策略,防止算法陷入局部最优.其次,利用CEC2017基准函数对所提IDPJS算法进行测试,并与5种启发式算法进行比较,实验结果显示,所提算法精度高、稳定性好.最后,将其用于多阈值图像分割问题,分别在阈值个数为5,7,9的情况下进行测试实验,实验表明,IDPJS算法是解决多阈值图像分割问题的有效方法.展开更多
文摘A fast interactive segmentation algorithm of image-sequences based on relative fuzzy connectedness is presented. In comparison with the original algorithm, the proposed one, with the same accuracy, accelerates the segmentation speed by three times for single image. Meanwhile, this fast segmentation algorithm is extended from single object to multiple objects and from single-image to image-sequences. Thus the segmentation of multiple objects from complex hackground and batch segmentation of image-sequences can be achieved. In addition, a post-processing scheme is incorporated in this algorithm, which extracts smooth edge with one-pixel-width for each segmented object. The experimental results illustrate that the proposed algorithm can obtain the object regions of interest from medical image or image-sequences as well as man-made images quickly and reliably with only a little interaction.
基金国家高技术研究发展计划( 863)( the National High- Tech Research and Development Plan of China under Grant No.2006AA02Z499)兰州交通大学校科研基金( the Science Research Foundation of Lanzhou Jiaotong Uiversity)
基金the Project of China Scholarship Council(No.201708615011)the Xi’an Science and Technology Plan Project(No.GXYD1.7)。
文摘Convolutional neural networks(CNNs)are prone to mis-segmenting image data of the liver when the background is complicated,which results in low segmentation accuracy and unsuitable results for clinical use.To address this shortcoming,an interactive liver segmentation algorithm based on geodesic distance and V-net is proposed.The three-dimensional segmentation network V-net adequately considers the characteristics of the spatial context information to segment liver medical images and obtain preliminary segmentation results.An artificial algorithm based on geodesic distance is used to form artificial hard constraints to modify the image,and the superpixel piece created by the watershed algorithm is introduced as a sample point for operation,which significantly improves the efficiency of segmentation.Results from simulation of the liver tumor segmentation challenge(LiTS)dataset show that this algorithm can effectively refine the results of automatic liver segmentation,reduce user intervention,and enable a fast,interactive liver image segmentation that is convenient for doctors.
文摘提出一种基于改进双种群水母搜索(Improved Double Population Jellyfish Search,IDPJS)算法的多阈值图像分割法,以解决随着阈值数目的增加,传统的图像分割计算量呈指数级增长,分割时间消耗多的问题.首先,初始化两个水母种群P和P,执行基本的JS算法.在P中引入组合变异策略,两个种群进行交流学习以提高算法的收敛速度.接着,对当前最好解采用动态反向学习策略,防止算法陷入局部最优.其次,利用CEC2017基准函数对所提IDPJS算法进行测试,并与5种启发式算法进行比较,实验结果显示,所提算法精度高、稳定性好.最后,将其用于多阈值图像分割问题,分别在阈值个数为5,7,9的情况下进行测试实验,实验表明,IDPJS算法是解决多阈值图像分割问题的有效方法.
