Department of Computer Science, Rensselaer Polytechnic Institute, Troy, NY 12180-3590, United States.
Med Image Anal. 2010 Jun;14(3):407-28. doi: 10.1016/j.media.2010.02.006. Epub 2010 Mar 15.
In the clinical workflow for lung cancer management, the comparison of nodules between CT scans from subsequent visits by a patient is necessary for timely classification of pulmonary nodules into benign and malignant and for analyzing nodule growth and response to therapy. The algorithm described in this paper takes (a) two temporally-separated CT scans, I(1) and I(2), and (b) a series of nodule locations in I(1), and for each location it produces an affine transformation that maps the locations and their immediate neighborhoods from I(1) to I(2). It does this without deformable registration and without initialization by global affine registration. Requiring the nodule locations to be specified in only one volume provides the clinician more flexibility in investigating the condition of the lung. The algorithm uses a combination of feature extraction, indexing, refinement, and decision processes. Together, these processes essentially "recognize" the neighborhoods. We show on lung CT scans that our technique works at near interactive speed and that the median alignment error of 134 nodules is 1.70mm compared to the error 2.14mm of the Diffeomorphic Demons algorithm, and to the error 3.57mm of the global nodule registration with local refinement. We demonstrate on the alignment of 250 nodules, that the algorithm is robust to changes caused by cancer progression and differences in breathing states, scanning procedures, and patient positioning. Our algorithm may be used both for diagnosis and treatment monitoring of lung cancer. Because of the generic design of the algorithm, it might also be used in other applications that require fast and accurate mapping of regions.
在肺癌管理的临床工作流程中,比较患者后续就诊时的 CT 扫描中的结节对于及时将肺结节分类为良性和恶性,以及分析结节生长和对治疗的反应是必要的。本文描述的算法采用 (a) 两次时间间隔的 CT 扫描,I(1) 和 I(2),以及 (b) I(1) 中的一系列结节位置,对于每个位置,它都会生成一个仿射变换,将位置及其直接邻域从 I(1)映射到 I(2)。它不需要变形配准,也不需要全局仿射配准初始化。要求结节位置仅在一个体积中指定,为临床医生提供了更多调查肺部状况的灵活性。该算法结合了特征提取、索引、细化和决策过程。这些过程共同“识别”邻域。我们在肺部 CT 扫描上表明,我们的技术可以在接近交互速度下工作,134 个结节的平均对齐误差为 1.70mm,与 Diffeomorphic Demons 算法的 2.14mm 误差相比,与具有局部细化的全局结节注册的 3.57mm 误差相比。我们在 250 个结节的对齐中证明,该算法对由癌症进展引起的变化以及呼吸状态、扫描程序和患者定位的差异具有鲁棒性。我们的算法可用于肺癌的诊断和治疗监测。由于算法的通用设计,它也可用于需要快速准确映射区域的其他应用。