Fourier rebinning and consistency equations for time-of-flight PET planograms. (6th July 2016)

• Record Type: Journal Article
• Authors: Li, Yusheng; Defrise, Michel; Matej, Samuel; Metzler, Scott D
• Is Part Of: Inverse problems. Volume 32:Number 9(2016:Sep.)
• Publication Date: 2016-07-06
• Subjects: Fourier rebinning -- consistency equations -- Fourier consistency equations -- John's equation -- planogram -- time-of-flight (TOF) -- positron emission tomography (PET); Inverse problems (Differential equations) -- Periodicals; 515.357
• DOI: 10.1088/0266-5611/32/9/095004
• Languages: English
• ISSNs: 0266-5611

Abstract

Abstract: Due to the unique geometry, dual-panel PET scanners have many advantages in dedicated breast imaging and on-board imaging applications since the compact scanners can be combined with other imaging and treatment modalities. The major challenges of dual-panel PET imaging are the limited-angle problem and data truncation, which can cause artifacts due to incomplete data sampling. The time-of-flight (TOF) information can be a promising solution to reduce these artifacts. The TOF planogram is the native data format for dual-panel TOF PET scanners, and the non-TOF planogram is the 3D extension of linogram. The TOF planograms is five-dimensional while the objects are three-dimensional, and there are two degrees of redundancy. In this paper, we derive consistency equations and Fourier-based rebinning algorithms to provide a complete understanding of the rich structure of the fully 3D TOF planograms. We first derive two consistency equations and John's equation for 3D TOF planograms. By taking the Fourier transforms, we obtain two Fourier consistency equations (FCEs) and the Fourier–John equation (FJE), which are the duals of the consistency equations and John's equation, respectively. We then solve the FCEs and FJE using the method of characteristics. The two degrees of entangled redundancy of the 3D TOF data can be explicitly elicited and exploited by the solutions along the characteristic curves. As the special cases of the general solutions, we obtain Fourier rebinning and consistency equations (FORCEs), and thus we obtain a complete scheme to convert among different types of PET planograms: 3D TOF, 3D non-TOF, 2D TOF and 2D non-TOF planograms. The FORCEs can be used as Fourier-based rebinning algorithms for TOF-PET data reduction, inverse rebinnings for designing fast projectors, or consistency conditions for estimating missing data. As a byproduct, we show the two consistency equations are necessary and sufficient for 3D TOF planograms. Finally, we give numerical examples of implementation of a fast 2D TOF planogram projector and Fourier-based rebinning for a 2D TOF planograms using the FORCEs to show the efficacy of the Fourier-based solutions.