Pu Jiantao, Roos Justus, Yi Chin A, Napel Sandy, Rubin Geoffrey D, Paik David S
Department of Radiology, Stanford University, United States.
Comput Med Imaging Graph. 2008 Sep;32(6):452-62. doi: 10.1016/j.compmedimag.2008.04.005. Epub 2008 Jun 2.
Segmentation of the lungs in chest-computed tomography (CT) is often performed as a preprocessing step in lung imaging. This task is complicated especially in presence of disease. This paper presents a lung segmentation algorithm called adaptive border marching (ABM). Its novelty lies in the fact that it smoothes the lung border in a geometric way and can be used to reliably include juxtapleural nodules while minimizing oversegmentation of adjacent regions such as the abdomen and mediastinum. Our experiments using 20 datasets demonstrate that this computational geometry algorithm can re-include all juxtapleural nodules and achieve an average oversegmentation ratio of 0.43% and an average under-segmentation ratio of 1.63% relative to an expert determined reference standard. The segmentation time of a typical case is under 1min on a typical PC. As compared to other available methods, ABM is more robust, more efficient and more straightforward to implement, and once the chest CT images are input, there is no further interaction needed from users. The clinical impact of this method is in potentially avoiding false negative CAD findings due to juxtapleural nodules and improving volumetry and doubling time accuracy.
在胸部计算机断层扫描(CT)中,肺部分割通常作为肺部成像的预处理步骤来执行。这项任务尤其在存在疾病的情况下会变得复杂。本文提出了一种名为自适应边界行进(ABM)的肺部分割算法。其新颖之处在于它以几何方式平滑肺部边界,并且可用于可靠地纳入胸膜旁结节,同时将腹部和纵隔等相邻区域的过分割最小化。我们使用20个数据集进行的实验表明,相对于专家确定的参考标准,这种计算几何算法能够重新纳入所有胸膜旁结节,平均过分割率为0.43%,平均欠分割率为1.63%。在典型的个人电脑上,一个典型病例的分割时间不到1分钟。与其他现有方法相比,ABM更稳健、更高效且更易于实现,一旦输入胸部CT图像,就无需用户进一步交互。该方法的临床影响在于有可能避免因胸膜旁结节导致的CAD假阴性结果,并提高容积测量和倍增时间的准确性。