The Scientific World Journal

Volume 2013 (2013), Article ID 145198, 5 pages

http://dx.doi.org/10.1155/2013/145198

Research Article

Sparse-Coding-Based Computed Tomography Image Reconstruction

Sang Min Yoon¹ and Gang-Joon Yoon²

¹School of Computer Science, Kookmin University, 77 Jeongneung-ro, Sungbuk-gu, Seoul 136-702, Republic of Korea

²National Institute for Mathematical Science, KT Daeduk 2 Research Center, 463-1 Jeonmin-dong, Yuseong-gu, Daejeon 305-811, Republic of Korea

Received 18 January 2013; Accepted 20 February 2013

Academic Editors: O. Hadar and E. P. Ong

Copyright © 2013 Sang Min Yoon and Gang-Joon Yoon. 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.

Computed tomography (CT) is a popular type of medical imaging that generates images of the internal structure of an object based on projection scans of the object from several angles. There are numerous methods to reconstruct the original shape of the target object from scans, but they are still dependent on the number of angles and iterations. To overcome the drawbacks of iterative reconstruction approaches like the algebraic reconstruction technique (ART), while the recovery is slightly impacted from a random noise (small amount of norm error) and projection scans (small amount of norm error) as well, we propose a medical image reconstruction methodology using the properties of sparse coding. It is a very powerful matrix factorization method which each pixel point is represented as a linear combination of a small number of basis vectors.

1. Introduction

The challenge of continually improving the technology for generating noninvasive medical images of internal anatomy is an area of great interest in the area of radiology. In particular, computed tomography (CT) is one of the most common modalities used for noninvasive medical diagnostic imaging. Cross-sectional CT images are reconstructed from projection data, which is generated by passing X-rays through the target object and measuring the resulting attenuation of those rays. For some noninvasive imaging modalities, the measurements made (i.e., the projection data) can be converted into samples of a Radon transform [1] in order to be reconstructed. In CT, dividing the measured photon counts by the incident photon counts and taking the negative logarithm yields the linear attenuation map of each projection, which, when noted at each projection angle, can be used to determine the Radon transform of the object of interest.

In the fields of accelerator physics, one expects that the relatively simple charged particle beam distributions can be reconstructed from a small number of projections. Tomographic imaging involves the reconstruction of an image from its projections. The reconstruction problem belongs to the class of inverse problems, and it is characterized by the fact that the information of interest is not directly available for measurement. If denotes the unknown distribution and the quantity measured by the imaging device, then the measurement system is written as for the Radon transform [1]. The discrete problem, which is based on expanding in a finite series of basis function, can be written as . The matrix , typically large and sparse, is a discretization of the Radon transform. An approximate solution to this linear system could be computed by iterative methods, which only require matrix-vector products and hence do not alter the structure of .

There are numerous approaches to reconstruct the shape of the target object from numerous angular projections. The iterative reconstruction algorithms are known to generate higher quality CT images than the filtered backprojection (FBP) algorithm. For example, the algebraic reconstruction technique (ART) [2] efficiently solves the inverse problem. Yet, although ART is effective, it still produces noise within a reconstructed image. To reduce the noise from reconstructed images using ART, the postprocessing is required. Unfortunately, it is possible to lose important data while removing the noise. Here, we propose a sparse-coding-based reconstruction method to overcome the drawbacks of iterative reconstruction approaches like ART and to minimize the influence of the deficiency of the projection measurements that are very sparse, while the recovery is slightly impacted from random noises. The recovery is achieved by finding an approximation vector with small and norm errors, which provides a good fit locally and globally. Our contribution in this paper is to solve the inverse problem using sparse coding by reducing both the random noise and the dependency on projection scans, which is less dependent on the number of angular projections than previous iterative reconstruction methods.

2. Our Proposed Approach

To reconstruct the original shape from projected measurements, we regard an original image as a discrete function defined on a domain such that is constant on each cell for and . We number the cells in lexicographical order so that for and . Let be the constant in the th cell. For each angle given in degree, , we project the image along parallel rays with width as follows:

where is the total number of projections, and the coefficient is defined to be the length (or area) of the th ray through the th cell and if the ray does not touch the cell; that is, the value is the ray sum measured along the th ray and is the weighting factor representing the contribution of the th cell to the ray sum. The tomography problem is then related to the reconstruction of an unknown image from the observed vector given as

Here, , and denotes the transpose of a vector/matrix. In general, , and the problem is underdetermined and so is ill-posed. Figure 1 shows our proposed CT image reconstruction approach and mathematical notations in (1) and (2).

Figure 1: Our proposed CT image reconstruction method and its mathematical notations: is the line integral of along the ray , and is the length of the intersection of the ray and the pixel .

This inverse problem emerges in areas of study involving 2D and 3D imaging such as medical imaging, geophysics, and material science [3–5]. To solve the inverse problem (2), many methods such as the least squares method, ART [6, 7], SARTs (simultaneous algebraic reconstruction techniques [8]), and SIRT (simultaneous iterative reconstruction techniques [9]) have been proposed and studied (see [10, 11] and references therein). We observe that almost all entries of are zeros, and the vector from CT images also has sparse pixel values. Based on this observation, we propose a method to solve the inverse problem by applying the compressive sampling (CS) technique. CS pertains to the recovery of from rather a small amount of measurements with . Given an underdetermined systems

where is an matrix, CS enables us to perform exact recovery when is sparse, and the matrix satisfies the restricted isometry property [12, 13] (also see [14, 15]). The recovery performs through the so-called basis pursuit optimization:

Using (), we denote the norm of a vector defined by . In the paper, we also consider the case where noise is added to the projected image, , so that we can model such an imaging system as follows:

In order to recover the sparse image from the inverse problem (5) while preserving intrinsic geometric structures such as edges, we try to find an image which provides a good fit to the original image globally (small amount of ) and locally (small amount of ) as well. So, we propose the following elastic net optimization:

The model in (6) is a combination of the basis pursuit denoising and the ridge regression . In (6), the first term measures the fitting, and the third regularization term is added to recover a sparse data where controls the trade-off between sparsity and reconstruction fidelity. The quadratic term of the regularization gives rise to the grouping effect of highly correlated variables and removes the limitation on the number of selected variables [16]. The basis pursuit denoising enables us to reconstruct simply in the sense, making close to in the sense. We solve the optimization (6) using the feature-sign search algorithm [17].

3. Experiments

The schematic setup for sparse-coding-based CT image reconstruction is illustrated in this section. To efficiently show the robustness of our proposed approach, we have compared our sparse-coding-based image reconstruction method to other popular approaches, such as traditional ART, SIRT, and SART in Figure 2. For fair comparison, we reconstructed an image that has 50 50 resolution from 2250 angular projections around the target object. The previous approaches such as ART (Figure 2(b)), SIRT (Figure 2(c)), and SART (Figure 2(d)), require several iterations to robustly reconstruct the target object (100 iterations in our experiment because the reconstructed images have few improvements in resolution after that.) As shown in Figure 2, there is still a noise effect in the background, but our proposed sparse-coding-based approach (Figure 2(e)) dramatically reduces the noise in the background within a reconstructed image.

(a) Ground truth data

(b) ART-based approach

(c) SIRT-based approach

(d) SART-based approach

(e) Our proposed approach

Figure 2: Comparison of image reconstruction from 2250 angular projections around the target object.

Image reconstruction using rotated angular projection methodologies is very dependent on the number of projections. To show the robustness of the sparse-coding-based image reconstruction methodology, we have quantitatively compared our approach to previous approaches by changing the number of the projections. For this, we evaluated the -norm-based similarity measure called SAD (sum of absolute difference) and -norm based-similarity measure called SSD (sum of squared difference) between reconstructed images and the original image by changing the number of projections. In Figure 3, we show how we robustly reconstruct the original image by calculating the SAD and SSD from the randomly selected projections from 900 to 2700 around the ground truth data between the reconstructed images using ART, SIRT, SART, and our approach and ground truth data. Figure 3 demonstrates that our proposed approach can reconstruct the original shape of the target object while reducing the effect of the number of projections. SAD-based error comparison as shown in Figure 3(a) provides that our proposed reconstruction method is less dependent on the measurement () than other previous approaches, and SSD-based comparison in Figure 3(b) shows that our proposed approach is very efficient to solve the inverse linear problem to recover the original shape of the target object.

(a) Quantitative measurement using SAD

(b) Quantitative measurement using SSD

Figure 3: Quantitative comparison of previous approaches and our proposed approach using SAD and SSA by changing the number of angular projections from 900 to 2700.

4. Discussion

In this paper, we propose a novel reconstruction approach from the projected measurement of the radiation around the target object. This nonparametric approach to the reconstruction of medical CT images using sparse coding shows robustness in the reconstruction of the original shape without prior information of the target object. Sparse coding is a state-of-the-art technique used to reconstruct a sparse data set from a small number of linear measurements. We propose a reconstruction method based on sparse coding, motivated by the fact that medical images are often represented in terms of only a few data pixel values in the spatial domain. Our proposed image reconstruction methodology is less dependent on the number of projections collected around the target object, so the original shape can be recovered with only a few measurements. Based on our experimental evaluation, we argue that the proposed sparse-coding-based CT image reconstruction scheme provides better -norm and -norm error results than previous approaches.

Acknowledgment

S. M. Yoon was supported by the new Faculty Research Program, 2012, of Kookmin University in the Republic of Korea.

References

J. Radon, “On the determination of functions from their integral values along certain manifolds,” IEEE Transactions on Medical Imaging, vol. 5, no. 4, pp. 170–176, 1986.

R. Gordon and G. T. Herman, “Reconstruction of pictures from their projections,” Communications of the ACM, vol. 14, pp. 759–768, 1971.

M. Bertero and P. Boccacci, Introduction to Inverse Problems in Imaging, IOP publishing Ltd., London, UK, 1998.

H. W. Engl, M. Hanke, and A. Neubauer, Regularization of Inverse Problems, Kluwer, Dordrecht, The Netherlands, 1996.

P. C. Hansen, Discrete Inverse Problems: Insights and Algorithms, SIAM, Philadelphia, Pa, USA, 2010.

S. Kaczmarz, “Angenäherte auflösung von systemen linearer gleichungen,” Bulletin International de l'Académie Polonaise des Sciences et des Lettres, vol. A35, pp. 355–357, 1938.

R. Gordon, R. Bender, and G. T. Herman, “Algebraic Reconstruction Techniques (ART) for three-dimensional electron microscopy and X-ray photography,” Journal of Theoretical Biology, vol. 29, no. 3, pp. 471–481, 1970.

A. H. Andersen and A. C. Kak, “Simultaneous algebraic reconstruction technique (SART): a superior implementation of the art algorithm,” Ultrasonic Imaging, vol. 6, no. 1, pp. 81–94, 1984.

P. Gilbert, “Iterative methods for the three-dimensional reconstruction of an object from projections,” Journal of Theoretical Biology, vol. 36, no. 1, pp. 105–117, 1972.

P. C. Hansen and M. S. Hansen, “A MATLAB package of algebraic iterative reconstruction methods,” Journal of Computational and Applied Mathematics, vol. 236, pp. 2167–2178, 2012.

G. T. Herman, Fundamentals of Computerized Tomography: Image Reconstruction from Projection, Springer, New York, NY, USA, 2nd edition, 2009.

E. Candès and T. Tao, “Decoding by linear programming,” IEEE Transactions on Information Theory, vol. 51, no. 12, pp. 4203–4215, 2005.

E. J. Candès, J. K. Romberg, and T. Tao, “Stable signal recovery from incomplete and inaccurate measurements,” Communications on Pure and Applied Mathematics, vol. 59, no. 8, pp. 1207–1223, 2006.

E. Candès, “Compressive sampling,” in Proceedings of the International Congress of Mathematics, pp. 1433–1452, 2006.

D. L. Donoho, “Compressed sensing,” IEEE Transactions on Information Theory, vol. 52, no. 4, pp. 1289–1306, 2006.

H. Zou and T. Hastie, “Regularization and variable selection via the elastic net,” Journal of the Royal Statistical Society B, vol. 65, no. 2, pp. 301–320, 2005.

H. Lee, A. Battle, R. Raina, and A. Y. Ng, “Efficient sparse coding algorithms,” in Advanced in Neural Information Processing Systems (NIPS), vol. 19, 2007.