Mathematical Sciences, Susquehanna University, Selinsgrove, PA 17870, USA.
Med Image Anal. 2011 Feb;15(1):133-54. doi: 10.1016/j.media.2010.08.005. Epub 2010 Sep 21.
Accurate segmentation of a pulmonary nodule is an important and active area of research in medical image processing. Although many algorithms have been reported in literature for this problem, those that are applicable to various density types have not been available until recently. In this paper, we propose a new algorithm that is applicable to solid, non-solid and part-solid types and solitary, vascularized, and juxtapleural types. First, the algorithm separates lung parenchyma and radiographically denser anatomical structures with coupled competition and diffusion processes. The technique tends to derive a spatially more homogeneous foreground map than an adaptive thresholding based method. Second, it locates the core of a nodule in a manner that is applicable to juxtapleural types using a transformation applied on the Euclidean distance transform of the foreground. Third, it detaches the nodule from attached structures by a region growing on the Euclidean distance map followed by a procedure to delineate the surface of the nodule based on the patterns of the region growing and distance maps. Finally, convex hull of the nodule surface intersected with the foreground constitutes the final segmentation. The performance of the technique is evaluated with two Lung Imaging Database Consortium (LIDC) data sets with 23 and 82 nodules each, and another data set with 820 nodules with manual diameter measurements. The experiments show that the algorithm is highly reliable in segmenting nodules of various types in a computationally efficient manner.
肺结节的精确分割是医学图像处理中一个重要且活跃的研究领域。尽管文献中已经报道了许多针对该问题的算法,但直到最近才出现适用于各种密度类型的算法。在本文中,我们提出了一种新的算法,该算法适用于实性、非实性和部分实性以及孤立性、血管性和贴壁性结节类型。首先,该算法通过耦合竞争和扩散过程将肺实质与放射密度较高的解剖结构分开。与基于自适应阈值的方法相比,该技术往往会得出空间上更均匀的前景图。其次,它使用在前景的欧几里得距离变换上应用的变换以适用于贴壁性结节的方式定位结节的核心。第三,通过在欧几里得距离图上进行区域生长,然后根据区域生长和距离图的模式来描绘结节的表面,从而将结节与附着结构分离。最后,结节表面的凸包与前景相交构成最终的分割。该技术的性能通过三个数据集进行评估:两个 Lung Imaging Database Consortium (LIDC) 数据集,每个数据集包含 23 和 82 个结节,以及另一个包含 820 个结节且具有手动直径测量的数据集。实验表明,该算法在以计算高效的方式分割各种类型的结节方面具有高度可靠性。