Research Article | Open Access
Blind Deblurring Reconstruction Technique with Applications in PET Imaging
We developed an empirical PET model taking into account system blurring and a blind iterative reconstruction scheme that estimates both the actual image and the point spread function of the system. Reconstruction images of high quality can be acquired by using the proposed reconstruction technique for both synthetic and experimental data. In the synthetic data study, the algorithm reduces image blurring and preserves the edges without introducing extra artifacts. The localized measurement shows that the performance of the reconstruction image improved by up to 100%. In experimental data studies, the contrast and quality of reconstruction is substantially improved. The proposed method shows promise in tumor localization and quantification.
In the past decade, positron emission tomography (PET) has rapidly become a popular diagnostic imaging modality for tumor detection and cancer staging. PET generates three-dimensional (3D) tomographic images of the distribution of positron-emitting radiotracers within an object, which provides quantitative functional information in vivo. However, the physics of the photon emission and detection process limits the resolution of PET images. The sensitivity and resolution of the PET system is a complex function of many factors, such as positron range, scattering, medium attenuation, photon noncollinearity, detector size, and intercrystal crosstalk. Iterative methods are often used in PET reconstruction because of the ability to handle the imaging system more precisely and to incorporate a prior information in the process.
Figure 1 illustrates a PET imaging system . A positron is emitted following a nuclear transmutation. After traveling a short distance (positron range), the positron annihilates with an electron and produces two photons of 0.511 MeV almost to each other. The photons are then detected by the detector ring. Finally, by recognizing the coincidence photons, a line of response (LOR) can be established to determine the origin of the positron emission. It should be noted that LOR is not a real line due to the finite size of the detector elements. As shown in Figure 1, photons may be scattered to travel along a totally different direction upon reaching the detector ring, and the origin of the photon pair cannot easily be described by the LOR. Therefore, reconstructions obtained from iterative algorithms that determine the system matrix solely based on LOR or extended LOR are often blurry and contaminated by artifacts.
We recently developed a blind deblurring reconstruction technique to reduce blurring in pinhole SPECT imaging . It is natural to apply a similar technique to PET imaging, because SPECT and PET share a similar underlying physic. Our approach is to model the discrepancy of LOR, or the measurement, and the true emission by an independent random variable E, as demonstrated in Figure 1, and to derive the maximum likelihood (ML) solution of the new system incorporating measurement error. In this report, we describe the development of the reconstruction algorithm.
2. Blind Deblurring Reconstruction
where pij, element of system matrix , denotes the probability of detecting an emission from voxel at detector pair . The emitted photon pairs Y, radiotracer concentration , and detected photon pairs are as follows:
The system matrix P can be factorized and correction factors can be applied as follows :
where is the geometric projection matrix with each element representing the probability of a photon pair produced in voxel i reaching detector pair j, ignoring attenuation, and assuming perfect photon-pair collinearity. The values in the matrix are defined by the geometries of each LOR. and are the attenuation correction and detector sensitivity normalization factors, respectively., the positron range factor, is usually omitted in 18F studies in which the positron range is submillimeter, and is the detector blurring factor used to model photon-pair noncollinearity, intercrystal scatter, and penetration, which cause the same photon detected by several adjusting detector elements. In general, the correction can be viewed as weighting and broadening the LOR on top of .
In this work, instead of adding correction factors to the system matrix P, we model the uncertainty caused by positron range, photon emission angle, scatter, and detector response as a blurring factor E that introduces measurement error, which is a random variable independent from emission Y, and modify the system model accordingly. The measurement error introduces blur in the reconstruction image, and a blurred PET reconstruction can be viewed as the convolution of a low-pass point spread function (PSF) with the actual image, where both the PSF and the actual image are unknown in practice. Inspired by the blind deconvolution algorithm introduced by Holmes  and along the same line of research we have applied to SPECT imaging , we formulated a blind deblurring reconstruction algorithm. The algorithm is a modified EM algorithm that includes a convolution kernel to model the blurring factor . The algorithm consists of two iterative updates, instead of one, to reconstruct both the object and the PSF.
In a PET imaging system, suppose , where is the total number of emitted photons, denotes the index of location from which the th pair of photons are emitted, and denotes the location where the kth pair of photons are detected, as shown in Figure 1. We call these emission locations “true emission points.” A finite number of these points form an inhomogeneous Poisson random-point process having the intensity function . With the presence of measurement error, the positional measurement of each emission point is corrupted by a random translation. Let denote this error vector, then the measured data for detector pixel j is related to and by
Here, is statistically independent of all ’s, and they are assumed to be all statistically independent of each other for all photons emitted and identically distributed with a probability density , which is also the PSF of the PET system. In addition, the set of error vectors also constitutes an inhomogeneous Poisson random point process with intensity function .
Now let be the actual number of photon pairs emitted from voxel i, and let be the corresponding error vectors within voxel ; they then follow the Poisson distribution with mean and , respectively, from the results above. We then use the EM algorithm to find the maximum likelihood solution of the system. In our application, and are known measured data, whereas and are unknown data. Here we note the set of true emission vectors and the set of error vectors as
Then the log likelihood of I can be expressed as
where is the vector notation for all . Similarly, the log likelihood of B can be written as
where g is the vector notation for all . The log likelihood of the complete data then can be equivalently expressed in two ways, assuming Y or B being known, that is,
where denotes convolution. The initial is an image of all 1’s, and is the same image normalized to 1. Equations (9) and (10) are then evaluated to acquire a new pair of estimates of and . The PSF of the system is assumed to be real, nonnegative, band limited, and limited in extend. Letting be the frequency components of the PSF that are known to be zero and be the space components of the PSF that are known to be zero, the band-limited and limited-extend constraints are incorporated by executing the following steps in each iteration.(1)The Fourier transform of is taken, and any frequency components that lie within are set to zero.(2)The inverse Fourier transform in step 1 above is taken, and any negative or complex values or values within in the spatial domain are set to zero.
The first step of the process ensures the band-limited constraint, and the second step ensures the reality, nonnegativity, and limited-extend of the PSF. Realness and nonnegativity are implicitly applied to . Equations (9) and (10) and steps (1) and (2) are then iterated until convergence occurs.
The blind deblurring reconstruction algorithm estimates both the spatial radioactivity distribution and the system PSF from the set of blurred projection images. The iteration for reconstruction can be understood as replacing the forward projector in the original EM (denominator of (9) with the new projector using the convolved radioactivity map, and the iteration for solving the PSF can be understood as blind deblurring. This iteration differs from the general image-blind deconvolution in the sense that the kernel is partly known: , the system matrix, is in fact part of the blurring kernel. The more precise the model is, the closer the remainder of blurring kernel, or g, is to a true delta function. In addition, instead of deconvolving an image where both the input and output are 2D images, the input of blind deblurring reconstruction is a series of projection images, and the output is a 3D-image array. This property gives us much more knowledge of the noise distribution within the object, because instead of a single-shot image, we now essentially have multiple samples for each point in the 3D array (although mixed with other points). Both simulation and experimental data were used to validate and evaluate the performance of the blind deblurring EM (BDEM) technique.
3.1. Monte Carlo Simulation
PET simulations were performed utilizing the NCAT phantom covering the chest region [7, 8]. The PET emission data were generated using the Monte Carlo method, with 1 million counts per slice using a geometry corresponding to the design of the GE discovery DSTE PET/CT scanner (GE Healthcare, Milwaukee, WI, USA). The images were reconstructed using the standard EM and the BDEM. The reconstruction image sets were then evaluated using visual inspections and line profiles. The EM reconstruction image was postsmoothed using a Gaussian kernel of 1 pixel full width at half medium, and no post processing was done for BDEM.
3.2. Convergence Study
One major concern with regard to the type of blind deblurring technique used is the effectiveness and convergence of the algorithm. Two hundred iterations of EM and BDEM reconstructions of the NCAT phantom were performed to evaluate the convergence property of the BDEM algorithm. In each iteration, the measurement log-likelihood L of the reconstructed image for EM was calculated as follows :
whereas for BDEM, the log-likelihood L of the reconstruction image was calculated as
Two different settings of limited-extend constraint were used for BDEM reconstruction, and the difference in log-likelihood was compared.
3.3. Comparison with Image Deconvolution
The blurred reconstruction image could always be modeled as a convolution of the true radioactivity with a blurring kernel :
where is the standard EM reconstruction image and * denotes 2D linear convolution. Assuming can be estimated, one could first compute using standard EM iterations (with being replaced by ) and then deconvolve with . However, the so obtained is not the maximum likelihood estimate of given the measurement error; also, the kernel is generally a complex unknown function and is hard to measure. We used the Wiener filter and image blind deconvolution algorithm to denoise and deconvolve the EM reconstruction image, and compared the results with the BDEM reconstruction.
3.4. Physical Phantom Study
A physical phantom study with a water-tank phantom containing 4 spheres of diameters 1.5 cm, 2.0 cm, 3.0 cm, and 3.0 cm was conducted to assess the performance of a BDEM algorithm for a real scanner. Both the water tank and the spheres were filled with , with activity concentrations of 0.20Ci/cc and 1.01 0.20Ci/cc, respectively. The tank was imaged with a GE Discovery DSTE PET/CT scanner (GE Healthcare) in 2D list-mode; the sinogram was extracted and reconstructed using the EM and BDEM techniques.
4. Results and Discussion
4.1. Monte Carlo Simulation
Figure 2 compares the image slices through a 2-cm-diameter tumor in the right lung produced by the EM and BDEM reconstruction techniques. It is clear that the image quality of the BDEM reconstruction is superior to that of the EM reconstruction. The contrast of the lesion of interest is greatly improved, edges are preserved, and artifacts are suppressed. The transverse-view line profile across the tumor also confirms the improvement. The peak contrast of the tumor in the BDEM reconstruction is double that of the EM reconstruction. Although no postsmoothing was performed for the BDEM reconstruction, the noise level in the background of the BDEM reconstruction is lower than that of the EM reconstruction, with postsmoothing by a 1-pixel full width at half medium Gaussian kernel. The mean and standard deviation of a small region of interest in the background region are 36.20 and 25.12 (resp.) for the Gaussian-smoothed EM and 34.83 and 21.28 (resp.) for BDEM, with no postprocessing.
(c) Profile through a 2-cm-diameter tumor as displayed on the transverse view
4.2. Convergence Study
Figure 2 shows the log-likelihood as a function of iteration numbers as calculated in (11) and (12). The measurement log-likelihood of BDEM is a monotonic increasing function of iteration number, which confirms the convergence of the algorithm. It also varies with different PSF constraints and lies within the envelope defined by the EM algorithm, as demonstrated in the figure. Therefore, setting a proper constraint on PSF is important. If the initial PSF is a delta function and no other constraint is set, the BDEM would regress to the regular EM solution. Figure 2 also shows the log-likelihood of BDEM with a - and a -PSF spatial constraint being applied for a reconstruction. The small discrepancy in the convergence of two different constraints indicates that BDEM is not a strong function of PSF constraint: as long as the constraint is reasonable, BDEM would converge to very similar solutions. The figure also indicates that BDEM converges a little faster than conventional EM in terms of number of iterations. It should be noted, however, that the amount of computation for each BDEM iteration is about twice that of a computation of an EM iteration. We have not tested this premise, because the algorithm converges reasonable fast even without order-subset, but the principle of order-subset EM (OSEM) should be applied if necessary.
4.3. Comparison with Image Deconvolution
The results obtained by deblurring the EM reconstruction image with Wiener filter and the image-blind deblurring technique were displayed and compared with the results of the EM and BDEM reconstructions (Figure 4). These image deconvolution results are clearly inferior compared to BDEM reconstruction. The images are still noisy, and the visual improvement of deconvolution is limited. Our explanation is that the BDEM algorithm utilizes the statistical information of both emission and measurement noise in the projection data, which is loss in the reconstruction image. The noise in the projection data commonly appears as streaks or other local or global artifacts in the reconstruction image, which makes it much harder to either identify or clear just from the reconstruction image.
(c) Wiener filter
(d) Image blind deconvolution
4.4. Physical Phantom Study
Figure 4 shows one slice of water phantom with spheres. As with the Monte Carlo study, the image contrast of the BDEM has been improved over the conventional EM, and the mass and edges are well preserved in the reconstruction. The image blurring is reduced, and the contrast is greatly improved (up to 50%), as observed from the line profile from the transverse slice. The shape of the lesions is not distorted, indicating that the algorithm preserves the general shape of objects.
In this work, we demonstrated highly desired reconstruction results with no complex assumption about the imaging system or the object. The blind deblurring reconstruction technique can significantly improve the quality and contrast of the reconstruction as demonstrated in both simulation and experimental scans. This algorithm does not only reconstruct the radiotracer map, but also determines the PSF of the system. The masses and edges are well preserved in the reconstruction image, which can be extremely useful when doctors need to localize, segment, or tally the activities in the possible tumor. Future studies would involve the application of this system in patient imaging and quantitative studies.
- D. L. Bailey, D. W. Townsend, P. E. Valk, and M. N. Maisey, Eds., Positron Emission Tomography, Basic Sciences, D. L. Bailey, D. W. Townsend, P. E. Valk, and M. N. Maisey, Eds., Springer, Berlin, Germany, 2004.
- H. Li, F. Qiao, O. R. Mawlawi, Y. Zheng, and R. X. Zhu, “Blind deblurring reconstruction technique with applications in PET imaging,” in Proceedings of the 4th IEEE International Symposium on Biomedical Imaging: From Nano to Macro (ISBI '07), pp. 173–176, Washington, DC, USA, April 2007.
- 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.
- J. Qi, R. M. Leahy, S. R. Cherry, A. Chatziioannou, and T. H. Farquhar, “High-resolution 3D Bayesian image reconstruction using the microPET small-animal scanner,” Physics in Medicine and Biology, vol. 43, no. 4, pp. 1001–1013, 1998.
- T. J. Holmes, “Blind deconvolution of quantum-limited incoherent imagery: maximum-likelihood approach,” Journal of the Optical Society of America. A, vol. 9, no. 7, pp. 1052–1061, 1992.
- J. M. Ollinger and J. A. Fessler, “Positron-emission tomography,” IEEE Signal Processing Magazine, vol. 14, no. 1, pp. 43–55, 1997.
- W. P. Segars, Development and application of the new dynamic NURBS-based cardiac-torso (NCAT) phantom, Ph.D. thesis, The University of North Carolina, Chapel Hill, NC, USA, 2001.
- F. Qiao, T. Pan, J. W. Clark, Jr., and O. R. Mawlawi, “Region of interest motion compensation for PET image reconstruction,” Physics in Medicine and Biology, vol. 52, no. 10, pp. 2675–2689, 2007.
Copyright © 2009 Heng Li 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.