Research Article | Open Access
Ming Chen, Gang Li, Weiwei Qi, Jing Zou, Yong-guo Zheng, "Reconstruction Method for Nonconcyclic Dual-Source Circular Cone-Beam CT with a Large Field of View", Mathematical Problems in Engineering, vol. 2013, Article ID 526247, 7 pages, 2013. https://doi.org/10.1155/2013/526247
Reconstruction Method for Nonconcyclic Dual-Source Circular Cone-Beam CT with a Large Field of View
In industrial computed tomography (CT), it is often required to inspect large objects whose size is beyond a reconstructed field of view (FOV). Some multiscan modes have been developed to acquire the complete CT projection data for a larger object using small panel detectors. In this paper, we give a non-concyclic dual-source circular cone-beam scanning geometry based on the idea of multiscan modes and propose a backprojection-filtration-based (BPF) reconstruction algorithm without data rebinning. Since the FOV calculated according to this nonconcyclic dual-source circular CT scanning geometry is larger than cardiac dual-source CT scanning geometry, our method can reconstruct larger horizontal slices (i.e., the slices perpendicular to rotation axis) than cardiac dual-source CT. The quality of CT images is expected to be superior to those obtained using larger panel detectors. The simulation results have indicated that CT images obtained by the proposed method are satisfying.
In industrial CT, it is often required to inspect large objects whose size is beyond a field of view (FOV) calculated according to CT scanning geometry, where the maximum horizontal (i.e., perpendicular to rotation axis) FOV is usually fixed in CT system. When a slice of the inspected object cannot be completely covered within the FOV of the cone beam, complete projection data passing through the object cannot be obtained. However, conventional CT reconstruction algorithm, for example, filtered backprojection (FBP), requires the complete projection data. Therefore, those conventional scan modes and reconstruction methods can not be used. To solve this problem, several multiscan modes have been developed to acquire the complete projection data. Of them, the rotation-translation-translation (RTT) multiscan mode [1, 2] and rotation-translation (RT) multiscan mode [3, 4] are typical. In fact, RT and RTT multiscan modes not only acquire completed projection data, but can also reduce the differences of the flux intensities detected by different detector cells.
For fan-beam RT multiscan modes, the reconstruction algorithm based on backprojection- filtration (BPF) was proposed by Chen et al. [5, 6], which can exactly reconstruct the images and does not introduce data rebinning. BPF algorithm, as the basis of our work, was first proposed by Zou and Pan  to exactly reconstruct the images for helical cone beam CT. After that, an explicit BPF formula for 2D image reconstruction was proposed by Noo et al.  using the finite inversion formula of Hilbert transform.
In this work, we give a nonconcyclic dual-source circular cone beam scanning geometry based on the idea of RT multiscan scan mode and propose a BPF-based reconstruction formula. Since The FOV calculated according to this nonconcyclic dual-source circular CT scanning geometry is larger than cardiac dual-source CT scanning geometry, our method can reconstruct larger horizontal slices. The quality of CT images reconstructed is expected to be superior to those obtained using larger panel detectors. The simulation results have indicated that CT images obtained by the proposed algorithm are satisfying. Since we make use of the approximate idea of Feldkamp (FDK) algorithm  in reconstructing formula deduction, reconstruction images are satisfying for a small cone angle, which are usually better for static objects. For dynamic process, there are some results in [10, 11].
2. Nonconcyclic Dual-Source Circular Scan Mode with a Larger FOV
In this section, we give a nonconcyclic dual-source circular cone beam scan mode with a larger FOV based on RT dual-scan modes.
As shown in Figure 1, there are two pairs of X-ray sources and panel detectors. Let and denote the focuses of X-ray sources. Let and denote panel detectors. In the nonconcyclic dual-source circular scan mode, two pairs of X-ray sources and panel detectors are fixed, and the inspected object is placed on the turntable. Now, we give this nonconcyclic dual-source scanning geometry. Firstly, the center of the turntable is located in the cone beam formed by and . For some large inspected objects, one cone beam formed by and cannot completely cover its horizontal slice. So, secondly, we set and making , and , located at the same side of , and two pairs of cone beams are parallel, as shown in Figure 1. Now, we give some relevant parameters to describe this scanning geometry. Let denote the distance from to (equal to the distance from to ). Let denote the distance from to the virtual panel detectors which is through and parallel to panel detectors . Two pairs of panel detectors have the same size, where and denote the length and width of the panel detectors, respectively. To obtain sufficient projection data, the distance from to must be less than . According to the location of the three points , , and , we know that distance from to is larger than the distance from to . So two X-ray sources are nonconcyclic in this scanning geometry. The maximum horizontal FOV is in nonconcyclic scanning geometry , where is the distance from collimator of the detector to the crystal of the detector.
3. Reconstruction Formula
For the nonconcyclic dual-source circular scan mode above, we give the reconstruction formula in this section. We know that the key point to BPF algorithm is to obtain the Hilbert image from projections along some directions. The problem we face is how to weigh each set of the derivatives of two pairs of projection data to obtain two differentiated backprojection (DBP) images, and how to merge them into an entire DBP image that is related to the Hilbert image.
For the deduction of the reconstruction formula, we need give some denotations for the scan mode in Section 2. As shown in Figure 2, we establish 3D Cartesian coordinate system , where -axis is the rotating axis. Like the deduction of many CT reconstruction formulas, we also adopt two virtual panel detectors whose centers are and , where the three points , , and are collinear. Let denote the projection point of to the upper side line of two virtual panel detectors, as shown in Figure 2. We need to establish rotating coordinate system in the deduction, and let denote the rotating angle that is a clockwise angle from -axis to -axis. We set the 2D coordinate system () in two virtual panel detectors, where the direction vector of in coordinate system is , and the direction vector of is the same direction with -axis.
Let denote the density function of the inspected object where is a reconstructed point on the inspected object. Let denote the DBP image of , where is an angle measured from the -axis anticlockwise in the plane . Let denote the projection data under X-ray source , and denote the DBP image from . Let denote the distance between the points and , and must satisfy and  that indicates that the projection area of the inspected objects under two X-ray sources is some what overlap. Let denote the projection address of in system under X-ray source . Let above.
Now, using the idea of FDK algorithm, we deduct the formula of DBP image from the fan-beam DBP formula for RT multiscan modes [5, 6]. The formula deduction is divided into two kinds of situations: (i) is on the middle plane where ; (ii) is on the off-middle plane where .
(i) If is on the middle plane, we may directly obtain the cone beam DBP image from the fan-beam DBP  as follows: where where where is a small positive number that is determined by the projection overlapping area, and is a mollification kernel function as follows:
(ii) If is on an off-middle plane, for obtaining we need to define the oblique surface which is through the points , , and . Let denote the intersection point between -axis and the oblique surface, and we know from Figure 2 above. Now, we establish the coordinate system and give the relevant parameters in the oblique surface. Let denote the coordinate system in the oblique surface, where , is the same direction with the vectors and , respectively. Let denote a vector from to and an angle variable in the oblique surface, respectively, and denote the distance from to in the oblique surface.
We know that X-ray source is regarded as a fulcrum in FDK algorithm, and an off-middle plane is approximately obtained by inclining the middle plane. Now, based on the idea of FDK algorithm, we give the steps of deduction of in the off-middle plane as follows: (i) writing using the variables in the oblique surface; (ii) finding the relation between and , where is the rotation angle increment in the middle plane, and is the rotation angle increment in the oblique plane; (iii) finding the relation between and ; (iv) calculating ; (v) obtaining by accumulating all for the angle variable .
Without loss of generality, we give the deduction of referring to the steps above. From the formula (2), making use of the parameters in the oblique surface , we obtain. where . Obviously, is , when .
We can obtain the relation between and from Figure 2 as and the relation between and as Since is in the plane , we can obtain We easily calculate the distance from to the detectors in the oblique surface, Now, we substitute formulas (7), (8), (9), and (10) to (6) and obtain by accumulating all for the angle variable as where Similarly, we can obtain where where . When , the formulas (11) and (13) are (2) and (3), respectively.
We need two steps for reconstructing . Firstly, we need to obtain the Hilbert image of each layer according to the reference . Using the relation of the Hilbert image and the DBP image, we can obtain from the formulas (1), (2), (3), (11), and (13), where is an arbitrary point on the inspected object. Secondly, making use of the virtual trajectories and virtual PI-lines in [12, 13], we can obtain the following formula based on the finite inversion formula of Hilbert transform: where , , and the constants , , and relate to and . We can obtain from the integral of along the virtual PI-lines . However, since the PI-lines are virtual except the middle plane, we cannot obtain an accurate . So the proposed reconstruction formula is approximated on the off-middle planes.
4. Numerical Experiments
To validate our algorithm, we perform some numerical experiments with simulated data in this section. 3D Shepp-Logan phantom is used to get the simulated data. The parameters of the phantom in 3D Cartesian coordinate system are listed in Table 1, where is the center coordinate of an ellipsoid, and three variables and denote the length of three half axis of an ellipsoid, and is the rotating angle of an ellipsoid in the plane . The parameters of two pairs of X-ray sources and panel detectors in the scanning geometry are the same as follows: , , and the length and width of the panel detectors , which is composed of 257 × 257 detector cells.
According to the parameters above, we can calculate the horizontal diameter of the maximum FOV formed by a set of X-ray source and panel detector is 60.82 mm. From the parameters of 3D Shepp-Logan phantom in Table 1, we calculate the longest axis of ellipsoid along -axis to be 97.9 mm which is greater than 60.82 mm. So we cannot reconstruct its CT image using Cardiac dual-source CT scanning geometry. For acquiring the complete CT data of the 3D Shepp-Logan phantom, we adapt the nonconcyclic dual-source circular cone beam scanning geometry with a larger FOV in Section 2. In this scanning geometry, we set and which satisfie the conditions above. Each panel detector takes 720 projections within the angle range from 0 to . Two digital radiography (DR) images under the 100th projection angle are shown in Figure 3. In CT image reconstruction, we use as the direction of Hilbert transform, and . We reconstruct the CT images from the formulas (15) and (16). Three-image matrix of a horizontal slice is , as shown in Figure 4. Two-image matrix of a slice perpendicular to -axis is , as shown in Figure 5. Two-image matrix of a slice perpendicular to -axis is , as shown in Figure 6. For two three-dimensional projection data whose size is , CT image reconstruction takes about 1200 seconds by using CPU and 17.778 seconds by using GPU, where the size of CT image is .
In this work we give nonconcyclic dual-source circular cone beam scan mode with a larger FOV, and deduce the reconstruction formula. Using two pairs of projections obtained from this nonconcyclic dual-source scanning geometry, the FOV is enlarged effectively in the same equipment condition without data rebinning. It is because of the fact that for the real CT system, the flux output from X-ray source is not isotropic, and then the data acquired in this scanning mode using small panel detectors are relative to more uniform intensity of the flux output than a large one. The experiment confirmed that our reconstruction method is effective, when a cone angle is small.
This work was supported in part by three grants from the National Natural Science Foundation of China (61201430, 61002041, and 61201431), International Scientific and Technological Cooperation Program of Shenzhen (Grant JC201105190923A), China Postdoctoral Science Foundation and Shandong province Postdoctoral Innovation Foundation.
- E. A. Sivers, “Use of multiple CT scans to accommodate large objects and stretch dynamic range of detectability,” Nuclear Instruments and Methods in Physics B, vol. 99, pp. 761–764, 1995.
- E. A. Sivers, W. A. Snyder, S. A. Ellingson et al., “CT Multiscan: using small area detectors to image large components,” Journal of Engineering for Gas Turbines and Power, vol. 118, pp. 711–716, 1996.
- Y. Q. Sun, Researches on several application problems in industrial CT [M.S. thesis], Capital Normal University, Beijing, China, 2006.
- F. Zhao, H. N. Lu, and C. L. Sun, “New scan mode for 2D-CT and its reconstruction algorithm,” Optech, vol. 32, pp. 284–289, 2006.
- M. Chen, H. T. Zhang, and P. Zhang, “BPF-based reconstruction algorithm for multiple rotation–translation scan mode,” Progress in Natural Science, vol. 18, pp. 209–216, 2008.
- M. Chen, H. T. Zhang, D. F. Chen, and P. Zhang, “Reconstruction algorithm for unilateral off-centered rotation translation multi-scans,” NDT, China, vol. 31, pp. 29–34, 2009.
- Y. Zou and X. Pan, “Exact image reconstruction on PI-lines from minimum data in helical cone-beam CT,” Physics in Medicine and Biology, vol. 49, pp. 941–959, 2004.
- F. Noo, R. Clackdoyle, and J. D. Pack, “A two-step Hilbert transform method for 2D image reconstruction,” Physics in Medicine and Biology, vol. 49, pp. 3903–3923, 2004.
- L. A. Feldkamp, L. C. Davis, and J. W. Kress, “Practical cone-beam algorithm,” Journal of the Optical Society of America A, vol. 1, pp. 612–619, 1984.
- Y. W. Zhang, T. Y. Chai, Z. M. Li, and C. Y. Yang, “Modeling and monitoring of dynamic processes,” IEEE Transactions on Neural Networks and Learning System, vol. 23, pp. 277–284, 2012.
- Y. W. Zhang, H. Zhou, S. J. Qin, and T. Y. Chai, “Decentralized fault diagnosis of large-scale processes using multiblock kernel partial least squares,” IEEE Transactions on Industrial Informatics, vol. 6, no. 1, pp. 3–10, 2010.
- Y. Zou, X. Pan, and E. Y. Sidky, “Image reconstruction in regions-of-interest from truncated projections in a reduced fan-beam scan,” Physics in Medicine and Biology, vol. 50, pp. 13–27, 2005.
- L. Yu, Y. Zou, E. Y. Sidky, C. A. Pelizzari, P. Munro, and X. Pan, “Region of interest reconstruction from truncated data in circular cone-beam CT,” IEEE Transactions on Medical Imaging, vol. 25, no. 7, pp. 869–881, 2006.
- Y. Sidky Emil, Y. Zou, and X. Pan, “Minimum data image reconstruction algorithms with shift-invariant filtering for helical, cone-beam CT,” Physics in Medicine and Biology, vol. 50, pp. 1643–1657, 2005.
Copyright © 2013 Ming Chen et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.