Guo Xiaoxi, Huang Shaohui, Fu Xiaozhu, Wang Boliang, Huang Xiaoyang
Computer Science Department, Xiamen University, Xiamen, China.
Computer Engineering College, Jimei University, Xiamen, China.
Biomed Eng Online. 2015 Jun 19;14:57. doi: 10.1186/s12938-015-0055-z.
Fuzzy connectedness method has shown its effectiveness for fuzzy object extraction in recent years. However, two problems may occur when applying it to hepatic vessel segmentation task. One is the excessive computational cost, and the other is the difficulty of choosing a proper threshold value for final segmentation.
In this paper, an accelerated strategy based on a lookup table was presented first which can reduce the connectivity scene calculation time and achieve a speed-up factor of above 2. When the computing of the fuzzy connectedness relations is finished, a threshold is needed to generate the final result. Currently the threshold is preset by users. Since different thresholds may produce different outcomes, how to determine a proper threshold is crucial. According to our analysis of the hepatic vessel structure, a watershed-like method was used to find the optimal threshold. Meanwhile, by using Ostu algorithm to calculate the parameters for affinity relations and assigning the seed with the mean value, it is able to reduce the influence on the segmentation result caused by the location of the seed and enhance the robustness of fuzzy connectedness method.
Experiments based on four different datasets demonstrate the efficiency of the lookup table strategy. These experiments also show that an adaptive threshold found by watershed-like method can always generate correct segmentation results of hepatic vessels. Comparing to a refined region-growing algorithm that has been widely used for hepatic vessel segmentation, fuzzy connectedness method has advantages in detecting vascular edge and generating more than one vessel system through the weak connectivity of the vessel ends.
An improved algorithm based on fuzzy connectedness method is proposed. This algorithm has improved the performance of fuzzy connectedness method in hepatic vessel segmentation.
近年来,模糊连接度方法在模糊目标提取方面已显示出其有效性。然而,将其应用于肝血管分割任务时可能会出现两个问题。一个是计算成本过高,另一个是为最终分割选择合适阈值存在困难。
本文首先提出了一种基于查找表的加速策略,该策略可以减少连接场景计算时间,并实现2倍以上的加速因子。在完成模糊连接度关系的计算后,需要一个阈值来生成最终结果。目前该阈值由用户预先设定。由于不同的阈值可能产生不同的结果,如何确定合适的阈值至关重要。根据我们对肝血管结构的分析,采用了一种类似分水岭的方法来找到最优阈值。同时,通过使用Ostu算法计算亲和关系的参数并将种子点赋值为均值,能够减少种子点位置对分割结果的影响,并增强模糊连接度方法的鲁棒性。
基于四个不同数据集的实验证明了查找表策略的有效性。这些实验还表明,通过类似分水岭的方法找到的自适应阈值总能生成正确的肝血管分割结果。与广泛用于肝血管分割的改进区域生长算法相比,模糊连接度方法在检测血管边缘以及通过血管末端的弱连接生成多个血管系统方面具有优势。
提出了一种基于模糊连接度方法的改进算法。该算法提高了模糊连接度方法在肝血管分割中的性能。