Abstract:
A cone-beam scanning system scans along a half circle. The reconstruction uses a weighting function which decreases for rows farther from the scan plane to take the redundancy of the projection data into account. Another embodiment uses a circle plus sparse helical scan geometry. Image data can be taken in real time.

Description:
REFERENCE TO RELATED APPLICATION  
       [0001]     The present application claims the benefit of U.S. Provisional Patent Application No. 60/776,666, filed Feb. 27, 2006, whose disclosure is hereby incorporated by reference in its entirety into the present disclosure. 
     
    
     STATEMENT OF GOVERNMENT INTEREST  
       [0002]     The work leading up to the present invention was supported by NIH Grants 8 R01 EB002775, R01 9 HL078181, and 4 R33 CA94300. The government has certain rights in the invention. 
     
    
     FIELD OF THE INVENTION  
       [0003]     The present invention is directed to imaging and more specifically to a half-scan imaging technique using a weighting function to increase temporal resolution.  
       DESCRIPTION OF RELATED ART  
       [0004]     The use of the half-scan method in cone beam CT has been a hot topic in recent years owing to the resultant improvement in temporal resolution. There are currently several different types of cone beam half-scan schemes, such as FDK-based, cone beam filtered-backprojection-based (CBFBP), and Grangeat-based. Each scheme uses planar scanning trajectories (circular or non-circular) to conduct the half-scan scheme. Theoretically, a circular half scan can acquire approximately the same information in the radon domain as a circular full-scan in terms of the first derivative radial data, as long as the reconstructed object is within a certain size based on the derivation of the Grangeat formula. Even in the circular half-scanning range, redundancy still exists. The Grangeat-type half-scan (GHS) maps the spatial projection data into the first derivative radial data and weights them in the radon domain. After adding missing data through linear interpolation/extrapolation in the shadow zone of the radon domain where a circular scan can&#39;t access, a 3-D radon inverse formula is used to get the reconstructed image.  
         [0005]     Current FDK-type half-scan (FDKHSFW) schemes for cone beam CT use Parker&#39;s or other weighting coefficients based on fan beam geometry where same weighting coefficients are applied to all detector rows. The CBFBP algorithm manipulates the redundant projection data in the radon domain, does the half-scan reconstruction in the structure of filtered backprojection (FBP) and achieves almost the same performance as FDKHSFW. The Grangeat-type half-scan scheme outperforms the FDK-type half-scan scheme in the correction of the off-scanning plane attenuation coefficient drop when the shadow zone is filled with the linear interpolated data. However, the spatial resolution of the reconstructed images from GHS is inferior to that of FDKISFW because data interpolation is less involved in FDK than in GHS. Furthermore, GHS cannot handle the truncated data in the longitudinal direction. The CBFBP-related half-scan and FDKHSFW showed obvious attenuation coefficient drop artifacts in the position of the reconstructed image farthest away from Z=0, where Z is the rotation axis. This artifact is undesirable in practice.  
       SUMMARY OF THE INVENTION  
       [0006]     It is an object of the invention to correct the drop problem to a certain degree.  
         [0007]     It is another object of the invention to do so while maintaining spatial resolution.  
         [0008]     To achieve the above and other objects, the present invention is directed to a FDK half scan scheme with a new weighting function that fits the cone beam geometry (FDKHSCW) where the weighting function is cone beam geometry dependent. The FDK half-scan algorithm with the new cone beam weighting function is described. A computer simulation has been conducted, and the FDKHSCW has been evaluated in comparison to FDKFS and FDKHSFW.  
         [0009]     A new cone beam weighting scheme has been heuristically proposed for the FDK-based circular half scan reconstruction (FDKHSCW) to correct the density drop artifact to a certain degree along the rotation axis inherited with original FDK algorithm for large cone angle. Computer simulation on the Shepp-Logan phantom with and without noise showed an improvement when using the FDKHSCW over FDKFS and FDKHSFW in terms of the attenuation coefficient drop when the cone angle is large while maintaining the same visual image quality. FDKHSCW needs additional cone-beam weighting before filtering and only uses a scanning range of [β,180+β+2Δ], where β is the starting projection angle of the x-ray, and Δ is half of the full fan angle; both of them are defined in the scanning plane. As soon as the starting angle is determined, each projection image can be processed (cone-beam weighting for half scan, pixel weighting inherited by FDK, and filtering). So, it will take less time to reconstruct an object in comparison to the full scan scheme, a very desirable feature in practice. Here the half scan is defined as 180° plus cone angle of the scan geometry. In addition, the half-scan scheme provides a flexibility to choose any starting point for reconstruction as long as the scanning range is guaranteed, another preferable feature for cone beam CT dynamic imaging. If a full circle scan is performed, to increase temporal resolution of the system and cone beam CT reconstruction, a multiple of half scan reconstructions can be performed from the full circle scan by choosing the different starting point. Therefore it is another objective of the invention that using the half scan algorithm to reconstruct a multiple of half scan reconstructions from a circle or multiple circle scan projection images of an object to increase temporal resolution for cone beam CT dynamic imaging scan.  
         [0010]     Based on the idea proposed by Silver (M. D. Silver, “A method for including redundant data in computed tomography,”  Med. Phys.  27, 773-774 (2000)), we can even conduct an extended half-scan scheme by making the scanning range larger than 180+2Δ applying this new cone beam weighting function for better noise characteristic.  
         [0011]     The circular cone-beam half-scan weighting scheme works better for low contrast objects. We can see from our simulation on Shepp-Logan phantom that the largest compensation is within 0.03 in terms of attenuation coefficient. We expect that FDKHSCW can show improvement in terms of intensity drop in high-contrast phantoms, like a Defrise disk phantom. Yet it is more promising with low-contrast phantoms.  
         [0012]     Other proposed modified FDK methods called T-FDK and FDK-SLANT, also corrected the attenuation coefficient drop to some extent along the rotation axis inherited in FDK with a larger cone angle. There is a difference between these methods and FDKHSCW. Although the results of these methods showed similar correction to FDKHSCW, FDK-SLANT and T-FDK need to be parallel rebinned from cone beam data. That means the filtering portion would not start until the whole set of data acquisition and parallel resorting procedures are completed and then followed by backprojection for image reconstruction. FDKHSCW possess the advantage that once a 2-D projection data is acquired, the filtering portion can start and be immediately followed by backprojection. As long as the gantry speed and readout rate is high enough, this scheme can provide almost real time monitoring when continuous dynamic imaging is conducted. Wang (G. Wang, “X-ray micro-CT with a displaced detector array,”  Med. Phys.  29, 1634-1636 (2002)) developed a weighting scheme for cone beam full circular scan reconstruction on a displaced detector array without rebinning the projection data for reconstruction. As for the redundant area, our scheme can be applied to this algorithm by adjusting the weighting conditions in the scanning range.  
         [0013]     Recently, a new circular 3-D weighting reconstruction algorithm was proposed to reduce cone beam artifacts based on the investigation on the data inconsistency between a direct ray and its conjugate rays. The basic idea is to have filtered projection data multiplied by correction coefficients that are cone beam geometrically dependent during the backprojection. But the artifact it corrects is not what FDKHSCW tries to correct here, namely attenuation coefficient drop. However, the two schemes can be combined.  
         [0014]     In conclusion, by incorporating a new cone beam weighting scheme, a new FDK-based heuristic half-scan approximate algorithm for circular trajectory has been proposed based on a flat panel detector, and the numerical simulation demonstrated its feasibility.  
         [0015]     Because both the scanning and the processing of the data can be accomplished in less time, imaging can be accomplished much faster. Thus, scanning in four dimensions (three dimensions of space and one of time) becomes possible.  
         [0016]     Related systems and methods are disclosed in the following U.S. patents: U.S. Pat. No. 6,987,831, “Apparatus and method for cone beam volume computed tomography breast imaging”; U.S. Pat. No. 6,618,466, “Apparatus and method for x-ray scatter reduction and correction for fan beam CT and cone beam volume CT”; U.S. Pat. No. 6,504,892, “System and method for cone beam volume computed tomography using circle-plus-multiple-arc orbit”; U.S. Pat. No. 6,480,565 “Apparatus and method for cone beam volume computed tomography breast imaging”; U.S. Pat. No. 6,477,221, “System and method for fast parallel cone-beam reconstruction using one or more microprocessors”; U.S. Pat. No. 6,298,110, “Cone beam volume CT angiography imaging system and method”: U.S. Pat. No. 6,075,836, “Method of and system for intravenous volume tomographic digital angiography imaging”; and U.S. Pat. No. 5,999,587, “Method of and system for cone-beam tomography reconstruction,” whose disclosures are all incorporated by reference in their entireties into the present disclosure. The techniques disclosed in those patents can be used in conjunction with the techniques disclosed herein.  
     
    
     BRIEF DESCRIPTION OF THE DRAWINGS  
       [0017]     Preferred embodiments of the present invention will be set forth in detail with reference to the drawings, in which:  
         [0018]      FIG. 1  shows a scan geometry for the first preferred embodiment;  
         [0019]      FIG. 2  shows redundant regions in the scan geometry of  FIG. 1 ;  
         [0020]      FIGS. 3A-3D  show weighting coefficients;  
         [0021]      FIGS. 4A-4C  show reconstructed sagittal images from a phantom:  
         [0022]      FIG. 4D  shows the phantom;  
         [0023]      FIGS. 4E and 4F  show line profile comparisons from the images in  FIGS. 4A-4C  along the lines shown in  FIG. 4D ;  
         [0024]      FIGS. 5A and 5B  show results with different noise levels;  
         [0025]      FIGS. 5C and 5D  show profile comparisons from the results of  FIGS. 5A and 5B ;  
         [0026]      FIG. 6  shows the Radon domain in a second preferred embodiment; and  
         [0027]      FIGS. 7A and 7B  show a scan geometry in the second preferred embodiment.  
     
    
     DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS  
       [0028]     Preferred embodiments of the invention will be set forth in detail with reference to the drawings, in which like reference numerals refer to like elements or steps throughout.  
         [0029]     The FDK algorithm expands upon the fan beam algorithm by summing the contribution to the object of all the tilted fan beams. The reconstruction is based on filtering and back projecting a single fan beam within the cone. Based on the cone beam geometry in  FIG. 1 , which shows the relative locations of the cone beam emitter or other x-ray source  102  and the plane of the flat-panel detector  104 , the formula of the FDK is:  
                 f   ⁡     (     x   ,   y   ,   z     )       =       1   2     ⁢       ∫   0     2   ⁢   π       ⁢           so   2         (     so   -   s     )     2       ·     {       [         R   β     ⁡     (     np   ,     m   ⁢           ⁢   ξ       )       ⁢     so         so   2     +       m   2     ⁢     ξ   2       +       n   2     ⁢     p   2               ]     *     h   ⁡     (   np   )         }       ⁢     ⅆ   β             ⁢     
     ⁢       s   =         -   x     ⁢           ⁢   sin   ⁢           ⁢   β     +     y   ⁢           ⁢   cos   ⁢           ⁢   β         ;             (   1   )             
 
         [0030]     The * sign denotes the convolution; so: the distance from the x-ray source to the origin; n,m: integer value where n=0 and m=0 corresponds to the central ray passing through the origin; β: the projection angle defined in the scanning plane; p: the virtual detector sampling interval along the t axis; ξ: the virtual detector sampling interval along the Z axis; R β (np,mξ): the actual discrete 2-D projection data; h(np): the discrete one-dimensional ramp filter impulse response along the taxis.  
         [0031]     The pre-weight term,  
         so         so   2     +       m   2     ⁢     ξ   2       +       n   2     ⁢     p   2             ,       
 
 can be factorized into two cosine terms as  
               so   2     +       n   2     ⁢     p   2                 so   2     +       m   2     ⁢     ξ   2       +       n   2     ⁢     p   2             ⁢       so         so   2     +       n   2     ⁢     p   2             .         
 
         [0032]     This means that FDK projects the off-scanning plane projection data into the scanning plane and then follows the 2-D fan beam reconstruction algorithm. In equation (1), the factor of ½ in front of the integral is used to cancel the projection redundancy when a full circular scanning is conducted. This implies that the off-scanning plane projection data has the same redundancy as the projection data in the scanning plane.  
         [0033]     The cone beam half-scan scheme is also the extension of the fan beam half-scan combined with the FDK, in which the weighting coefficients calculated from the scanning plane geometry are applied to all projection rows as follow,  
                 f   ⁡     (     x   ,   y   ,   z     )       =       1   2     ⁢       ∫   0     π   +     2   ⁢   Δ         ⁢           so   2         (     so   -   s     )     2       ·     {       [         ω   (     β   ,     n   ⁢   p       )     ·       R   β     ⁡     (     np   ,     m   ⁢           ⁢   ξ       )         ⁢     so         so   2     +       m   2     ⁢     ξ   2       +       n   2     ⁢     p   2               ]     *     h   ⁡     (   np   )         }       ⁢     ⅆ   β             ⁢     
     ⁢       s   =         -   x     ⁢           ⁢   sin   ⁢           ⁢   β     +     y   ⁢           ⁢   cos   ⁢           ⁢   β         ;             (   2   )             
 
         [0034]     This is the FDKHSFW scheme, where Δ is half the full fan angle of the central scanning plane along the t axis. The off-scanning plane projection data are still treated as they have the same redundancy. ω(β, np) is the discrete weighting coefficient, calculated based on the scanning plane geometry, and can be represented by Parker&#39;s weighting function or any other weighting function as long as it can make a smooth transition between the doubly and singly sampled regions to avoid discontinuities at the borders of these regions. Undoubtedly, FDKHSFW holds all the properties that the FDK full scan scheme does.  
         [0035]     For cone beam projection data off the scanning plane, however, it is impossible to obtain completely doubly sampled projections for a single circular orbit acquisition, even if projections are sampled over 360°. In other words, the projection redundancy becomes less and less when projection rows get further away from the scanning plane. If the FDK algorithm had been directly applied to un-weighted half-scan projection data, the reconstructed images would unavoidably have artifacts. One way to handle the weighting on the less redundancy projection row data away from scanning plane, is proposed as follows:  
               ω   ⁡     (       β   ′     ,   np     )       =     {                     sin   2     (       π   4     ⁢       β   ′         Δ   ′     -       tan     -   1       ⁡     (     np     so   ′       )             )     ,           0   ≤     β   ′     ≤       2   ⁢     Δ   ′       -     2   ⁢           ⁢       tan     -   1       ⁡     (     np     so   ′       )                       1   ,               2   ⁢     Δ   ′       -     2   ⁢           ⁢       tan     -   1       ⁡     (     np     so   ′       )           ≤     β   ′     ≤     π   -     2   ⁢           ⁢       tan     -   1       ⁡     (     np     so   ′       )                           sin   2     (       π   4     ⁢       π   +     2   ⁢     Δ   ′       -     β   ′           Δ   ′     +       tan     -   1       ⁡     (     np     so   ′       )             )     ,             π   -     2   ⁢       tan     -   1       ⁡     (     np     so   ′       )           ≤     β   ′     ≤     π   +     2   ⁢     Δ   ′                 ⁢     
     ⁢   where   ⁢     
     ⁢     β   ′       =         β   ·     1       1   +       m   2     ⁢       ξ   2     /     so   2                 ⁢     
     ⁢     so   ′       =             so   2     +       m   2     ⁢     ξ   2           ⁢     
     ⁢     Δ   ′       =       tan     -   1       ⁡     (     MO     so   ′       )             ;               (   3   )             
 
         [0036]     β′ is the cone-weighting angle. β′ is dependent on the position of the row projection data in the Z direction (rotation axis). Δ′ half of the titled fan angle that is adopted from G. T. Gullberg and G. L. Zeng, “A cone-beam filter backprojection reconstruction algorithm for cardiac single photon emission computed tomography,”  IEEE Trans. Med. Imaging  11, 91-101 (1992). Notice that when mn is zero, this weighting function is actually the Parker&#39;s weighting function for fan-beam.  
         [0037]     By incorporating the cone-beam weighting function with the FDK, the FDKHSCW is obtained as follows:  
                 f   ⁡     (     x   ,   y   ,   z     )       =       1   2     ⁢       ∫   0     π   +     2   ⁢   Δ         ⁢           so   2         (     so   -   s     )     2       ·     {       [         ω   (     β   ,     n   ⁢   p       )     ·       R   β     ⁡     (     np   ,     m   ⁢           ⁢   ξ       )         ⁢     so         so   2     +       m   2     ⁢     ξ   2       +       n   2     ⁢     p   2               ]     *     h   ⁡     (   np   )         }       ⁢     ⅆ   β             ⁢     
     ⁢       s   =         -   x     ⁢           ⁢   sin   ⁢           ⁢   β     +     y   ⁢           ⁢   cos   ⁢           ⁢   β         ;             (   4   )             
 
         [0038]     Please note that the projection data must be weighted prior to being filtered. Since FDKHSFW is the commonly acknowledged scheme for half-scan reconstruction, the requirement for FDKHSCW is that it should produce no more artifacts than FDKHSFW.  
         [0039]     Further investigation of half scan cone beam weighting will now be disclosed. In a circular fan-beam half-scan, there are two redundant regions in the scanning plane in terms of the projection angle β.  FIG. 2  shows that the projecting ray data acquired in region I will have a conjugate ray data in region II. In these two regions, the projection ray data is wholly or partly redundant. If half of the full fan angle is Δ degrees, the half scan range in terms of projection angle defined in the scanning plane is from 0° to 180°±2Δ. The first and second redundant region is from 0° to 4Δ and from 180°−2Δ to 180°+2Δ respectively. In the traditional FDK cone-beam half scan scheme, all the row projection data are weighted by the same set of coefficients defined in the scanning plane because the row projection data away from the scanning plane are expected to have the same redundancy as those in the scanning plane.  
         [0040]     The proposal of the circular cone-beam half scan weighting scheme is based on the idea that the weighting coefficients should be different for projection data in different rows, and for the row projection data furthest away from the scanning plane, it should be weighted less. As of this date, we have not seen any literature discussing this issue. We found that if we use  
         β   ′     =     β   ⁢           ⁢     1       1   +       m   2     ⁢       ξ   2     /     so   2                     
 
 as the weighting angle for different row projection data, then, the weighting coefficients in the first redundant region away from the scanning plane are not much different from those calculated in the scanning plane; the biggest difference is below 0.2 percent if Δ=15° and the half cone angle is also 15°. On the other hand, when β′ is used as the weighting angle in the second redundant region, the weighting coefficients away from the scanning plane behave obviously differently from those in the scanning plane and different from each other at the different rows, thus resulting in the compensation for the density drop in the place away from the scanning plane in the reconstruction image. The weighting angle β′ has two characteristics: first, it has row position dependence that is reflected by mξ, indirectly connected to the cone angle information; second, it has less difference from β when β is in the first redundant region than when β is in the second redundant region. Thus, it is beneficial to construct the cone angle dependent weighting coefficients in the second redundant region to achieve our scheme. 
 
         [0041]     In order to make computer simulation closer to the practical CBCT configuration, geometric parameters are set in terms of physical length (millimeter) rather than normalized units. The distances from the X-ray source to the iso-center of the reconstruction and to the detector are 780 mm, and 1109 mm respectively. The full fan and cone angle are 30 degrees. The detector area is 595×595 mm 2  and has a 512 by 512 matrix size. The voxel size is 0.816 mm 3 . Cartesian coordinate (X, Y, Z) is used to define the object, where Z is the rotation axis. The sampling rate of projection angle is 0.8° with the total number of projection images of 450 for full scan and 262 for half scan. The low contrast Shepp-Logan phantom was used (see Ref. 7 for geometrical parameters), all of its geometrical parameters are multiplied by 200 to simulate the physical length (millimeter) of the phantom.  
         [0042]     Based on the scanning geometrical parameters defined above weighting coefficient distribution associated with FDKHSFW and FDKHSCW are compared by picking up β=46° in the redundant region I and β=192° in the redundant region II.  FIGS. 3A-3D  show, respectively, FDKHSFW β=46°), FDKHSCW (β=46°), FDKHSFW (β=192°) and FDKHSCW (β=192°).  
         [0043]      FIGS. 4A-4C  show the reconstructed sagittal image from different FDK schemes (respectively, FDKFS, FDKHSFW and FDKHSCW) at X=0 mm with the display window [1.005 1.05].  FIG. 4D  shows the phantom.  FIGS. 4E and 4F  show the profile comparison along the solid white vertical and horizontal lines in the phantom image of  FIG. 4D . The ramp filter was used on the noise-free weighted projection data before back-projection.  
         [0044]     In order to test the performance of this new scheme over the quantum noise that is commonly encountered in practical CBCT data acquisition, we generated quantum noise contaminated data. X-ray with 100 kVp was selected which corresponds to an effective photon fluence of 2.9972*10 7  photons/cm 2 ·mR. The exposure level per projection was set to 4 mR, the total exposure levels for FDKFS and FDKESCW are 1800 mR and 1048 mR respectively.  
         [0045]      FIGS. 5A-5D  show the reconstructed results under different noise levels and profile comparisons. A Hamming window is used during filtering to suppress the noise. More specifically,  FIGS. 5A and 5B  show, respectively, FDKFS with total exposure level of 1800 mR and FDKHSCW with total exposure level of 1048 mR, while  FIGS. 5C and 5D  show a profile comparison between FDKFS, FDKHSCW, and the phantom along the solid vertical and horizontal lines in  FIG. 4D .  
         [0046]     A variation of the first preferred embodiment will be presented. In terms of the Radon domain, as  FIG. 6  shows, the dotted points in the circle (zones  602 ) represent the radon value of the object acquired in a circular scan, while the shaded area in the circle (zone  604 ) represents the missing radon points set which cannot be acquired through a circular scan. As argued by Hu, in a circular scan, FDK uses only the redundant points inside the object circle and on the dotted arc boundaries, but does not use the non-redundant points on the solid arc boundaries within the object circle. Thus, the following correction term is used:  
           f   2     ⁡     (     t   ,   s   ,   z     )       =       -           ⁢     1     π   +     2   ⁢   Δ           ⁢       ∫   0     π   +     2   ⁢   Δ         ⁢       z       (     so   -   s     )     2       ⁢       P   β     ⁡     (     z   ′     )       ⁢     ⅆ   β               
     where     
       s   =         -   x     ⁢           ⁢   sin   ⁢           ⁢   β     +     y   ⁢           ⁢   cos   ⁢           ⁢   β           
       t   =       x   ⁢           ⁢   cos   ⁢           ⁢   β     +     y   ⁢           ⁢   sin   ⁢           ⁢   β           
         z   ′     =       so   -   z       so   -   s           
           P   β     ⁡     (   z   )       =       1     2   ⁢   π       ⁢       ∂       σ   β     ⁡     (   z   )           ∂   z             
           σ   β     ⁡     (   z   )       =     ∫           R   β     ⁡     (     t   ,   z     )       ·     so         so   2     +     ξ   2     +     p   2             ⁢     ⅆ   t             
 
         [0047]     If the above reconstruction is designated f 1 (t, s, z), then the final reconstruction is 
 
 f ( t,s,z )= f   1 ( t,s,z )+ f   2 ( t,s,z ) 
 
         [0048]     A second preferred embodiment, which is particularly applicable to breast imaging, will now be disclosed.  
         [0049]     Based on the geometric parameters of current CBBCT, we designed a new scanning scheme for CBBCT. As  FIGS. 7A and 7B  show, the position of the x-ray source  102  is at z=0 cm during the circular scan. After the circular scan, the x-ray source  102  and detector  104  lower down simultaneously while they are still rotating. When the x-ray source gets to the point where z=10, it starts to shoot and keeps shooting between the interval Δl till it finishes eight shoots in this helical scan. For each shoot during the helical scan, the x-ray source still maintains the same collimation as it does in circular scan. This scheme is called sparse spiral scan. In practice, to efficiently implement sparse spiral scan, the system is required to comprises a slip ring on the gantry frame for providing the connection to the electrical power to the on-gantry components and the communication between the two-dimensional detector and the computer system and a motor to move the gantry or the support of the object on which the object rests up or down along the rotation axis;  
         [0050]     The projection angles associated with helical line scan are illustrated by  FIG. 7B . There are eight shoot points during helical scan which cover the angular range of 4 π, and the movement in Z direction is from 48 mm to 128 mm with the increment interval of 10 mm based on the size of the simulated breast phantom.  
         [0051]     Some of the radon data points acquired from this additional scanning trajectory still can be acquired through the circular scan; this is what is called redundancy sampling points in radon domain, and can be efficiently eliminated by the redundant window function (RWF), and the geometric setup of the collimator as during the HL scanning can avoid the redundant sampling radon points between those shooting points on this helical line. Since the collimation during helical line scanning unavoidably induces the longitudinal truncation, a geometric dependent truncation window function (TWF) will be used to handle this case.  
         [0052]     Composite reconstruction framework is probably the most preferable algorithm for the CBCTBI. The reconstructed object is f(  r ), and can be mathematically described by the following equation: 
 
 f (   r   )= f   1 (   r   )+ f   2 (   r   )+ f   HL (   r   ) 
 
 where 
 
 f 1 (  r ): reconstructed object from single circular scan, 
 
         [0053]     f 2  (  r ): reconstructed object from Hui&#39;s term based on single circular scan,  
         [0054]     f HL (  r ): reconstructed object from sparse helical line scan [5],  
         [0055]     Based on  FIG. 7A , the mathematic formula of the f 1 (  r ), and f 2 (  r ) can be described as  
           f   1     ⁡     (     r   →     )       =       1     4   ⁢     π   2         ⁢     ∮         ⅆ   2         (       ⅆ     +     r   →         ·     s   →       )     2       ⁢       P   1     ⁡     (     Y   ,   Z     )       ⁢     ⅆ   β               
     where     
           P   1     ⁡     (     t   ,     Z   0       )       =     ∫       ⅆ           ⅆ   2     ⁢     +     t     ′   ⁢           ⁢   2           +     Z   2           ⁢       P   β     ⁡     (     t   ,     Z   0       )       ⁢     h   ⁡     (     t   -     t   ′       )       ⁢     ⅆ     t   ′               
         Y   =     d   ⁢         r   →     ·   t       d   +       r   →     ·     s   →               ,     
     ⁢     Z   =     d   ⁢           ⁢     z     d   +       r   →     ·     s   →               ,     
     ⁢         f   2     ⁡     (     r   →     )       =       -     1     4   ⁢     π   2           ⁢     ∮       z       (     d   +       r   →     ·     s   →         )     2       ⁢       P   2     ⁡     (   Z   )       ⁢     ⅆ   β                 
     where     
           P   2     ⁡     (   Z   )       =       ∂     ∂   Z       ⁢     ∫       ⅆ           ⅆ   2     ⁢     +     t   2         +     Z   2           ⁢       P   β     ⁡     (     t   ,   Z     )       ⁢     ⅆ   t               
         Z   =     d   ⁢           ⁢     z     d   +       r   →     ·     s   →               ,       
 
         [0056]     The reconstruction term for the helical line scan cab be formatted as a type of filtered backprojection (FBP):  
           f   hl     ⁡     (     r   →     )       =       -     1     4   ⁢     π   2           ⁢     ∫       ⅆ   β     ⁢       ∫     Z   0       Z   n       ⁢     Δ   ⁢           ⁢   Z   ⁢       ∫       -   π     /   2       π   /   2       ⁢         H     z   i       ⁡     (     l   ,   φ     )       ⁢     ⅆ   φ                       
           H     Z   i       ⁡     (     l   ,   φ     )       =            cos   ⁢           ⁢   φ          ⁢         ⅆ   2     ⁢     +     l   2           ⅆ   2       ⁢       w     Z   i       ⁡     (     l   ,   φ     )       ⁢       w     d     Z   i         ⁡     (     l   ,   φ     )       ⁢     (                 2   ⁢   l       d   2       ⁢       ∂       ∑     Z   i       ⁢     (     l   ,   φ     )           ∂   l         +                     ⅆ   2     ⁢     +     l   2           ⅆ   2       ⁢         ∂   2     ⁢     ∂       ∑     Z   i       ⁢     (     l   ,   φ     )             ∂     l   2                 )           
           ∑     z   i       ⁢     (     l   ,   φ     )       =     ∫     ∫       ⅆ           ⅆ   2     ⁢     +     t   2         +     Z   2           ⁢       P     z   i       ⁡     (     t   ,   Z     )       ⁢     δ   ⁡     (       t   ⁢           ⁢   sin   ⁢           ⁢   φ     +     Z   ⁢           ⁢   cos   ⁢           ⁢   φ     -   l     )       ⁢     ⅆ   t     ⁢     ⅆ   Z               
           w     Z   i       ⁡     (     l   ,   φ     )       =     {               1   ,               2   ⁢     lZ   i     ⁢   cos   ⁢           ⁢   φ     +       Z   i   2     ⁢     cos   2     ⁢   φ     -       d   2     ⁢     sin   2     ⁢   φ       &gt;   0               0   ,         otherwise         ⁢     
     ⁢       w     d     Z   i         ⁡     (     l   ,   φ     )         =     {           1   ,           line   ⁢           ⁢     c   1     ⁢     c   2     ⁢           ⁢   not   ⁢           ⁢   get   ⁢           ⁢   in   ⁢           ⁢   the   ⁢           ⁢   region   ⁢           ⁢   of   ⁢           ⁢   Σ               0   ,           line   ⁢           ⁢     c   1     ⁢     c   2     ⁢           ⁢   get   ⁢           ⁢   in   ⁢           ⁢   the   ⁢           ⁢   region   ⁢           ⁢   of   ⁢           ⁢   Σ                     
 
 w z , (l, φ) is the window function used to block out the radon data acquired through helical line scan but have already been accessed by circular scan. Based on the scanning design, the helical line scan will unavoidably encounter the longitudinal truncation during the scanning. Some radon points it acquires do not reflect the actual radon data and should be eradicated during the back-projection. Window W d     z   (l, φ) is used to accomplish this purpose. 
 
         [0057]     While preferred embodiments and variations thereon have been disclosed above, those skilled in the art who have reviewed the present disclosure will readily appreciate that other embodiments can be realized within the scope of the invention. For example, numerical values are illustrative rather than limiting. Also, the invention can be implemented on any suitable scanning device, including any suitable combination of a beam emitter, a flat panel or other two-dimensional detector or other suitable detector, and a gantry for relative movement of the two, as well as a computer for processing the image data to produce images and a suitable output (e.g., display or printer) or storage medium for the images. Software to perform the invention may be supplied in any suitable format over any medium, e.g., a physical medium such as a CD-ROM or a connection over the Internet or an intranet. Therefore, the present invention should be construed as limited only by the appended claims.