4D Cone-beam CT reconstruction using a motion model based on principal component analysis.
4D Cone-beam CT reconstruction using a motion model based on principal component analysis.
复制标题
使用基于主成分分析的运动模型进行 4D 锥束 CT 重建。
DOI:
10.1118/1.3662895
复制
发表时间:
2011
期刊:
影响因子:
3.8
通讯作者:
Murphy,MartinJ
中科院分区:
文献类型:
--
作者:
Staub,David;Docef,Alen;Brock,RobertS;Vaman,Constantin;Murphy,MartinJ
PurposeTo provide a proof of concept validation of a novel 4D cone‐beam CT (4DCBCT) reconstruction algorithm and to determine the best methods to train and optimize the algorithm.MethodsThe algorithm animates a patient fan‐beam CT (FBCT) with a patient specific parametric motion model in order to generate a time series of deformed CTs (the reconstructed 4DCBCT) that track the motion of the patient anatomy on a voxel by voxel scale. The motion model is constrained by requiring that projections cast through the deformed CT time series match the projections of the raw patient 4DCBCT. The motion model uses a basis of eigenvectors that are generated via principal component analysis (PCA) of a training set of displacement vector fields (DVFs) that approximate patient motion. The eigenvectors are weighted by a parameterized function of the patient breathing trace recorded during 4DCBCT. The algorithm is demonstrated and tested via numerical simulation.ResultsThe algorithm is shown to produce accurate reconstruction results for the most complicated simulated motion, in which voxels move with a pseudo‐periodic pattern and relative phase shifts exist between voxels. The tests show that principal component eigenvectors trained on DVFs from a novel 2D/3D registration method give substantially better results than eigenvectors trained on DVFs obtained by conventionally registering 4DCBCT phases reconstructed via filtered backprojection.ConclusionsProof of concept testing has validated the 4DCBCT reconstruction approach for the types of simulated data considered. In addition, the authors found the 2D/3D registration approach to be our best choice for generating the DVF training set, and the Nelder‐Mead simplex algorithm the most robust optimization routine.