Self-adapting cyclic registration for motion-compensated cone-beam CT in image-guided radiation therapy

摘要

Purpose: In image-guided radiation therapy an additional kV imaging system next to the linear particle accelerator provides information for an accurate patient positioning. However, the acquisition time of the system is much longer than the patients breathing cycle due to the low gantry rotation speed. Our purpose is a cyclic registration in the context of motion-compensated image reconstruction that provides high quality respiratory-correlated 4D volumes for on-board flat panel detector cone-beam CT scans. Methods: Based on the small motion assumption, widely used within registration algorithms, a strategy is developed for motion estimation. In this strategy temporal restrictions are incorporated, for example, the cyclic motion patterns of respiration. The resultant cyclic registration method is to show less sensitivity on image artifacts, in particular on artifacts due to projection data sparsification. Using a new cyclic registration method a motion estimation is performed on respiratory-correlated reconstructions, and the obtained motion vector fields are used for motion compensation. Results: The proposed cyclic registration is evaluated in the context of motion-compensated image reconstruction using simulated data and patient data. Motion artifacts of 3D standard reconstructions can be significantly reduced by the resulting cyclic motion compensation. The method outperforms the respiratory-correlated reconstructions regarding sparse-view artifacts and maintains the high temporal resolution at the same time. Image artifacts show only minor to almost no effect on the motion estimation using the cyclic registration. Conclusions: The cyclic motion compensation approach provides respiratory-correlated volumes with high image quality. The cyclic motion estimation is of such low sensitivity to sparse-view artifacts, that it is capable to determine high quality motion vector fields based on reconstructions of low sampled data.