- About this Journal
- Abstracting and Indexing
- Aims and Scope
- Article Processing Charges
- Articles in Press
- Author Guidelines
- Bibliographic Information
- Citations to this Journal
- Contact Information
- Editorial Board
- Editorial Workflow
- Free eTOC Alerts
- Publication Ethics
- Reviewers Acknowledgment
- Submit a Manuscript
- Subscription Information
- Table of Contents
International Journal of Biomedical Imaging
Volume 2011 (2011), Article ID 870252, 10 pages
A Bayesian Hyperparameter Inference for Radon-Transformed Image Reconstruction
1Department of Informatics, Graduate School of Informatics and Engineering, University of Electro-Communications, Chofugaoka 1-5-1, Chofu, Tokyo 182-8585, Japan
2Division of Transdisciplinary Science, Graduate School of Frontier Sciences, The University of Tokyo, 5-1-5 Kashiwanoha, Kashiwa, Chiba 277-8561, Japan
3Okanoya Emotional Information Project, RIKEN Brain Science Institute (BSI), 2-1 Hirosawa, Wako, Saitama 351-0198, Japan
Received 24 February 2011; Revised 3 August 2011; Accepted 18 August 2011
Academic Editor: Dinggang Shen
Copyright © 2011 Hayaru Shouno 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.
We develop a hyperparameter inference method for image reconstruction from Radon transform which often appears in the computed tomography, in the manner of Bayesian inference. Hyperparameters are often introduced in Bayesian inference to control the strength ratio between prior information and the fidelity to the observation. Since the quality of the reconstructed image is controlled by the estimation accuracy of these hyperparameters, we apply Bayesian inference into the filtered back-projection (FBP) reconstruction method with hyperparameters inference and demonstrate that the estimated hyperparameters can adapt to the noise level in the observation automatically. In the computer simulation, at first, we show that our algorithm works well in the model framework environment, that is, observation noise is an additive white Gaussian noise case. Then, we also show that our algorithm works well in the more realistic environment, that is, observation noise is Poissonian noise case. After that, we demonstrate an application for the real chest CT image reconstruction under the Gaussian and Poissonian observation noises.
In the field of medical imaging and noninvasive measurement, computed tomography (CT) plays an important role in diagnosis. The tomography image is reconstructed from a series of projection data, which are transmitted signals throughout an object, such as X-rays, in multiple directions. A lot of algorithms have been proposed to reconstruct tomography images [1–4]. Radon transform is usually used in mathematical formulations to describe the generating process of the observation data, and inverse of the Radon transform is considered as one of the frameworks for the image reconstruction from observation data; unfortunately, this reconstruction formulation does not care about noisy observations.
In order to improve image quality occurred by noisy observation, several image restoration methods based on the Bayesian inference are discussed in the field of image processing [5, 6]. The purpose of image restoration lends itself naturally to the Bayesian formulation, which infers a posterior probability for the original image using the prior probability of an assumed model for the original image and the corruption process. One well-known strategy for Bayesian image restoration is to adopt the image that maximizes the posterior probability; this is called the maximum a posteriori (posterior) probability (MAP) inference. In MAP inference, the quality of a restoration image is controlled by the strengths ratio between fidelity of the observation process and the prior strength of the model. Hyperparameters are often introduced to describe these strengths of the ratio; however, these hyperparameters inference is a hard problem in the MAP framework. In order to estimate hyperparameters in the MAP framework, the cross-validation method is considered as effective; however, we consider that there exists several problems. The first point is computational cost. In general, the cross-validation requires high computational cost. And the second point is to determine the cost function for the hyperparameters. In the field of image restoration, several types of methods are compared ; however, it is difficult to choose a cost function that is suitable for our problem.
In contrast, from the viewpoint of the Bayesian inference, the hyperparameter inference problem can be expressed naturally. For example, in the field of the image restoration, Molina et al. demonstrated several hyperparameter inference methods in the Bayesian manner in the manner of a hierarchical Bayes inference . Pryce and Bruce and MacKay et al. proposed marginal likelihood maximization to infer those hyperparameters, which is called “evidence” framework or type 2 marginal likelihood maximization [6, 9–13].
In typical conventional methods, which use MAP inference for the computed tomography, a cost function that consists of data-fitting terms and several smoothness constraints has been introduced, and a minimization of the cost function is carried out in order to obtain the reconstructed image from the noisy observation data. Unfortunately, there have been few discussions related to the inference of a proper ratio between the data fitting and the constraints within the MAP framework. On the contrary, from the Bayesian inference point of view, it is natural to discuss the hyperparameter inference for image restoration using an evidence framework [14–16].
In our previous work, we proposed a CT image reconstruction in the manner of Bayes inference with a hyperparameter inference method from the noisy Radon-transformed observation by the evidence framework [12, 13]. In the previous work , however, we only showed that the Bayesian inference framework works well in the specific environment, that is, we assumed the additive white Gaussian noise for the 2-dimensional object observation. Gaussian noise is one of the tractable models for a mathematical formulation; however, in the X-ray CT or positron emission tomography (PET) image observation, we should assume Poissonian noise for the observation. Thus, in this study, we show that our reconstruction algorithm also works well under the Poissonian noise as well as under the Gauss noise case. Considering the Poissonian noise case for the observation which is different from our assuming model, we show a kind of robustness of our reconstruction model.
Moreover, we apply our reconstruction model into the real CT image data. Shepp and Logan phantom, which is usually used for evaluation of CT/PET image reconstruction, is a simple model of the axial cross-section human body. The internal organ of human body is not so much simple, so we use a real CT image data for reconstruction.
In order to explain our Bayesian inference method, we show the conventional CT reconstruction method using filtered backprojection (FBP) under the formulation of the Radon transform. After that, we introduce Bayesian inference into the reconstruction process.
2.1. Radon Transform
Briefly, the Radon transform assumes that the observed signals are transmitted through the target object. Figure 1 shows the schematic diagram of the Radon transform. We describe the target object density as the function of the coordinate and assume that the detectors are aligned along the axis that is rotated in . We can thus denote the relationship between the and coordinates as a rotation
We describe the density of the target as , that is, represents the absorption coefficients of the X-ray in the case of X-ray CT observation. The detectors are aligned on the axis, so we describe the observation as the following formulation, called Radon transform:
2.2. FBP Reconstruction
Before introducing the Bayes inference, we formulate the conventional filtered backprojection (FBP) method. This reconstruction method is mainly formulated on the frequency domain, so we introduce the 2-dimensional Fourier transform of the reconstruction image and its inverse transform pair as where the represents the frequency space coordinate.
Meanwhile, we can apply a 1-dimensional Fourier transform for the of the observed data as . The satisfies the following relationship, which is called a projection theorem:
The FBP method is derived as a coordinate transformation from Cartesian coordinate into the polar coordinate in the inverse Fourier transform (4) where since we can assume that the reconstruction image should be identical to the original image without the observation noise, and we can apply the projection theorem in (5).
Thus, the reconstructed image can be obtained by substituting the coordinate relationship , that is derived from the rotation coordinate in (1) into (7). We call this reconstruction method the FBP method [1, 2].
2.3. Stochastic Model
In this section, we introduce a stochastic observation process into the FBP method. Of course, it is natural to consider Poissonian noise for observation in a realistic model; however, introducing Poissonian process makes it hard to solve the reconstruction in analytic form. We consider that a solvable model is important for understanding the reconstruction process. So in our theoretical framework, we introduced additive white Gaussian noise for observation on the signal . When we consider the Gaussian noise on the image , the observation through the Radon transform can be described as where , and we also treat it as Gaussian noise. In the manner of the conventional image restoration method proposed by Tanaka and Inoue, we also introduce the energy function as follows [14, 16]: The important point of (10) is that the energy function is defined as a kind of quadrature form of the difference between observation and the Radon transform of the reconstruction image . We can thus denote the observation process as where is to normalize a factor called the partition function. The hyperparameter represents a precision parameter that is proportionate to the inverse of the variance of the Gaussian noise , that is, the large indicates a good S/N ratio in the observation. Moreover, introducing both a polar coordinate for the frequency domain and Planchrel's theorem, we can drive the following expression: where and . In the following formulation, we adopt these expressions for the polar coordinate in the frequency domain description for the sake of convenience.
To reconstruct an image from noisy data, using Bayes inference, we also denote the prior distribution. At first, we introduce the following energy function for smoothness of the image: where means gradient operator . This energy plays a role in the Markov random field (MRF) like a constraint since the gradient operation in the discretized space can be regarded as the difference between the neighboring pixels. So, this constraint controls neighboring pixel values to become similar to the target pixel. Then, we also introduce the following energy constraint to avoid taking large absolute pixel values: which are sometimes called “ constraint.” Hence, we treat the prior as Gibbs-Boltzmann distribution of the linear combination of energies and The hyperparameters and control the strength of each constraint. The prior probability can thus be described as follows when we adopt the polar coordinate in the frequency domain:
In order to calculate the denominator value called partition function, we discretize the integral description in the partition function over polar coordinate in frequency domain. When we denote the sampling width for radial direction and polar angle as and , respectively, the discretized sampling point can be described as and , respectively, where and represent the indexes of the radial direction and the polar angle. The angle corresponds to the detectors array angle in the observation. Therefore, we assume that the observation is carried out times in the angle , that is, . The coordinate value represents the position in the radial direction, which means the spatial frequency described in the Fourier transform. From the Nyquist frequency, we can denote , where is an interspace of the detectors in the array. We assume the length of detectors array as , and detectors are assigned with the same interspace in the array, so .
When we discretize the integral in the posterior as , we can derive the marginalized posterior probability as a Gaussian distribution where the descriptions , , and represent , , and , respectively.
2.4. Image Reconstruction
We adopt the marginalized posterior mean for the image reconstruction solution. The posterior mean can be denoted as Thus, , which represents an average set of Fourier expressions, is required to obtain the mean pixel value over the posterior . We can evaluate by discretizing the coordinate as in the previous section, thereby obtaining This solution, called the posterior mean (PM) solution, provides identical result as the MAP does, that is, energy function minimization with the constraint of the smoothness of and , Of course, PM solution is not identical to MAP solution in general; however, in this case, the PM solution and the MAP solution are identical, because the posterior distribution is denoted as a Gaussian distribution.
2.5. Hyperparameter Inference
To reconstruct an appropriate tomography image with our Bayesian inference, we need to assign proper values to the hyperparameters , , and . These hyperparameters and control the strength of constraints, while controls the fidelity of the observation. We infer these hyperparameters by using maximization of marginal log likelihood, which is sometimes called evidence framework [9–11]. The marginal log-likelihood is denoted as the linear combination of log partition functions, where is also denoted as (12), is denoted as (17), and, for the posterior, we introduce ; We use discretization to evaluate each partition function and obtain
To maximize the marginal log likelihood (24), we adopt a naive gradient method corresponding to the hyperparameters , , and , that is, we update hyperparameters using the following rule: where is a sufficiently small value. Those update rules (27) are denoted for , , and , since , , and should be nonnegative values.
3. Evaluation by a Computer Simulation
3.1. Phantom Image Reconstruction
In the computer simulation, we created the Shepp and Logan phantom image in × (pixels) and mapped the image into an origin-centered square with an edge length set to , that is, the area is set to . In the square, the area, which takes distance from the origin larger than , is sometimes unobservable by the detectors from several angles, and we therefore ignore this area during our evaluation. For each angle , we assume the axis as Figure 1, and the origin in the coordinate projects to the point in any angle. We set the sampling parameters as , and the length of the detectors array as .
For hyperparameter inference, we adopt a gradient method that requires initial state of these parameters. In the following simulations, the initial state of , , and is set to be 1. And the number of iterations is limited to the 10000 times.
3.1.1. Gaussian Noise Case
In order to evaluate the performance of the hyperparameter inference, we carry out the simulation in the additive white Gaussian noise environment at first. We assumed that the Gaussian noise was added during the observation process (see (9)) and controlled the noise standard deviation (SD) in the range of 0 to 6. A small SD means the low noise level in the observation process, and the larger SD becomes, the higher additive Gaussian noise level becomes. On the other hand, the large SD observation makes a lot of information loss for reconstruction. The MRF like prior (16) plays a roll of compensation for the information loss. In the simulation, Gaussian noise value sometimes makes fluctuation to the result, so we evaluated the average performance over 10 trials.
The computational cost is mainly consumed by hyperparameters inference. In this study, we adopted gradient method for the hyperparameter inference, so the computational cost depends on the initial state of these hyperparameters and learning coefficients . In typical cases, about 1000~2000 iterations are required to converge for the . It takes 1~2 minutes for Intel Xeon E5530 2.40 GHz with 24 GiB memory.
Figure 2 shows typical results of the reconstruction images. The most left image shows the “true” which means a reconstruction image without any observation noise (). The top part shows the result using our Bayesian inference with inferred hyperparameters, and the bottom one shows the result using the conventional FBP method . Each column corresponds to the SD of the additive Gaussian noise . In Figure 2, we show magnification of each reconstructed image around the edge whose location is located as the white rectangle in the “true” image. The degradation of the image in the conventional FBP result when the noise SD is large is clearly visible, whereas the contrast of the image has been maintained in the Bayesian reconstruction result.
We used the peak signal-to-noise ratio (PSNR) to evaluate the quality of the reconstructed image. The result of this evaluation is shown in Figure 3. The horizontal axis indicates the SD of the , and the vertical shows the PSNR between the reconstructed image for both a noised and noiseless reconstruction images. The solid line shows the median of the Bayesian inference reconstruction results for 10 trials, and each box plot shows the quartiles deviations. The dashed one shows those of the conventional FBP results. The Bayesian inference maintained high reconstruction quality compared to the conventional FBP method. Even when the SD of the noise was 4.0, the PSNR value remained 27.5 (dB). On the other hand, the PSNR of the conventional FBP method was degraded and became 27.7 [dB] when the SD is only 1.5. This demonstrated that the Bayesian inference is more robust to the observation noise rather than the conventional FBP method.
Figure 4 shows the reconstruction performance against the hyperparameter . The horizontal axis shows the value of the hyperparameter , and the vertical one shows the PSNR. We fixed other hyperparameters, and , to the estimated value. Each image in the figure shows the reconstruction result with corresponding hyperparameter setting. The hyperparameter controls the smoothness of the image in the prior equation (16), so too much large makes excessive blurring. Our hyperparameter inference algorithm, shown in the filled rectangle in the figure, looks to provide optimal value.
3.1.2. Poissonian Noise Case
Gauss noise observation is the assumed model in our formulation equation (9); however, the CT/PET observation process is usually described as the Poissonian process. Thus, we should evaluate the reconstruction quality for the Poissonian noise case for the more realistic environment. Of course, our model is designed for the Gaussian noise case, so the performance of reconstruction for the Poissonian process observation might become worse; however, quantitative evaluation is important in the meaning of the approximation.
In the computer simulation, we used R PET package for Poissonian noise sampling . The Poissonian noise value is generated by acceptance-rejection method [18, 19]. Hence, the number of the samplings determines the noise strength property corresponding to the SDs in the Gaussian case, that is, less number of the samplings make low signal-to-noise ratio. The computational cost is also consumed by hyperparameter inference, and it takes about 1000 times iterations for the , that is, it requires ~1 minute for the convergence in our computational environment.
Figure 5 shows the reconstructed image using our Bayesian method and conventional FBP method. The top part shows the result of our Bayesian reconstruction images, and the bottom one shows the conventional FBP result. The most left image shows also the “true” image that means a reconstructed image without any Poissonian noise. In other columns, we show the image with Poissonian noise whose strength is controlled by sampling levels, that is, the S/N ratio becomes worse when sampling level becomes low . In the figure, the noise strength becomes large for the right direction.
Figure 6 shows the quantity evaluation result in the meaning of the PSNR against the sampling level of the observation. The horizontal axis shows the sampling level, and the vertical one shows the PSNR. The solid line shows the median of 10 trials for our Bayesian reconstruction method, and the box plots are quartiles for each sampling levels. The dashed one shows the result of the conventional FBP method. Roughly speaking, the Bayes reconstruction shows better result in the meaning of the PSNR.
3.2. Real CT Image Reconstruction
In order to evaluate the performance of our method for the CT/PET image, we applied our method to a real CT image reconstruction.
We prepare several real CT images provided by Tokushima University Hospital. The acquisition parameters of those HRCT images are as follows: Toshiba “Aquilion 16” is used for imaging device, and each slice image consists of 512 × 512 pixels, and pixel size corresponds to 0.546~0.826 mm; slice thickness is 1 mm. Thus, we set the sampling parameters as .
In order to obtain noise-corrupted data , we simulate Gaussian and Poissonian noised observation for these CT images in the same manner with phantom images.
Figure 7 shows a reconstruction result for the real chest CT image with Gaussian noise. The top row shows our Bayesian method, and the bottom one shows the conventional FBP results. Each column corresponds to the additive Gaussian noise strength for pseudo-observation. In each image, we show a magnification part around bronchus, whose location is described as a black rectangle in the true image. In the Bayesian reconstruction, our MRF prior makes a blurring effect for edge components on the image. The hyperparameter inference mechanism would try to compensate for the information loss, which is caused by the observation noise, by use of the MRF prior. As a result, the large SD makes strong blurring effect to the image. In the magnification image of the Bayesian inference, the bronchus parts are hard to identify around , however, vessels along the bronchus are able to identify for these SDs. In contrast, in the conventional FBP results, both of those parts are just difficult to identify for these SDs. Figure 8 also shows a Poissonian noise case for the chest CT image. We can see the similar tendency to the Gaussian case. In the magnification images, we can identify the bronchus over 1280 sampling levels. In contrast, low sampling level makes large blurring effect by the MRF prior. As a result, bronchus part is hard to identify at fewer than 640 sampling levels. However, the reconstruction result looks better than those of the conventional FBP method.
Moreover, we evaluate the quantitative reconstruction performance by PSNR for the real CT image. Figure 9 shows the result for the Gaussian noise case, and Figure 10 shows the one for the Poissonian case. Each horizontal axis means the noise strength control variable, and the vertical shows the reconstruction performance by PSNR. In both of these results, the Bayes reconstruction method shows better performances in the strong noise area. In contrast, in the weak noise area, the Bayes reconstruction result is just worse than that of the conventional method. We can see that the real CT image is more complex than the Shepp and Logan phantom image like Figure 5, and simple MRF like prior (16) prefers smooth image. Thus, in the weak noise area, complex shape in the real image makes overestimate for the prior strength , which controls blurring effect by the prior. As a result, our Bayesian reconstruction method prefers too much smooth image in the weak noise area; however, the PSNR value stays around 30 (db) for the in the Gaussian case and around 28 (db) for the 2560 samplings in the Poissonian case.
We proposed a hyperparameter inference based on the Bayesian inference in order to reconstruct tomography image formulated by Radon transform. As a stochastic model, we introduced a simple MRF-like distribution for the prior and formulated the observation process by assuming the Gaussian noise channel.
We discretized the image signals in the frequency domain expressed by the polar coordinate in order to evaluate the posterior distribution analytically, resulting in the ability to conduct posterior mean for the reconstructed image. Using the marginal-likelihood maximization method, we show that the hyperparameters introduced as , , and , which allows us to maintain a balance between observation fidelity and prior constraint, could be determined automatically. And using those hyperparameters, we could obtain a higher-quality reconstructed image than when using the conventional FBP method.
In order to evaluate the performance of our method, we simulated two observation noise cases, that is, Gaussian and Poissonian noises. We controlled noise strength by SD for Gaussian noise and sampling levels for Poissonian noise. In the phantom simulation for the Gaussian noise, we confirmed that our hyperparameter inference worked well against the PSNR, and the performance for the reconstruction was better than that of the conventional FBP. The computational cost for the hyperparameter inference depend on the initial state of them; however, about 1200~2000 times iterations made convergence to them for typical cases. In the Poissonian cases, the tendency of the reconstruction performance is similar to the Gaussian case. Our Bayesian method made better performance than the conventional FBP in any noise strength area. However, in the strong Poissonian noise case, that is, the noise could not approximate well by Gaussian noise, we confirmed that the performance of the reconstruction was not good enough for diagnosing. Moreover, we evaluated the performance by a real chest CT image. The real image has a little complex shape against the phantom image. Thus, in the low-noise strength area for both noise cases, the prior components worked too much for the smoothness effect. As a result, the PSNR was just worse than the conventional FBP in such area. However, detail structure of the organ was easy to identify in the obtained image of our model.
In this study, we demonstrate applying our algorithm to the only 2-dimensional image reconstruction. We consider the algorithm easy to extend for 3-dimensional case. Thus, we would reformulate our algorithm for applying to the 3-dimensional image reconstruction and confirm the performance in the future work.
This work is supported by Grant-in-Aids for Scientific Research (C) 21500214 and Innovative Areas 21103008, MEXT, Japan. The authors thank Professor Shoji Kido, Yamaguchi University. He provided a lot of advice about this study and made effort to prepare the CT images. They also thank Professor Junji Ueno, Tokushima University. He provided them with several high-resolution CT image for this study.
- G. N. Ramachandran and A. V. Lakshminarayanan, “Three-dimensional reconstruction from radiographs and electron micrographs: application of convolutions instead of Fourier transforms,” Proceedings of the National Academy of Sciences of the United States of America, vol. 68, no. 9, pp. 2236–2240, 1971.
- L. A. Shepp and B. F. Logan, “Reconstructing interior head tissue from x-ray transmissions,” IEEE Transactions on Nuclear Science, vol. 21, pp. 228–236, 1974.
- L. A. Shepp and Y. Vardi, “Maximum likelihood reconstruction for emission tomography,” IEEE Transactions on Medical Imaging, vol. 1, no. 2, pp. 113–122, 1982.
- P. J. Green, “Bayesian reconstructions from emission tomography data using a modified EM algorithm,” IEEE Transactions on Medical Imaging, vol. 9, no. 1, pp. 84–93, 1990.
- S. Geman and D. Geman, “Stochastic relaxation, gibbs distributions, and the bayesian restoration of images,” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 6, no. 6, pp. 721–741, 1984.
- J. M. Pryce and A. D. Bruce, “Statistical mechanics of image restoration,” Journal of Physics A, vol. 28, no. 3, article 009, pp. 511–532, 1995.
- N. P. Galatsanos and A. K. Katsaggelos, “Methods for choosing the regularization parameter and estimating the noise variance in image restoration and their relation,” IEEE Transactions on Image Processing, vol. 1, no. 3, pp. 322–336, 1992.
- R. Molina, A. K. Katsaggelos, and J. Mateos, “Bayesian and regularization methods for hyperparameter estimation in image restoration,” IEEE Transactions on Image Processing, vol. 8, no. 2, pp. 231–246, 1999.
- D. J. C. Mackay and Cavendish Laboratory, “Hyperparameters: optimize, or integrate out,” in In Maximum Entropy and Bayesian Methods, pp. 43–60, Kluwer, Santa Barbara, Calif, USA, 1996.
- D. J. C. Mackay, Information Theory, Inference and Learning Algorithm, Cambridge University Press, New York, NY, USA, 2003.
- C. M. Bishop, Pattern Recogition and Machine Learning, Springer, New York, NY, USA, 2006.
- H. Shouno and M. Okada, “Bayesian image restoration for medical images using Radon transform,” Journal of the Physical Society of Japan, vol. 79, no. 7, Article ID 074004, 2010.
- H. Shouno and M. Okada, “A hyper-parameter inference for radon transformed image reconstruction using bayesian inference,” in Machine Learning in Medical Imaging, F. Wang, P. Yan, K. Suzuki, and D. Shen, Eds., Lectures Notes in Computer Science, pp. 26–33, Springer, New York, NY, USA, 2010.
- J. I. Inoue and K. Tanaka, “Dynamics of the maximum marginal likelihood hyperparameter estimation in image restoration: Gradient descent versus expectation and maximization algorithm,” Physical Review E, vol. 65, no. 1, Article ID 016125, pp. 016125/1–016125/11, 2002.
- K. Tanaka, “Statistical-mechanical approach to image processing,” Journal of Physics A, vol. 35, no. 37, pp. R81–R150, 2002.
- K. Tanaka, H. Shouno, M. Okada, and D. M. Titterington, “Accuracy of the Bethe approximation for hyperparameter estimation in probabilistic image processing,” Journal of Physics A, vol. 37, no. 36, pp. 8675–8695, 2004.
- R Development Core Team, R: A Language and Environment for Statistical Computing. R Foundation for Statistical Computing, Mendeley, Vienna, Austria, 2009.
- J. Gentle, Elements of Computational Statistics, Springe, New York, NY, USA, 2002.
- W. H. Press, S. A. Teukolsky, W. T. Vetterling, and B. P. Flannery, Numerical Recipes 3rd Edition, The Art of Scientific Computing, Cambridge University Press, Cambridge, UK, 3rd edition, 2007.
- J. Schulz, Diploma thesis: analyse von PET daten unter einsatz adaptiver Glaettungsverfahren, Ph.D. thesis, Humboldt-Universitatet zu Berlin, Berlin, Germany, 2006.