Mathematical Problems in Engineering

Volume 2012, Article ID 109534, 12 pages

http://dx.doi.org/10.1155/2012/109534

## Compact Support FDK Kernel Reconstruction Model Base on Approximate Inverse

^{1}College of Computer, Sichuan University, Chengdu 610065, China^{2}College of Management Science, Chengdu University of Technology, Chengdu 610059, China^{3}College of Science, Xi'an University of Science and Technology, Xi'an 710054, China

Received 31 October 2011; Accepted 22 November 2011

Academic Editor: P. Liatsis

Copyright © 2012 Jun Feng 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.

#### Abstract

A novel CT reconstruction model is proposed, and the reconstruction is completed by this kernel-based method. The reconstruction kernel can be obtained by combining the approximate inverse method with the FDK algorithm. The computation of the kernel is moderate, and the reconstruction results can be improved by introducing the compact support version of the kernel. The efficiency and the accuracy are shown in the numerical experiments.

#### 1. Introduction

In the last years, the approximate inverse method [1–3] is proposed and provides a general strategy for inverse problem. In computed tomography field, the approximate inverse is to process the measured data on the precomputed kernel to get an approximate reconstruction result. Recently, Louis et al. have described the relation between the X-ray and the Radon transform with the formula of Grangeat [4] by some proper operators and derived the kernel of Radon transform for the easy-to-implement circular scanning trajectory [5].

At present, image reconstruction from X-ray cone-beam projections collected along a single circular source trajectory is commonly done with the FDK reconstruction method despite of the drawback that the FDK method is inaccurate [4, 6]. Due to its highly computational efficiency, many modifications for the FDK method have been proposed [7–9], but many of them are concentrated on improving the trajectory to fulfill the data-sufficient condition.

As the integral operators in most tomography problems are compact operators acting on suitable infinite dimensional Hilbert spaces, their inverse operators are not continuous, which would amplify the unavoidable data errors. When a reconstruction work is processing, the demand for highest possible accuracy and the necessary damping of the influence of the unavoidable data errors should be balanced [5]. Compared with the exact reconstruction algorithms, approximate algorithms can provide more flexible tradeoff between the image quality and computational efficiency. Thus, the FDK reconstruction method is highlighted to realize the approximate inversion for circular trajectory.

In this paper, a novel CT reconstruction model is proposed based on the approximate inverse where the kernel of the FDK method is derived and is used to complete the reconstruction. With the classical FDK method, the coordinate of the reconstruction point is first transformed from the globe Cartesian coordinate system to the detector coordinate system. It means that the reconstruction point is combined with the measured projection directly, and, furthermore, the invariance and symmetries of the coordinate system are preserved. Then the reconstruction kernel of the FDK method can be derived by defining some operators while the simplicity is preserved. In some ways, it presents a modification for the FDK method, and it is also a novel realization of the approximate inverse method. With the FDK kernel, the reconstruction can be completed efficiently. However, imposed ring artifacts arise around the area where the density is high.

Ring artifacts mainly arise in a third-generation CT system. They are caused by errors in a single or multiple channels over an extended range of views. It can be found that even a little projection errors can cause perceivable ring artifacts in the image. An error in an isolated view is mapped to a streak by the backprojection process. If the same error is persistent over a range of views, the streaks are blended, and an arc is generated [10].

From the figure of the FDK kernel, it can be observed that many minute oscillations exist at the edge of the kernel, and the FDK kernel has infinite support set. In consideration of the approximate inverse method, the oscillations present the contribution errors in multiple channels. As the shift-invariant property of FDK kernel is utilized in the back-projection process, and when the projections in the whole circle are considered, these errors generate the ring artifacts. Thus, in order to eliminate the ring artifacts, we update the reconstruction model by truncating the kernel with proper radiuses to make the kernel compact. For a given radius, the values of the points far from the center are set as zero, and thus the errors are set as zero. Reconstruction results show that the compact support FDK kernel is advantageous to reduce the ring artifacts and enhance the edge clarity.

The remainder of this article is organized as follows. In Section 2, the approximate inverse method and the kernel of the Radon transform are briefly introduced. In Section 3, the FDK algorithm is combined with the approximate inverse, and the FDK kernel is derived. Then the kernel is truncated to be compact and the compact kernel-based reconstruction model is introduced. And at last some properties of the FDK kernel are discussed. Experiments results and conclusion are presented in Sections 4 and 5.

#### 2. Approximate Inverse Method and Radon Kernel Reconstruction Model

##### 2.1. Approximate Inverse Method

In this section, the approximate inverse method is briefly introduced. For more details, we refer to [1–3, 5].

Let be a compact operator between real Hilbert spaces and . The approximate inverse means a solution operator , which maps the data to , a stable approximation of the solution of the ill-posed problem as follows:

The approximation of is determined with a mollifier , where the mollifier is an approximation of the delta function , for example the Gaussian function. And the parameter is a regularization parameter.

With the auxiliary function we can get the following: where is the adjoint operator of . The solution of the auxiliary function: is called the reconstruction kernel, and the measured data can be directly processed with the kernel to get the reconstruction results.

##### 2.2. Radon Kernel Reconstruction Model

In [5], Louis et al. gave the reconstruction kernel based on the Radon transform with the formula of Grangeat.

In circular tomography, let the condition of Tuy-Kirillove be fulfilled, the inversion of the 3D Radon transform is given as hence, we can get the solution of the auxiliary function as and the is the reconstruction kernel, where is the cone-beam transform of , and its adjoint operator is

The integral operator and multiplication operator are defined as which are defined from the inverse of the 3D Radon transform with the formula of Grangeat [4]

Let denote the Crofton symbol, and setting : (2.11) can be expressed as follows,

With operators above, the inverse formula of the 3D Radon transform shown as (2.11) can be expressed as the operator equation as (2.6), and the reconstruction kernel is derived as (2.7).

As we know that the circular trajectory could not fulfill the sufficient condition, only approximate results are possible. At present, FDK reconstruction method is the most popular method for circular reconstruction. In next section, we concentrate on deriving the FDK kernel from the well-known FDK method and then proposed the compact support FDK kernel reconstruction model.

#### 3. Compact Support FDK Kernel Reconstruction Model

##### 3.1. FDK Reconstruction Method

The 3D FDK reconstruction method is a heuristic development of the 2D Radon transform [6]. From the measured projection data along the intersection of the detector plane and the midplane, the density at points that lie in the midplane can be calculated. Then for a tilted plane which intersect the detector plane along a line parallel to the midplane, it is treated as the midplane of another tilted arrangement CT system. Making the corrections of the rotation and the distance between the actual midplane and the tilted plane, the density at the point in the tilted plane is the sum of the increment contributions from all planes that pass through . The FDK reconstruction method can be expressed as follows: where , and the axis of rotation direction composed the local Cartesian coordinate system, is the origin, is the source point, is the distance from the source point to the hypothetic detector which contains the rotation axis and is parallel to the real detector, is the coordinate of the hypothetic detector plane, denotes the projection acquired at the point , and denotes the rotate angle of the source .

##### 3.2. FDK Kernel Reconstruction Model

Let denotes the position of the source point on the circular trajectory , given a fixed reconstruction point , where , , is the globe coordinate of the point. Then on the local Cartesian coordinate system of , the square of distance from the source to the reconstruction point is then (3.1) is revised into

Let where , are the coordinates of the intersection point on the hypothetic detector of the line from the source to the reconstruction point: . Then (3.3) above can be expressed as

Define three new operators: where the unit vector denotes the direction of the projection. With the cone-beam transform as (2.8) and its adjoint operator as (2.9), the FDK reconstruction method can be denoted as follows: and the inverse of the projection is given as

According to the auxiliary problem , the kernel based on the FDK reconstruction method is derived,

Thus for a suitable mollifier , a novel reconstruction kernel can be obtained. In this work, we choose a translational and rotational invariant function, the Gaussian function as the mollifier

Then according to the approximate inverse method, the projections can be processed on the FDK kernel for reconstruction. Then we obtain the FDK kernel reconstruction model as:

The FDK kernel is computed in numerical experiments, and the shape of the original FDK kernel is shown in Figure 1.

##### 3.3. Compact Support FDK Kernel and the Reconstruction Model

With the FDK kernel reconstruction model, we reconstruct the Shepp-Logan phantom and the Turbell clock phantom in numerical experiments. Reconstruction results are shown in Figures 2(c), 4(c), and 5(c). According to these results, we can see that the results based on the original FDK kernel have ring artifacts. Beside the ring artifacts, the results have homogenous density on the whole.

As we all know, the FDK reconstruction method is a filtered back-projection reconstruction method. From the formula of the kernel as (3.9), the FDK kernel is a convolution type operator. In computing the FDK kernel, as a result of the approximate inverse method, shown in Figure 1, many minute oscillations exist at the edge which make the support set of the FDK kernel infinite. The oscillations locate in two vertical directions passing through the center. And at other points, the values are very little as zero. The kernel gives the contribution of the projections around the reconstruction point. In a practical reconstruction work, based on the theory of the approximate inverse, the projections are managed on the kernel with a convolution. These oscillations present the contribution errors in multiple channels. When the projections in the whole circle is managed in the back-projection process, these errors generate the ring artifacts. Especially when reconstructing a point near a high-value area, the value of the point is influenced by the high-value points and these oscillations, and the value is enlarged, which gives rise to the ring artifacts.

In our study, we employ a simple but useful method to reduce the ring artifacts. In order to eliminate the oscillations and make the kernel compact, the kernel is truncated with different radius. A truncation operator acting on the kernel is present to reach this aim. For a given radius , the values of the point far away from the center is set to zero, as is the point on where is the kernel to be truncated, is the distance from the center to the point .

Then projections are processed on the compact kernel for reconstruction according to the approximate inverse method and then we can denote our compact reconstruction model as follows: where is the reconstruction result with the compact kernel, is the measured projection data.

Results with the compact kernel are also shown in Figures 2(d)–2(f), 4(d)–4(f), and 5(d)–5(f). With the compact kernel, the ring artifacts are all eliminated sufficiently.

##### 3.4. Some Invariances of the Kernel

As the kernel is a function of the reconstruction point , every point may have a different kernel. If the kernel has the invariance property, the efficient of the reconstruction can be improved. In [5], the invariance of the Radon kernel is introduced. Fortunately, the FDK kernel has the property of invariance like the Radon kernel.

From the derivation of the kernel, we can see that the kernel is expressed with the coordinate system on the detector plane. And as coordinate system on the detector plane is shift invariant, the invariance and symmetries of the chose reconstruction relation operator are all directly inherited by the kernel. And with the translational and rotational invariant Gaussian function as the mollifier, the FDK kernel has the invariance below.

For the fixing point , from the explicit formula of the operators , , , , and , for another source point , we can see that these operators are all rotation invariant depending on the local coordinates of the direction . With the unit rotation defined as , the also rotates to coming from with the relation: , then the local coordinates of the points on the kernel keep unchanged, and the kernel keeps unchanged. Thus, we get the following invariance:

As the position is considered, the direction is so close to the direction . Thus, for simplicity, the corresponding kernel can be represented by the kernel of the position with a scale , where and are defined in (3.4), then we get the following equation:

With the above two results, the kernel of an arbitrary point with the source rotates to can be represented as

Then for the reconstruction work, we are needed to compute the kernel at the with the fixed source position for the all directions come from only once, and the kernels for other and can be obtained just with a scale. And these kernels are adopted in the numerical experiments to test our compact FDK kernel reconstruction model.

#### 4. Numerical Experiments

In the experiments, the original FDK kernel reconstruction model and the compact FDK kernel reconstruction model are employed for comparison. We choose the well-known Shepp-Logan phantom and the Turbell clock phantom [11] for experiments. Simulation results with these model are shown in Figures 2, 4, and 5. Table 1 shows the reconstruction parameters about the CT geometry. The number of the acquisition views we choose is 180. More works with other numbers of acquisition views are also carried out, and the same contrast can be getting.

Figure 2 shows the reconstruction results of the midplane of the Shepp-Logan phantom. Figure 2(a) is the original midplane of the Shepp-Logan phantom. For comparison, we reconstruct the phantom with the Radon kernel, and the results are shown in Figure 2(b). Figure 2(c) shows the reconstruction result of the middle plane with the original FDK kernel model. The image is distinct, but many concentric ring artifacts arise in the image, and the edge of the phantom is blurred by the ring artifacts.

Reconstruction results with compact FDK kernel model are shown in Figure 2(d)–2(f) with the radius 80, 40, and 4, respectively. Different radiuses from nontruncation to 4 are all compared to suppress the ring artifacts. And we present the results with radius 80, 40, and 4, and the changing of the ring artifacts is obvious. As the ring artifacts are aroused by the oscillations of the FDK kernel, when the radius gets small, the kernel is truncated to be compact, the oscillations are removed, and the ring artifacts are eliminated simultaneously. We can see that with the compact FDK kernel reconstruction model of , in Figure 2(f), the ring artifacts are suppressed, and the clarity of the image is preserved and not blurred as the truncation is processed. Especially at the edge of the phantom, as the ring artifacts are suppressed, the influence of the ring artifacts is eliminated, and the edge is deblurred. The profiles along the midline of the midplane for the compact FDK kernel reconstruction moedl with are shown in Figure 3.

Figure 4 shows the original phantom and the reconstruction results of the plane apart from the middle plane by 20 mm. Similar details can be seen as Figure 2.

Figure 5 is the results of the Turbell clock phantom. The Turbell clock phantom is a high contrast phantom with many sharp density variations in the *z*-direction. Figure 5 shows the original and reconstruction slice of . Figure 5(a) is the original Turbell clock. Figure 5(b) is the reconstruction result with the Radon kernel. Figure 5(c) is the result with the original FDK kernel model. Results with the compact FDK kernel model where the radius , 40, and 4 are shown in Figures 5(d), 5(e), and 5(f), respectively.

#### 5. Conclusion

In this paper, a novel CT reconstruction model is proposed based on the approximate inverse where the kernel of the FDK method is derived and is used to complete the reconstruction. In order to eliminate the imposed ring artifacts, the kernel is truncated with proper radius. Reconstruction results show that the compact support FDK kernel reconstruction model can suppress the ring artifacts. The proposed reconstruction model preserves the simplicity of the FDK reconstruction method and also provides an alternative to realize the approximate inverse method for circular trajectory. And when the kernel of an algorithm is modified, the corresponding reconstruction formula is also modified accordingly. And this gives us another way to improve the existing reconstruction methods.

#### Acknowledgment

This work is supported in part by Scientific Research Program Funded by Shaanxi Provincial Education Department (Program no. 11JK0504).

#### References

- A. K. Louis and P. Maass, “A mollifier method for linear operator equations of the first kind,”
*Inverse Problems*, vol. 6, no. 3, pp. 427–440, 1990. View at Google Scholar · View at Zentralblatt MATH - A. K. Louis, “Approximate inverse for linear and some nonlinear problems,”
*Inverse Problems*, vol. 12, no. 2, pp. 175–190, 1996. View at Publisher · View at Google Scholar - A. K. Louis, “Development of algorithms in computerized tomography,” in
*The Radon Transform, Inverse Problems, and Tomography*, G. Olafsson and E. T. Quinto, Eds., vol. 63 of*Proc. Sympos. Appl. Math.*, pp. 25–42, Amer. Math. Soc., Providence, RI, USA, 2006. View at Google Scholar · View at Zentralblatt MATH - P. Grangeat, “Mathematical framework of cone beam 3D reconstruction via the first derivative of the Radon transform,” in
*Mathematical Methods in Tomography*, vol. 1497 of*Lecture Notes in Math.*, pp. 66–97, Springer, Berlin, Germany, 1991. View at Google Scholar - A. K. Louis, T. Weber, and D. Theis, “Computing reconstruction kernels for circular 3-D cone beam tomography,”
*IEEE Transactions on Medical Imaging*, vol. 27, no. 7, pp. 880–886, 2008. View at Publisher · View at Google Scholar - I. A. Feldkamp, L. C. Davis, and J. W. Kress, “Practical cone-beam algorithm,”
*Journal of the Optical Society of America A*, vol. 1, no. 6, pp. 612–619, 1984. View at Google Scholar - K. Zeng, Z. Chen, L. Zhang, and G. Wang, “An error-reduction-based algorithm for cone-beam computed tomography,”
*Medical Physics*, vol. 31, no. 12, pp. 3206–3212, 2004. View at Publisher · View at Google Scholar - D. Soimu, I. Buliev, and N. Pallikarakis, “Studies on circular isocentric cone-beam trajectories for 3D image reconstructions using FDK algorithm,”
*Computerized Medical Imaging and Graphics*, vol. 32, no. 3, pp. 210–220, 2008. View at Publisher · View at Google Scholar - Z. Chen and R. Ning, “Volume fusion for two-circular-orbit cone-beam tomography,”
*Applied Optics*, vol. 45, no. 23, pp. 5960–5966, 2006. View at Publisher · View at Google Scholar - J. Hsieh,
*Computed Tomography: Principles, Design, Artifacts, and Recent Advances*, Scincep, Beijing, China, 2006. - H. Turbell and P.-E. Danielsson, “Helical cone-beam tomography,”
*International Journal of Imaging Systems and Technology*, vol. 11, no. 1, pp. 91–100, 2000. View at Publisher · View at Google Scholar